./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/recursive-simple/id_i25_o25-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:07:27,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:07:27,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:07:27,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:07:27,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:07:27,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:07:27,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:07:27,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:07:27,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:07:27,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:07:27,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:07:27,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:07:27,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:07:27,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:07:27,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:07:27,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:07:27,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:07:27,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:07:27,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:07:27,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:07:27,966 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:07:27,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:07:27,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:07:27,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:07:27,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:07:27,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:07:27,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:07:27,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:07:27,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:07:27,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:07:27,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:07:27,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:07:27,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:07:27,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:07:27,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:07:27,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:07:27,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:07:27,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:07:27,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:07:27,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:07:27,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:07:27,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:07:27,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:07:28,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:07:28,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:07:28,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:07:28,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:07:28,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:07:28,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:07:28,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:07:28,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:07:28,011 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:07:28,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:07:28,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:07:28,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:07:28,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:07:28,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:07:28,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:07:28,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:07:28,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:07:28,013 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:07:28,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:07:28,014 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:07:28,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:07:28,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:07:28,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:07:28,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:07:28,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:07:28,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:07:28,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:07:28,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:07:28,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:07:28,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:07:28,016 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:07:28,016 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:07:28,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:07:28,016 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 -> 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 [2022-07-13 18:07:28,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:07:28,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:07:28,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:07:28,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:07:28,230 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:07:28,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2022-07-13 18:07:28,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1d79414/7bf614e3790d498f9d02bb2ed5483c65/FLAG9f703456c [2022-07-13 18:07:28,629 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:07:28,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2022-07-13 18:07:28,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1d79414/7bf614e3790d498f9d02bb2ed5483c65/FLAG9f703456c [2022-07-13 18:07:28,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1d79414/7bf614e3790d498f9d02bb2ed5483c65 [2022-07-13 18:07:28,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:07:28,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:07:28,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:07:28,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:07:28,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:07:28,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beace95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28, skipping insertion in model container [2022-07-13 18:07:28,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:07:28,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:07:28,771 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/recursive-simple/id_i25_o25-2.c[454,467] [2022-07-13 18:07:28,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:07:28,777 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:07:28,786 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/recursive-simple/id_i25_o25-2.c[454,467] [2022-07-13 18:07:28,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:07:28,795 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:07:28,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28 WrapperNode [2022-07-13 18:07:28,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:07:28,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:07:28,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:07:28,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:07:28,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,815 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-07-13 18:07:28,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:07:28,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:07:28,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:07:28,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:07:28,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:07:28,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:07:28,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:07:28,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:07:28,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (1/1) ... [2022-07-13 18:07:28,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:07:28,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:28,846 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-07-13 18:07:28,857 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-07-13 18:07:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:07:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:07:28,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:07:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:07:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-07-13 18:07:28,881 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-07-13 18:07:28,917 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:07:28,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:07:28,976 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:07:28,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:07:28,979 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 18:07:28,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:07:28 BoogieIcfgContainer [2022-07-13 18:07:28,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:07:28,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:07:28,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:07:28,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:07:28,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:07:28" (1/3) ... [2022-07-13 18:07:28,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7537b9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:07:28, skipping insertion in model container [2022-07-13 18:07:28,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:07:28" (2/3) ... [2022-07-13 18:07:28,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7537b9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:07:28, skipping insertion in model container [2022-07-13 18:07:28,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:07:28" (3/3) ... [2022-07-13 18:07:28,988 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2022-07-13 18:07:28,998 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:07:28,998 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:07:29,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:07:29,053 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1087c3c7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@451d0a3b [2022-07-13 18:07:29,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:07:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:07:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 18:07:29,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:29,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:29,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-13 18:07:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:29,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544677363] [2022-07-13 18:07:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:07:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:29,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544677363] [2022-07-13 18:07:29,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544677363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:07:29,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:07:29,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:07:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876614721] [2022-07-13 18:07:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:07:29,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:07:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:07:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:07:29,267 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:07:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:29,308 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-13 18:07:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:07:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-13 18:07:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:29,316 INFO L225 Difference]: With dead ends: 28 [2022-07-13 18:07:29,316 INFO L226 Difference]: Without dead ends: 15 [2022-07-13 18:07:29,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:07:29,322 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:07:29,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:07:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-13 18:07:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 18:07:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 18:07:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-13 18:07:29,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-13 18:07:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:29,383 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-13 18:07:29,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:07:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-13 18:07:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 18:07:29,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:29,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:29,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:07:29,385 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-13 18:07:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:29,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363320620] [2022-07-13 18:07:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:29,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:29,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 18:07:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363320620] [2022-07-13 18:07:29,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363320620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:07:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189976904] [2022-07-13 18:07:29,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:29,447 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-07-13 18:07:29,472 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-07-13 18:07:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:29,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:07:29,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:07:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 18:07:29,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 18:07:29,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189976904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:29,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:29,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-07-13 18:07:29,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543066251] [2022-07-13 18:07:29,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:29,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 18:07:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:29,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 18:07:29,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:07:29,716 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 18:07:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:29,750 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-07-13 18:07:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:07:29,750 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2022-07-13 18:07:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:29,752 INFO L225 Difference]: With dead ends: 22 [2022-07-13 18:07:29,752 INFO L226 Difference]: Without dead ends: 18 [2022-07-13 18:07:29,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:07:29,755 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 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-07-13 18:07:29,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:07:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-13 18:07:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-13 18:07:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 18:07:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-07-13 18:07:29,766 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-07-13 18:07:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:29,766 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-13 18:07:29,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 18:07:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-07-13 18:07:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 18:07:29,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:29,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:29,790 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-07-13 18:07:29,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:29,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-07-13 18:07:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:29,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44168362] [2022-07-13 18:07:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:07:30,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:30,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44168362] [2022-07-13 18:07:30,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44168362] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:07:30,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505912189] [2022-07-13 18:07:30,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:07:30,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:30,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:30,128 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-07-13 18:07:30,129 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-07-13 18:07:30,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:07:30,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:07:30,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 18:07:30,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:07:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:07:30,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 18:07:30,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505912189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:30,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:30,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2022-07-13 18:07:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601456199] [2022-07-13 18:07:30,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:30,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 18:07:30,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:30,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 18:07:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:07:30,453 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-13 18:07:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:30,499 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-13 18:07:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:07:30,500 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2022-07-13 18:07:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:30,500 INFO L225 Difference]: With dead ends: 25 [2022-07-13 18:07:30,501 INFO L226 Difference]: Without dead ends: 21 [2022-07-13 18:07:30,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:07:30,501 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:07:30,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 46 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:07:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-13 18:07:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-13 18:07:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:07:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-13 18:07:30,505 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-07-13 18:07:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:30,505 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-13 18:07:30,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-13 18:07:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-13 18:07:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 18:07:30,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:30,506 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:30,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:07:30,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-13 18:07:30,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-07-13 18:07:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:30,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035344108] [2022-07-13 18:07:30,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:30,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 18:07:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:30,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035344108] [2022-07-13 18:07:30,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035344108] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:07:30,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049566257] [2022-07-13 18:07:30,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:07:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:30,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:30,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:07:30,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:07:30,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 18:07:30,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:07:30,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 18:07:30,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:07:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 18:07:30,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 18:07:31,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049566257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:31,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:31,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-07-13 18:07:31,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567376150] [2022-07-13 18:07:31,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:31,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 18:07:31,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:31,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 18:07:31,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-07-13 18:07:31,297 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 18:07:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:31,488 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-07-13 18:07:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 18:07:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2022-07-13 18:07:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:31,490 INFO L225 Difference]: With dead ends: 39 [2022-07-13 18:07:31,490 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 18:07:31,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 18:07:31,491 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:07:31,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:07:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 18:07:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-13 18:07:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 18:07:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-13 18:07:31,495 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-07-13 18:07:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:31,502 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-13 18:07:31,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 18:07:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-13 18:07:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 18:07:31,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:31,505 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:31,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 18:07:31,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:31,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-07-13 18:07:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:31,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489140292] [2022-07-13 18:07:31,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 18:07:31,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:31,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489140292] [2022-07-13 18:07:31,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489140292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:07:31,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621858070] [2022-07-13 18:07:31,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 18:07:31,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:31,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:31,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:07:31,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:07:31,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 18:07:31,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:07:31,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 18:07:31,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:07:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 18:07:32,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 18:07:33,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621858070] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:33,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:33,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2022-07-13 18:07:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167794061] [2022-07-13 18:07:33,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:33,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 18:07:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 18:07:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-07-13 18:07:33,390 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-13 18:07:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:33,477 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-07-13 18:07:33,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:07:33,478 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2022-07-13 18:07:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:33,478 INFO L225 Difference]: With dead ends: 40 [2022-07-13 18:07:33,479 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 18:07:33,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=302, Invalid=628, Unknown=0, NotChecked=0, Total=930 [2022-07-13 18:07:33,480 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 92 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:07:33,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 89 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:07:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 18:07:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-13 18:07:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 18:07:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-13 18:07:33,484 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-07-13 18:07:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:33,484 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-13 18:07:33,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-13 18:07:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-13 18:07:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 18:07:33,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:33,485 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:33,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 18:07:33,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:33,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2022-07-13 18:07:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:33,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006139989] [2022-07-13 18:07:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 18:07:33,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:33,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006139989] [2022-07-13 18:07:33,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006139989] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:07:33,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437825266] [2022-07-13 18:07:33,879 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 18:07:33,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:33,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:33,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:07:33,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 18:07:33,940 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-13 18:07:33,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:07:33,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 18:07:33,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:07:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 18:07:34,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 18:07:36,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437825266] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:36,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:36,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2022-07-13 18:07:36,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537936367] [2022-07-13 18:07:36,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:36,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 18:07:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:36,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 18:07:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2022-07-13 18:07:36,018 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-13 18:07:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:36,552 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-13 18:07:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-13 18:07:36,552 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) Word has length 58 [2022-07-13 18:07:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:36,553 INFO L225 Difference]: With dead ends: 69 [2022-07-13 18:07:36,553 INFO L226 Difference]: Without dead ends: 63 [2022-07-13 18:07:36,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2022-07-13 18:07:36,556 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:07:36,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 143 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:07:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-13 18:07:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-13 18:07:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-13 18:07:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-13 18:07:36,562 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-07-13 18:07:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:36,562 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-13 18:07:36,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-13 18:07:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-13 18:07:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 18:07:36,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:36,564 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:36,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:07:36,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:36,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:36,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 6 times [2022-07-13 18:07:36,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:36,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868921356] [2022-07-13 18:07:36,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:36,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:36,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:36,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-13 18:07:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:37,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868921356] [2022-07-13 18:07:37,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868921356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:07:37,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999682650] [2022-07-13 18:07:37,258 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 18:07:37,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:37,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:37,259 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:07:37,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 18:07:37,392 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-13 18:07:37,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:07:37,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 18:07:37,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:07:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-13 18:07:37,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-13 18:07:50,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999682650] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:50,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:50,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39, 39] total 75 [2022-07-13 18:07:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252370260] [2022-07-13 18:07:50,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:50,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-13 18:07:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-13 18:07:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=4672, Unknown=0, NotChecked=0, Total=5550 [2022-07-13 18:07:50,167 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-13 18:07:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:51,192 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-07-13 18:07:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-13 18:07:51,193 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) Word has length 112 [2022-07-13 18:07:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:51,196 INFO L225 Difference]: With dead ends: 93 [2022-07-13 18:07:51,196 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 18:07:51,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3864 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2558, Invalid=13192, Unknown=0, NotChecked=0, Total=15750 [2022-07-13 18:07:51,199 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:07:51,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 121 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:07:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 18:07:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-13 18:07:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-13 18:07:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-07-13 18:07:51,206 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 112 [2022-07-13 18:07:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:51,206 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-07-13 18:07:51,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-13 18:07:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-07-13 18:07:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-13 18:07:51,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:51,208 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:51,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 18:07:51,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:51,425 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:51,426 INFO L85 PathProgramCache]: Analyzing trace with hash -678635050, now seen corresponding path program 7 times [2022-07-13 18:07:51,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:51,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094340017] [2022-07-13 18:07:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:07:51,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:07:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:07:51,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:07:51,499 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:07:51,500 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:07:51,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 18:07:51,503 INFO L356 BasicCegarLoop]: Path program histogram: [7, 1] [2022-07-13 18:07:51,506 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:07:51,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:07:51 BoogieIcfgContainer [2022-07-13 18:07:51,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:07:51,542 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:07:51,542 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:07:51,543 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:07:51,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:07:28" (3/4) ... [2022-07-13 18:07:51,544 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:07:51,583 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:07:51,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:07:51,584 INFO L158 Benchmark]: Toolchain (without parser) took 22939.61ms. Allocated memory was 107.0MB in the beginning and 209.7MB in the end (delta: 102.8MB). Free memory was 71.9MB in the beginning and 77.3MB in the end (delta: -5.4MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2022-07-13 18:07:51,584 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 43.8MB in the beginning and 43.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:07:51,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.45ms. Allocated memory is still 107.0MB. Free memory was 71.5MB in the beginning and 81.7MB in the end (delta: -10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 18:07:51,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.01ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:07:51,585 INFO L158 Benchmark]: Boogie Preprocessor took 9.31ms. Allocated memory is still 107.0MB. Free memory was 80.6MB in the beginning and 79.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:07:51,585 INFO L158 Benchmark]: RCFGBuilder took 155.29ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 71.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 18:07:51,585 INFO L158 Benchmark]: TraceAbstraction took 22559.05ms. Allocated memory was 107.0MB in the beginning and 209.7MB in the end (delta: 102.8MB). Free memory was 70.8MB in the beginning and 80.4MB in the end (delta: -9.7MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. [2022-07-13 18:07:51,585 INFO L158 Benchmark]: Witness Printer took 41.11ms. Allocated memory is still 209.7MB. Free memory was 80.4MB in the beginning and 77.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:07:51,586 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 43.8MB in the beginning and 43.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.45ms. Allocated memory is still 107.0MB. Free memory was 71.5MB in the beginning and 81.7MB in the end (delta: -10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.01ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 9.31ms. Allocated memory is still 107.0MB. Free memory was 80.6MB in the beginning and 79.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 155.29ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 71.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22559.05ms. Allocated memory was 107.0MB in the beginning and 209.7MB in the end (delta: 102.8MB). Free memory was 70.8MB in the beginning and 80.4MB in the end (delta: -9.7MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. * Witness Printer took 41.11ms. Allocated memory is still 209.7MB. Free memory was 80.4MB in the beginning and 77.3MB in the end (delta: 3.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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=25, input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25, result=25] [L15] reach_error() VAL [input=25, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 482 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 639 IncrementalHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 69 mSDtfsCounter, 639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 835 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6263 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=7, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 2021 SizeOfPredicates, 13 NumberOfNonLiveVariables, 814 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 1875/3858 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-13 18:07:51,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE