./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_i20_o20-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 80b250f44ccc89442200d93f4bf6653c7aad36a18be4f80bda8f239187e0714d --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 17:45:56,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 17:45:56,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 17:45:56,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 17:45:56,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 17:45:56,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 17:45:56,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 17:45:56,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 17:45:56,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 17:45:56,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 17:45:56,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 17:45:56,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 17:45:56,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 17:45:56,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 17:45:56,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 17:45:56,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 17:45:56,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 17:45:56,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 17:45:56,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 17:45:56,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 17:45:56,780 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 17:45:56,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 17:45:56,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 17:45:56,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 17:45:56,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 17:45:56,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 17:45:56,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 17:45:56,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 17:45:56,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 17:45:56,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 17:45:56,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 17:45:56,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 17:45:56,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 17:45:56,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 17:45:56,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 17:45:56,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 17:45:56,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 17:45:56,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 17:45:56,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 17:45:56,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 17:45:56,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 17:45:56,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 17:45:56,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 17:45:56,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 17:45:56,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 17:45:56,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 17:45:56,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 17:45:56,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 17:45:56,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 17:45:56,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 17:45:56,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 17:45:56,819 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 17:45:56,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 17:45:56,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 17:45:56,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 17:45:56,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 17:45:56,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 17:45:56,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 17:45:56,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 17:45:56,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 17:45:56,820 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 17:45:56,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 17:45:56,822 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 17:45:56,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 17:45:56,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 17:45:56,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 17:45:56,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 17:45:56,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:45:56,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 17:45:56,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 17:45:56,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 17:45:56,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 17:45:56,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 17:45:56,823 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 17:45:56,823 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 17:45:56,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 17:45:56,824 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 -> 80b250f44ccc89442200d93f4bf6653c7aad36a18be4f80bda8f239187e0714d [2022-07-22 17:45:57,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 17:45:57,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 17:45:57,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 17:45:57,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 17:45:57,039 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 17:45:57,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2022-07-22 17:45:57,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af1b81b8/7641d87ad6c741acbcf323b7beac7218/FLAG5f3740a63 [2022-07-22 17:45:57,421 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 17:45:57,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2022-07-22 17:45:57,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af1b81b8/7641d87ad6c741acbcf323b7beac7218/FLAG5f3740a63 [2022-07-22 17:45:57,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af1b81b8/7641d87ad6c741acbcf323b7beac7218 [2022-07-22 17:45:57,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 17:45:57,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 17:45:57,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 17:45:57,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 17:45:57,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 17:45:57,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:45:57" (1/1) ... [2022-07-22 17:45:57,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d4dfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:57, skipping insertion in model container [2022-07-22 17:45:57,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:45:57" (1/1) ... [2022-07-22 17:45:57,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 17:45:57,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 17:45:57,994 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_i20_o20-2.c[454,467] [2022-07-22 17:45:57,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:45:58,016 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 17:45:58,024 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_i20_o20-2.c[454,467] [2022-07-22 17:45:58,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:45:58,038 INFO L208 MainTranslator]: Completed translation [2022-07-22 17:45:58,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58 WrapperNode [2022-07-22 17:45:58,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 17:45:58,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 17:45:58,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 17:45:58,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 17:45:58,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,083 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-07-22 17:45:58,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 17:45:58,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 17:45:58,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 17:45:58,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 17:45:58,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 17:45:58,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 17:45:58,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 17:45:58,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 17:45:58,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (1/1) ... [2022-07-22 17:45:58,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:45:58,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:58,153 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-22 17:45:58,155 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-22 17:45:58,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 17:45:58,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 17:45:58,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 17:45:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 17:45:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-07-22 17:45:58,206 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-07-22 17:45:58,250 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 17:45:58,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 17:45:58,353 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 17:45:58,371 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 17:45:58,372 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 17:45:58,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:45:58 BoogieIcfgContainer [2022-07-22 17:45:58,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 17:45:58,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 17:45:58,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 17:45:58,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 17:45:58,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:45:57" (1/3) ... [2022-07-22 17:45:58,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a7251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:45:58, skipping insertion in model container [2022-07-22 17:45:58,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:45:58" (2/3) ... [2022-07-22 17:45:58,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a7251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:45:58, skipping insertion in model container [2022-07-22 17:45:58,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:45:58" (3/3) ... [2022-07-22 17:45:58,390 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2022-07-22 17:45:58,399 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 17:45:58,399 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 17:45:58,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 17:45:58,487 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@1398b09, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@336cc468 [2022-07-22 17:45:58,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 17:45:58,491 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-22 17:45:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 17:45:58,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:58,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:58,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-22 17:45:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:58,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653580718] [2022-07-22 17:45:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:58,748 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-22 17:45:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:58,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653580718] [2022-07-22 17:45:58,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653580718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:45:58,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:45:58,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 17:45:58,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155871919] [2022-07-22 17:45:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:45:58,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:45:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:58,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:45:58,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:45:58,772 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-22 17:45:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:58,797 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-22 17:45:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 17:45:58,799 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-22 17:45:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:58,803 INFO L225 Difference]: With dead ends: 28 [2022-07-22 17:45:58,803 INFO L226 Difference]: Without dead ends: 15 [2022-07-22 17:45:58,805 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-22 17:45:58,807 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-22 17:45:58,808 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-22 17:45:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-22 17:45:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-22 17:45:58,829 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-22 17:45:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-22 17:45:58,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-22 17:45:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:58,831 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-22 17:45:58,831 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-22 17:45:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-22 17:45:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 17:45:58,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:58,832 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:58,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 17:45:58,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-22 17:45:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:58,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643586103] [2022-07-22 17:45:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:58,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:58,900 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-22 17:45:58,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:58,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643586103] [2022-07-22 17:45:58,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643586103] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:58,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161519461] [2022-07-22 17:45:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:58,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:58,903 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-22 17:45:58,905 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-22 17:45:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:58,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:45:58,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:58,995 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-22 17:45:58,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:59,158 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-22 17:45:59,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161519461] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:59,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:59,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-07-22 17:45:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249035910] [2022-07-22 17:45:59,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:59,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 17:45:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 17:45:59,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:45:59,162 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-22 17:45:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:59,192 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-07-22 17:45:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:45:59,192 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-22 17:45:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:59,193 INFO L225 Difference]: With dead ends: 22 [2022-07-22 17:45:59,193 INFO L226 Difference]: Without dead ends: 18 [2022-07-22 17:45:59,193 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-22 17:45:59,194 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-22 17:45:59,195 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-22 17:45:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-22 17:45:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-22 17:45:59,198 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-22 17:45:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-07-22 17:45:59,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-07-22 17:45:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:59,199 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-22 17:45:59,199 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-22 17:45:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-07-22 17:45:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 17:45:59,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:59,200 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:59,222 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-22 17:45:59,418 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-22 17:45:59,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:45:59,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:45:59,419 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-07-22 17:45:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:45:59,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493383904] [2022-07-22 17:45:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:45:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:45:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:59,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:45:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:45:59,496 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-22 17:45:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:45:59,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493383904] [2022-07-22 17:45:59,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493383904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:45:59,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709290926] [2022-07-22 17:45:59,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:45:59,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:45:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:45:59,498 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-22 17:45:59,500 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-22 17:45:59,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:45:59,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:45:59,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 17:45:59,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:45:59,574 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-22 17:45:59,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:45:59,760 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-22 17:45:59,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709290926] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:45:59,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:45:59,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2022-07-22 17:45:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009521790] [2022-07-22 17:45:59,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:45:59,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 17:45:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:45:59,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 17:45:59,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:45:59,763 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-22 17:45:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:45:59,803 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-22 17:45:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:45:59,804 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-22 17:45:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:45:59,805 INFO L225 Difference]: With dead ends: 25 [2022-07-22 17:45:59,805 INFO L226 Difference]: Without dead ends: 21 [2022-07-22 17:45:59,805 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-22 17:45:59,806 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-22 17:45:59,807 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-22 17:45:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-22 17:45:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-22 17:45:59,810 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-22 17:45:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-22 17:45:59,811 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-07-22 17:45:59,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:45:59,811 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-22 17:45:59,811 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-22 17:45:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-22 17:45:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 17:45:59,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:45:59,812 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:45:59,829 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-22 17:46:00,029 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-22 17:46:00,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:46:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:46:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-07-22 17:46:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:46:00,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668036977] [2022-07-22 17:46:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:46:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:46:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:00,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:00,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:00,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:00,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:00,132 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-22 17:46:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:46:00,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668036977] [2022-07-22 17:46:00,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668036977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:46:00,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510469518] [2022-07-22 17:46:00,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 17:46:00,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:46:00,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:46:00,152 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-22 17:46:00,190 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-22 17:46:00,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 17:46:00,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:46:00,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 17:46:00,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:46:00,271 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-22 17:46:00,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:46:00,570 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-22 17:46:00,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510469518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:46:00,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:46:00,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-07-22 17:46:00,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987529113] [2022-07-22 17:46:00,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:46:00,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 17:46:00,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:46:00,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 17:46:00,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-07-22 17:46:00,572 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-22 17:46:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:46:00,781 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-07-22 17:46:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 17:46:00,782 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-22 17:46:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:46:00,783 INFO L225 Difference]: With dead ends: 39 [2022-07-22 17:46:00,783 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 17:46:00,784 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-22 17:46:00,785 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-22 17:46:00,785 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-22 17:46:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 17:46:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-22 17:46:00,789 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-22 17:46:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-22 17:46:00,790 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-07-22 17:46:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:46:00,790 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-22 17:46:00,790 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-22 17:46:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-22 17:46:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-22 17:46:00,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:46:00,791 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:46:00,808 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-22 17:46:01,008 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-22 17:46:01,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:46:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:46:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-07-22 17:46:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:46:01,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363593211] [2022-07-22 17:46:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:46:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:46:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:01,224 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-22 17:46:01,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:46:01,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363593211] [2022-07-22 17:46:01,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363593211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:46:01,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060659216] [2022-07-22 17:46:01,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 17:46:01,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:46:01,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:46:01,227 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-22 17:46:01,235 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-22 17:46:01,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 17:46:01,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:46:01,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 17:46:01,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:46:01,378 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-22 17:46:01,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:46:02,434 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-22 17:46:02,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060659216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:46:02,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:46:02,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2022-07-22 17:46:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234852845] [2022-07-22 17:46:02,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:46:02,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 17:46:02,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:46:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 17:46:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-07-22 17:46:02,436 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-22 17:46:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:46:02,521 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-07-22 17:46:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 17:46:02,522 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-22 17:46:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:46:02,522 INFO L225 Difference]: With dead ends: 40 [2022-07-22 17:46:02,523 INFO L226 Difference]: Without dead ends: 36 [2022-07-22 17:46:02,523 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-22 17:46:02,524 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-22 17:46:02,524 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-22 17:46:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-22 17:46:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-22 17:46:02,528 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-22 17:46:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-22 17:46:02,528 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-07-22 17:46:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:46:02,529 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-22 17:46:02,529 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-22 17:46:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-22 17:46:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 17:46:02,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:46:02,530 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:46:02,548 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-22 17:46:02,731 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-22 17:46:02,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:46:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:46:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2022-07-22 17:46:02,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:46:02,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224068441] [2022-07-22 17:46:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:46:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:46:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:02,942 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-22 17:46:02,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:46:02,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224068441] [2022-07-22 17:46:02,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224068441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:46:02,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841131356] [2022-07-22 17:46:02,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 17:46:02,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:46:02,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:46:02,944 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-22 17:46:02,962 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-22 17:46:03,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-22 17:46:03,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:46:03,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-22 17:46:03,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:46:03,318 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-22 17:46:03,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:46:05,125 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-22 17:46:05,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841131356] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:46:05,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:46:05,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2022-07-22 17:46:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487139017] [2022-07-22 17:46:05,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:46:05,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-22 17:46:05,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:46:05,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-22 17:46:05,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2022-07-22 17:46:05,127 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-22 17:46:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:46:05,665 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-22 17:46:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-22 17:46:05,666 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-22 17:46:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:46:05,667 INFO L225 Difference]: With dead ends: 69 [2022-07-22 17:46:05,667 INFO L226 Difference]: Without dead ends: 63 [2022-07-22 17:46:05,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2022-07-22 17:46:05,670 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-22 17:46:05,670 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-22 17:46:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-22 17:46:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-22 17:46:05,682 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-22 17:46:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-22 17:46:05,687 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-07-22 17:46:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:46:05,687 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-22 17:46:05,687 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-22 17:46:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-22 17:46:05,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 17:46:05,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:46:05,692 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:46:05,713 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-22 17:46:05,914 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-22 17:46:05,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:46:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:46:05,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 6 times [2022-07-22 17:46:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:46:05,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448587449] [2022-07-22 17:46:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:46:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:46:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:46:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:46:06,522 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-22 17:46:06,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:46:06,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448587449] [2022-07-22 17:46:06,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448587449] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:46:06,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165241471] [2022-07-22 17:46:06,522 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 17:46:06,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:46:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:46:06,540 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-22 17:46:06,541 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-22 17:46:06,680 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-22 17:46:06,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:46:06,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 17:46:06,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:46:07,345 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-22 17:46:07,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:46:17,344 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-22 17:46:17,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165241471] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:46:17,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:46:17,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39, 39] total 65 [2022-07-22 17:46:17,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493322008] [2022-07-22 17:46:17,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:46:17,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-22 17:46:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:46:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-22 17:46:17,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=3517, Unknown=0, NotChecked=0, Total=4160 [2022-07-22 17:46:17,363 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-22 17:46:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:46:17,895 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-22 17:46:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-22 17:46:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) Word has length 112 [2022-07-22 17:46:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:46:17,896 INFO L225 Difference]: With dead ends: 78 [2022-07-22 17:46:17,896 INFO L226 Difference]: Without dead ends: 72 [2022-07-22 17:46:17,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1853, Invalid=9277, Unknown=0, NotChecked=0, Total=11130 [2022-07-22 17:46:17,900 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:46:17,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 111 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:46:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-22 17:46:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-22 17:46:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 49 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-22 17:46:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-22 17:46:17,914 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 112 [2022-07-22 17:46:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:46:17,915 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-22 17:46:17,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.421875) internal successors, (91), 44 states have internal predecessors, (91), 3 states have call successors, (4), 1 states have call predecessors, (4), 38 states have return successors, (39), 39 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-22 17:46:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-22 17:46:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-22 17:46:17,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:46:17,918 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:46:17,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 17:46:18,119 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-22 17:46:18,119 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:46:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:46:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1807457588, now seen corresponding path program 7 times [2022-07-22 17:46:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:46:18,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890016738] [2022-07-22 17:46:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:46:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:46:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 17:46:18,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 17:46:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 17:46:18,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 17:46:18,212 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 17:46:18,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 17:46:18,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 17:46:18,216 INFO L356 BasicCegarLoop]: Path program histogram: [7, 1] [2022-07-22 17:46:18,219 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 17:46:18,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 05:46:18 BoogieIcfgContainer [2022-07-22 17:46:18,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 17:46:18,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 17:46:18,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 17:46:18,263 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 17:46:18,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:45:58" (3/4) ... [2022-07-22 17:46:18,265 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 17:46:18,306 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 17:46:18,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 17:46:18,307 INFO L158 Benchmark]: Toolchain (without parser) took 20449.39ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 85.4MB in the beginning and 196.5MB in the end (delta: -111.2MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2022-07-22 17:46:18,307 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:46:18,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.67ms. Allocated memory is still 117.4MB. Free memory was 85.1MB in the beginning and 94.0MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 17:46:18,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 92.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:46:18,308 INFO L158 Benchmark]: Boogie Preprocessor took 22.26ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 91.8MB in the end (delta: 867.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:46:18,308 INFO L158 Benchmark]: RCFGBuilder took 264.44ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 83.1MB in the end (delta: 8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 17:46:18,308 INFO L158 Benchmark]: TraceAbstraction took 19888.77ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 82.7MB in the beginning and 199.7MB in the end (delta: -117.0MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-07-22 17:46:18,308 INFO L158 Benchmark]: Witness Printer took 43.10ms. Allocated memory is still 249.6MB. Free memory was 199.7MB in the beginning and 196.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 17:46:18,310 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 83.9MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.67ms. Allocated memory is still 117.4MB. Free memory was 85.1MB in the beginning and 94.0MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 92.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.26ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 91.8MB in the end (delta: 867.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 264.44ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 83.1MB in the end (delta: 8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19888.77ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 82.7MB in the beginning and 199.7MB in the end (delta: -117.0MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 43.10ms. Allocated memory is still 249.6MB. Free memory was 199.7MB in the beginning and 196.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 = 20; VAL [input=20] [L13] CALL, EXPR id(input) 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; [L13] RET, EXPR id(input) VAL [id(input)=20, input=20] [L13] int result = id(input); [L14] COND TRUE result == 20 VAL [input=20, result=20] [L15] reach_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623 IncrementalHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 69 mSDtfsCounter, 623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 540 SyntacticMatches, 1 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4888 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=7, InterpolantAutomatonStates: 133, 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.3s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 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-22 17:46:18,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE