./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-zilu/benchmark04_conjunctive.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/loop-zilu/benchmark04_conjunctive.i -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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b9a965f73c3cec90a7bf30e1abcce707e2acf95b41bbd45e0beb5b55c7fe39d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:10:12,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:10:12,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:10:12,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:10:12,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:10:12,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:10:12,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:10:12,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:10:12,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:10:12,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:10:12,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:10:12,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:10:12,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:10:12,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:10:12,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:10:12,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:10:12,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:10:12,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:10:12,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:10:12,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:10:12,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:10:12,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:10:12,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:10:12,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:10:12,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:10:12,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:10:12,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:10:12,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:10:12,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:10:12,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:10:12,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:10:12,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:10:12,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:10:12,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:10:12,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:10:12,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:10:12,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:10:12,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:10:12,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:10:12,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:10:12,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:10:12,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:10:12,845 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:10:12,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:10:12,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:10:12,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:10:12,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:10:12,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:10:12,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:10:12,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:10:12,848 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:10:12,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:10:12,849 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:10:12,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:10:12,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:10:12,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:10:12,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:10:12,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:10:12,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:10:12,850 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:10:12,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:10:12,850 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:10:12,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:10:12,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:10:12,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:10:12,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:10:12,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:12,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:10:12,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:10:12,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:10:12,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:10:12,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:10:12,852 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:10:12,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:10:12,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:10:12,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 6b9a965f73c3cec90a7bf30e1abcce707e2acf95b41bbd45e0beb5b55c7fe39d [2022-02-20 17:10:13,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:10:13,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:10:13,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:10:13,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:10:13,062 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:10:13,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark04_conjunctive.i [2022-02-20 17:10:13,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c0da2f6/ea94389a8f47438b827e51ec06ed5934/FLAGca2eee0c4 [2022-02-20 17:10:13,471 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:10:13,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark04_conjunctive.i [2022-02-20 17:10:13,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c0da2f6/ea94389a8f47438b827e51ec06ed5934/FLAGca2eee0c4 [2022-02-20 17:10:13,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c0da2f6/ea94389a8f47438b827e51ec06ed5934 [2022-02-20 17:10:13,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:10:13,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:10:13,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:13,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:10:13,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:10:13,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368f3eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13, skipping insertion in model container [2022-02-20 17:10:13,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:10:13,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:10:13,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark04_conjunctive.i[873,886] [2022-02-20 17:10:13,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:13,672 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:10:13,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark04_conjunctive.i[873,886] [2022-02-20 17:10:13,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:13,699 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:10:13,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13 WrapperNode [2022-02-20 17:10:13,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:13,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:13,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:10:13,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:10:13,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,726 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2022-02-20 17:10:13,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:13,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:10:13,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:10:13,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:10:13,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:10:13,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:10:13,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:10:13,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:10:13,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (1/1) ... [2022-02-20 17:10:13,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:13,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:13,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:10:13,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:10:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:10:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:10:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:10:13,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:10:13,864 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:10:13,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:10:14,052 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:10:14,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:10:14,058 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:10:14,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:14 BoogieIcfgContainer [2022-02-20 17:10:14,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:10:14,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:10:14,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:10:14,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:10:14,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:10:13" (1/3) ... [2022-02-20 17:10:14,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45142aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:14, skipping insertion in model container [2022-02-20 17:10:14,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:13" (2/3) ... [2022-02-20 17:10:14,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45142aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:14, skipping insertion in model container [2022-02-20 17:10:14,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:14" (3/3) ... [2022-02-20 17:10:14,076 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark04_conjunctive.i [2022-02-20 17:10:14,081 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:10:14,082 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:10:14,116 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:10:14,126 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:10:14,126 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:10:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:10:14,140 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:14,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:14,141 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1807089479, now seen corresponding path program 1 times [2022-02-20 17:10:14,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:14,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010139058] [2022-02-20 17:10:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:14,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {15#true} is VALID [2022-02-20 17:10:14,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {15#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_~k~0#1, main_~j~0#1, main_~n~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {15#true} is VALID [2022-02-20 17:10:14,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {15#true} assume !!((main_~n~0#1 >= 1 && main_~k~0#1 >= main_~n~0#1) && 0 == main_~j~0#1); {15#true} is VALID [2022-02-20 17:10:14,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {15#true} assume !true; {16#false} is VALID [2022-02-20 17:10:14,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {16#false} is VALID [2022-02-20 17:10:14,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond#1; {16#false} is VALID [2022-02-20 17:10:14,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {16#false} assume !false; {16#false} is VALID [2022-02-20 17:10:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:14,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:14,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010139058] [2022-02-20 17:10:14,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010139058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:14,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:14,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:10:14,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115372359] [2022-02-20 17:10:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:14,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:10:14,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:14,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:14,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:10:14,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:14,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:10:14,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:10:14,343 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:14,365 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:10:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:10:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:10:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-02-20 17:10:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-02-20 17:10:14,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 23 transitions. [2022-02-20 17:10:14,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:14,408 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:10:14,408 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 17:10:14,410 INFO L932 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 [2022-02-20 17:10:14,414 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:14,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 17:10:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 17:10:14,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:14,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,434 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,435 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:14,436 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:10:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:10:14,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:14,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:14,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2022-02-20 17:10:14,438 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2022-02-20 17:10:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:14,439 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:10:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:10:14,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:14,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:14,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:14,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 17:10:14,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2022-02-20 17:10:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:14,445 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 17:10:14,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:10:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:10:14,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:14,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:14,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:10:14,448 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:14,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1806970315, now seen corresponding path program 1 times [2022-02-20 17:10:14,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:14,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662739283] [2022-02-20 17:10:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:14,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {67#true} is VALID [2022-02-20 17:10:14,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_~k~0#1, main_~j~0#1, main_~n~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {67#true} is VALID [2022-02-20 17:10:14,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume !!((main_~n~0#1 >= 1 && main_~k~0#1 >= main_~n~0#1) && 0 == main_~j~0#1); {69#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:10:14,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {69#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1 - 1); {68#false} is VALID [2022-02-20 17:10:14,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {68#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {68#false} is VALID [2022-02-20 17:10:14,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#false} assume 0 == __VERIFIER_assert_~cond#1; {68#false} is VALID [2022-02-20 17:10:14,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-02-20 17:10:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:14,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:14,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662739283] [2022-02-20 17:10:14,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662739283] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:14,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:14,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:10:14,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303207330] [2022-02-20 17:10:14,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:14,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:10:14,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:14,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:14,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:10:14,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:10:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:10:14,563 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:14,599 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-20 17:10:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:10:14,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:10:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-20 17:10:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-20 17:10:14,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2022-02-20 17:10:14,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:14,613 INFO L225 Difference]: With dead ends: 13 [2022-02-20 17:10:14,613 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 17:10:14,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:10:14,615 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:14,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 17:10:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 17:10:14,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:14,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,621 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,621 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:14,623 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 17:10:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:10:14,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:14,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:14,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 17:10:14,624 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 17:10:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:14,625 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 17:10:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:10:14,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:14,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:14,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:14,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 17:10:14,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-02-20 17:10:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:14,628 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 17:10:14,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:10:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:10:14,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:14,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:14,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:10:14,630 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 183170323, now seen corresponding path program 1 times [2022-02-20 17:10:14,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:14,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107055764] [2022-02-20 17:10:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:14,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {116#true} is VALID [2022-02-20 17:10:14,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_~k~0#1, main_~j~0#1, main_~n~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {116#true} is VALID [2022-02-20 17:10:14,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {116#true} assume !!((main_~n~0#1 >= 1 && main_~k~0#1 >= main_~n~0#1) && 0 == main_~j~0#1); {118#(<= 1 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#(<= 1 |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1 - 1); {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {120#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:10:14,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 17:10:14,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 17:10:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:14,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:14,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107055764] [2022-02-20 17:10:14,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107055764] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:10:14,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600622477] [2022-02-20 17:10:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:14,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:14,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:14,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:10:14,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:10:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:14,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:10:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:14,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:14,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {116#true} is VALID [2022-02-20 17:10:14,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_~k~0#1, main_~j~0#1, main_~n~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {116#true} is VALID [2022-02-20 17:10:14,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {116#true} assume !!((main_~n~0#1 >= 1 && main_~k~0#1 >= main_~n~0#1) && 0 == main_~j~0#1); {118#(<= 1 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#(<= 1 |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1 - 1); {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {139#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:10:14,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 17:10:14,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 17:10:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:14,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:14,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 17:10:14,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 17:10:14,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {139#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:10:14,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1 - 1); {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#(<= 1 |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {119#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {116#true} assume !!((main_~n~0#1 >= 1 && main_~k~0#1 >= main_~n~0#1) && 0 == main_~j~0#1); {118#(<= 1 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:14,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_~k~0#1, main_~j~0#1, main_~n~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {116#true} is VALID [2022-02-20 17:10:14,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {116#true} is VALID [2022-02-20 17:10:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:14,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600622477] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:14,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:10:14,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-02-20 17:10:14,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749289220] [2022-02-20 17:10:14,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:14,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:10:14,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:14,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:14,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:10:14,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:10:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:10:14,934 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:14,976 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-20 17:10:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:10:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:10:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-02-20 17:10:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-02-20 17:10:14,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2022-02-20 17:10:15,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:15,010 INFO L225 Difference]: With dead ends: 14 [2022-02-20 17:10:15,010 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 17:10:15,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:10:15,011 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:15,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 17:10:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 17:10:15,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:15,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,015 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,016 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:15,016 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:10:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:10:15,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:15,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:15,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 17:10:15,017 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 17:10:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:15,018 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:10:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:10:15,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:15,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:15,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:15,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 17:10:15,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-02-20 17:10:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:15,020 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 17:10:15,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:10:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:10:15,020 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:15,020 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:15,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:10:15,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:15,237 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1384978123, now seen corresponding path program 2 times [2022-02-20 17:10:15,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:15,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162036466] [2022-02-20 17:10:15,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:15,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:15,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {218#true} is VALID [2022-02-20 17:10:15,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_~k~0#1, main_~j~0#1, main_~n~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {218#true} is VALID [2022-02-20 17:10:15,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume !!((main_~n~0#1 >= 1 && main_~k~0#1 >= main_~n~0#1) && 0 == main_~j~0#1); {220#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:10:15,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {220#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:10:15,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#(<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:15,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1 - 1); {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:15,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {222#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:10:15,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {222#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {219#false} is VALID [2022-02-20 17:10:15,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:10:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:10:15,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:15,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162036466] [2022-02-20 17:10:15,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162036466] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:10:15,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596250102] [2022-02-20 17:10:15,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:10:15,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:15,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:15,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:10:15,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:10:15,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:10:15,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:10:15,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:10:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:15,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:15,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {218#true} is VALID [2022-02-20 17:10:15,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_~k~0#1, main_~j~0#1, main_~n~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {218#true} is VALID [2022-02-20 17:10:15,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume !!((main_~n~0#1 >= 1 && main_~k~0#1 >= main_~n~0#1) && 0 == main_~j~0#1); {232#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:10:15,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {232#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {236#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:10:15,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {236#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:15,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1 - 1); {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:15,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {246#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:10:15,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {219#false} is VALID [2022-02-20 17:10:15,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:10:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:15,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:15,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:10:15,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {219#false} is VALID [2022-02-20 17:10:15,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {246#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:10:15,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1 - 1); {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:15,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {265#(or (<= 1 |ULTIMATE.start_main_~k~0#1|) (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)))} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {221#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 17:10:15,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#(or (<= 2 |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~n~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)))} assume !!(main_~j~0#1 <= main_~n~0#1 - 1);main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1; {265#(or (<= 1 |ULTIMATE.start_main_~k~0#1|) (not (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:10:15,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume !!((main_~n~0#1 >= 1 && main_~k~0#1 >= main_~n~0#1) && 0 == main_~j~0#1); {269#(or (<= 2 |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~n~0#1| (+ 2 |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:10:15,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_~k~0#1, main_~j~0#1, main_~n~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {218#true} is VALID [2022-02-20 17:10:15,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {218#true} is VALID [2022-02-20 17:10:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:15,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596250102] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:15,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:10:15,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-02-20 17:10:15,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686463635] [2022-02-20 17:10:15,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:15,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:10:15,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:15,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:15,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:10:15,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:10:15,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:10:15,628 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:15,707 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:10:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:10:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:10:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2022-02-20 17:10:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2022-02-20 17:10:15,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2022-02-20 17:10:15,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:15,717 INFO L225 Difference]: With dead ends: 10 [2022-02-20 17:10:15,717 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:10:15,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:10:15,718 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:15,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:10:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:10:15,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:15,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,719 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,719 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:15,720 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:10:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:15,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:15,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:15,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:10:15,720 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:10:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:15,720 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:10:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:15,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:15,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:15,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:15,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:10:15,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2022-02-20 17:10:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:15,722 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:10:15,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:15,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:15,724 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:10:15,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:10:15,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:10:15,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:10:15,972 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:10:15,972 INFO L861 garLoopResultBuilder]: At program point L29(lines 19 30) the Hoare annotation is: true [2022-02-20 17:10:15,972 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-02-20 17:10:15,972 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-02-20 17:10:15,973 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:10:15,973 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:10:15,973 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:10:15,973 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-02-20 17:10:15,973 INFO L854 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|))) [2022-02-20 17:10:15,973 INFO L858 garLoopResultBuilder]: For program point L24-3(lines 24 27) no Hoare annotation was computed. [2022-02-20 17:10:15,973 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-02-20 17:10:15,973 INFO L858 garLoopResultBuilder]: For program point L14(lines 14 18) no Hoare annotation was computed. [2022-02-20 17:10:15,975 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-02-20 17:10:15,976 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:10:15,978 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:10:15,979 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:10:15,979 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 17:10:15,979 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 17:10:15,979 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:10:15,979 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 17:10:15,979 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 17:10:15,981 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:10:15,981 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 17:10:15,981 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:10:15,981 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:10:15,981 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:10:15,981 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:10:15,982 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 17:10:15,982 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:10:15,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:10:15 BoogieIcfgContainer [2022-02-20 17:10:15,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:10:15,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:10:15,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:10:15,988 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:10:15,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:14" (3/4) ... [2022-02-20 17:10:15,990 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:10:15,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 17:10:15,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 17:10:15,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:10:15,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:10:16,013 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:10:16,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:10:16,015 INFO L158 Benchmark]: Toolchain (without parser) took 2517.97ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 81.2MB in the beginning and 60.9MB in the end (delta: 20.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-02-20 17:10:16,015 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:10:16,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.19ms. Allocated memory is still 111.1MB. Free memory was 81.0MB in the beginning and 85.3MB in the end (delta: -4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:10:16,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.12ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 83.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:16,016 INFO L158 Benchmark]: Boogie Preprocessor took 23.22ms. Allocated memory is still 111.1MB. Free memory was 83.9MB in the beginning and 82.9MB in the end (delta: 998.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:16,016 INFO L158 Benchmark]: RCFGBuilder took 319.40ms. Allocated memory is still 111.1MB. Free memory was 82.9MB in the beginning and 72.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:10:16,016 INFO L158 Benchmark]: TraceAbstraction took 1915.58ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 71.7MB in the beginning and 63.0MB in the end (delta: 8.7MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:16,016 INFO L158 Benchmark]: Witness Printer took 26.25ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:16,018 INFO L339 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.14ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.19ms. Allocated memory is still 111.1MB. Free memory was 81.0MB in the beginning and 85.3MB in the end (delta: -4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.12ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 83.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.22ms. Allocated memory is still 111.1MB. Free memory was 83.9MB in the beginning and 82.9MB in the end (delta: 998.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.40ms. Allocated memory is still 111.1MB. Free memory was 82.9MB in the beginning and 72.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1915.58ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 71.7MB in the beginning and 63.0MB in the end (delta: 8.7MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Witness Printer took 26.25ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 29 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 10 HoareAnnotationTreeSize, 2 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 28 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 11 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 <= k && n <= j + k - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:10:16,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE