./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:44:09,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:44:09,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:44:09,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:44:09,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:44:09,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:44:09,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:44:09,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:44:09,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:44:09,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:44:09,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:44:09,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:44:09,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:44:09,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:44:09,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:44:09,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:44:09,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:44:09,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:44:09,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:44:09,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:44:09,683 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:44:09,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:44:09,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:44:09,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:44:09,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:44:09,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:44:09,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:44:09,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:44:09,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:44:09,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:44:09,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:44:09,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:44:09,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:44:09,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:44:09,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:44:09,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:44:09,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:44:09,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:44:09,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:44:09,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:44:09,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:44:09,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:44:09,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:44:09,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:44:09,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:44:09,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:44:09,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:44:09,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:44:09,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:44:09,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:44:09,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:44:09,728 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:44:09,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:44:09,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:44:09,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:44:09,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:44:09,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:44:09,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:44:09,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:44:09,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:44:09,730 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:44:09,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:44:09,730 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:44:09,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:44:09,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:44:09,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:44:09,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:44:09,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:44:09,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:44:09,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:44:09,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:44:09,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:44:09,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:44:09,732 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:44:09,732 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:44:09,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:44:09,732 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-07-19 14:44:09,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:44:09,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:44:09,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:44:09,954 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:44:09,955 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:44:09,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-07-19 14:44:10,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dea3af2f/82336bbc00da4808adde1168e32e5740/FLAG87035c401 [2022-07-19 14:44:10,381 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:44:10,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-07-19 14:44:10,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dea3af2f/82336bbc00da4808adde1168e32e5740/FLAG87035c401 [2022-07-19 14:44:10,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dea3af2f/82336bbc00da4808adde1168e32e5740 [2022-07-19 14:44:10,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:44:10,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:44:10,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:44:10,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:44:10,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:44:10,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:44:10" (1/1) ... [2022-07-19 14:44:10,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7b7eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:10, skipping insertion in model container [2022-07-19 14:44:10,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:44:10" (1/1) ... [2022-07-19 14:44:10,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:44:10,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:44:11,049 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/list-simple/sll2n_insert_equal.i[24301,24314] [2022-07-19 14:44:11,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:44:11,055 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:44:11,081 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/list-simple/sll2n_insert_equal.i[24301,24314] [2022-07-19 14:44:11,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:44:11,100 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:44:11,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11 WrapperNode [2022-07-19 14:44:11,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:44:11,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:44:11,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:44:11,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:44:11,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,149 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-07-19 14:44:11,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:44:11,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:44:11,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:44:11,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:44:11,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:44:11,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:44:11,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:44:11,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:44:11,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (1/1) ... [2022-07-19 14:44:11,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:44:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:11,221 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-19 14:44:11,228 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-19 14:44:11,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:44:11,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:44:11,280 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:44:11,280 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:44:11,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:44:11,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:44:11,413 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:44:11,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:44:11,651 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:44:11,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:44:11,656 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 14:44:11,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:44:11 BoogieIcfgContainer [2022-07-19 14:44:11,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:44:11,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:44:11,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:44:11,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:44:11,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:44:10" (1/3) ... [2022-07-19 14:44:11,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7207ffd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:44:11, skipping insertion in model container [2022-07-19 14:44:11,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:11" (2/3) ... [2022-07-19 14:44:11,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7207ffd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:44:11, skipping insertion in model container [2022-07-19 14:44:11,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:44:11" (3/3) ... [2022-07-19 14:44:11,670 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-07-19 14:44:11,680 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:44:11,681 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:44:11,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:44:11,727 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@44d8e405, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e614635 [2022-07-19 14:44:11,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:44:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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-19 14:44:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:44:11,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:11,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:11,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-07-19 14:44:11,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:11,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35294135] [2022-07-19 14:44:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 14:44:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:11,921 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-19 14:44:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:11,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35294135] [2022-07-19 14:44:11,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35294135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:11,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:11,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:44:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933579349] [2022-07-19 14:44:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:11,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:44:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:11,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:44:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:44:11,952 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-19 14:44:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:12,023 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-07-19 14:44:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:44:12,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 19 [2022-07-19 14:44:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:12,029 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:44:12,029 INFO L226 Difference]: Without dead ends: 24 [2022-07-19 14:44:12,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:44:12,034 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:12,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-19 14:44:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-19 14:44:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-19 14:44:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-07-19 14:44:12,057 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-07-19 14:44:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:12,057 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-19 14:44:12,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-19 14:44:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-07-19 14:44:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:44:12,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:12,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:12,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:44:12,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-07-19 14:44:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:12,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710620589] [2022-07-19 14:44:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 14:44:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,162 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-19 14:44:12,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:12,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710620589] [2022-07-19 14:44:12,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710620589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:12,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:12,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:44:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584138718] [2022-07-19 14:44:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:12,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:44:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:44:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:12,183 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-19 14:44:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:12,224 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-19 14:44:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:44:12,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-07-19 14:44:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:12,226 INFO L225 Difference]: With dead ends: 46 [2022-07-19 14:44:12,226 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:44:12,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:12,233 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:12,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:44:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-07-19 14:44:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-19 14:44:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-19 14:44:12,242 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-07-19 14:44:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:12,243 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-19 14:44:12,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-19 14:44:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-07-19 14:44:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:44:12,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:12,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:12,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:44:12,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:12,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:12,245 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-07-19 14:44:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:12,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067171885] [2022-07-19 14:44:12,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 14:44:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:12,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067171885] [2022-07-19 14:44:12,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067171885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:12,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503189134] [2022-07-19 14:44:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:12,325 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-19 14:44:12,326 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-19 14:44:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:44:12,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:12,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:12,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503189134] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:44:12,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:44:12,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-19 14:44:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760274704] [2022-07-19 14:44:12,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:12,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:44:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:12,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:44:12,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:12,532 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:44:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:12,575 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-19 14:44:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:44:12,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-19 14:44:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:12,576 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:44:12,576 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:44:12,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:12,579 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:12,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:44:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-19 14:44:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-19 14:44:12,589 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2022-07-19 14:44:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:12,590 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-19 14:44:12,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:44:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-19 14:44:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:44:12,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:12,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:12,611 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-19 14:44:12,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:12,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:12,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:12,809 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2022-07-19 14:44:12,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:12,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938061859] [2022-07-19 14:44:12,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:12,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:44:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:44:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 14:44:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:12,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938061859] [2022-07-19 14:44:12,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938061859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:12,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:12,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:44:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689357422] [2022-07-19 14:44:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:12,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:44:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:12,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:44:12,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:12,899 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:44:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:12,923 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-07-19 14:44:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:44:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-07-19 14:44:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:12,924 INFO L225 Difference]: With dead ends: 45 [2022-07-19 14:44:12,924 INFO L226 Difference]: Without dead ends: 38 [2022-07-19 14:44:12,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:12,925 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:12,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-19 14:44:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-07-19 14:44:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-19 14:44:12,929 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2022-07-19 14:44:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:12,929 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-19 14:44:12,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:44:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-07-19 14:44:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:44:12,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:12,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:12,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:44:12,931 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 1 times [2022-07-19 14:44:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:12,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053162050] [2022-07-19 14:44:12,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:13,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:44:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:13,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:44:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 14:44:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:13,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053162050] [2022-07-19 14:44:13,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053162050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:13,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:13,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:44:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252997988] [2022-07-19 14:44:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:13,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:44:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:44:13,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:44:13,020 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 14:44:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:13,047 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-19 14:44:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:44:13,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 37 [2022-07-19 14:44:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:13,049 INFO L225 Difference]: With dead ends: 38 [2022-07-19 14:44:13,049 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 14:44:13,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:44:13,050 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:13,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 64 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 14:44:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-19 14:44:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-19 14:44:13,055 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2022-07-19 14:44:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:13,055 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-19 14:44:13,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 14:44:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-19 14:44:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:44:13,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:13,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:13,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 14:44:13,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:13,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-07-19 14:44:13,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:13,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746543035] [2022-07-19 14:44:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:13,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:13,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:44:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:44:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746543035] [2022-07-19 14:44:13,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746543035] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:13,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011862923] [2022-07-19 14:44:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:13,377 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-19 14:44:13,404 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-19 14:44:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:13,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 14:44:13,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:13,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-19 14:44:13,712 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_545 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_545)))) is different from true [2022-07-19 14:44:13,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:13,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-19 14:44:13,869 INFO L356 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2022-07-19 14:44:13,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2022-07-19 14:44:16,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:16,242 INFO L356 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2022-07-19 14:44:16,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 107 [2022-07-19 14:44:16,248 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:44:16,267 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-19 14:44:16,467 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,SelfDestructingSolverStorable5 [2022-07-19 14:44:16,467 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 14:44:16,471 INFO L158 Benchmark]: Toolchain (without parser) took 5702.38ms. Allocated memory was 113.2MB in the beginning and 176.2MB in the end (delta: 62.9MB). Free memory was 83.9MB in the beginning and 113.1MB in the end (delta: -29.1MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2022-07-19 14:44:16,472 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 70.4MB in the beginning and 70.3MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:44:16,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.20ms. Allocated memory was 113.2MB in the beginning and 146.8MB in the end (delta: 33.6MB). Free memory was 83.6MB in the beginning and 113.5MB in the end (delta: -29.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-07-19 14:44:16,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 146.8MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:16,472 INFO L158 Benchmark]: Boogie Preprocessor took 37.20ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 109.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:16,472 INFO L158 Benchmark]: RCFGBuilder took 474.73ms. Allocated memory is still 146.8MB. Free memory was 109.7MB in the beginning and 95.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 14:44:16,473 INFO L158 Benchmark]: TraceAbstraction took 4806.22ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 95.1MB in the beginning and 113.1MB in the end (delta: -18.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-07-19 14:44:16,474 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.17ms. Allocated memory is still 113.2MB. Free memory was 70.4MB in the beginning and 70.3MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.20ms. Allocated memory was 113.2MB in the beginning and 146.8MB in the end (delta: 33.6MB). Free memory was 83.6MB in the beginning and 113.5MB in the end (delta: -29.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 146.8MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.20ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 109.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 474.73ms. Allocated memory is still 146.8MB. Free memory was 109.7MB in the beginning and 95.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4806.22ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 95.1MB in the beginning and 113.1MB in the end (delta: -18.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:44:16,490 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:44:18,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:44:18,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:44:18,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:44:18,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:44:18,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:44:18,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:44:18,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:44:18,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:44:18,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:44:18,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:44:18,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:44:18,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:44:18,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:44:18,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:44:18,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:44:18,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:44:18,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:44:18,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:44:18,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:44:18,307 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:44:18,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:44:18,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:44:18,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:44:18,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:44:18,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:44:18,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:44:18,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:44:18,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:44:18,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:44:18,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:44:18,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:44:18,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:44:18,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:44:18,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:44:18,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:44:18,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:44:18,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:44:18,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:44:18,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:44:18,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:44:18,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:44:18,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:44:18,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:44:18,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:44:18,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:44:18,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:44:18,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:44:18,363 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:44:18,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:44:18,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:44:18,364 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:44:18,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:44:18,365 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:44:18,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:44:18,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:44:18,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:44:18,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:44:18,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:44:18,366 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:44:18,366 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:44:18,366 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:44:18,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:44:18,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:44:18,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:44:18,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:44:18,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:44:18,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:44:18,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:44:18,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:44:18,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:44:18,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:44:18,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:44:18,368 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:44:18,369 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:44:18,369 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:44:18,369 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:44:18,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:44:18,369 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:44:18,369 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-07-19 14:44:18,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:44:18,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:44:18,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:44:18,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:44:18,670 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:44:18,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-07-19 14:44:18,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4ba79d5/dee3d94137b54d47b51f12de2f983b38/FLAG412c62ca1 [2022-07-19 14:44:19,088 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:44:19,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-07-19 14:44:19,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4ba79d5/dee3d94137b54d47b51f12de2f983b38/FLAG412c62ca1 [2022-07-19 14:44:19,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4ba79d5/dee3d94137b54d47b51f12de2f983b38 [2022-07-19 14:44:19,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:44:19,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:44:19,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:44:19,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:44:19,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:44:19,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180e7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19, skipping insertion in model container [2022-07-19 14:44:19,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:44:19,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:44:19,747 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/list-simple/sll2n_insert_equal.i[24301,24314] [2022-07-19 14:44:19,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:44:19,762 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:44:19,802 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/list-simple/sll2n_insert_equal.i[24301,24314] [2022-07-19 14:44:19,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:44:19,831 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:44:19,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19 WrapperNode [2022-07-19 14:44:19,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:44:19,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:44:19,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:44:19,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:44:19,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,888 INFO L137 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2022-07-19 14:44:19,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:44:19,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:44:19,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:44:19,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:44:19,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:44:19,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:44:19,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:44:19,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:44:19,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (1/1) ... [2022-07-19 14:44:19,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:44:19,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:19,989 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-19 14:44:20,005 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-19 14:44:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:44:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:44:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:44:20,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:44:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:44:20,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:44:20,103 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:44:20,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:44:20,283 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:44:20,289 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:44:20,290 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 14:44:20,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:44:20 BoogieIcfgContainer [2022-07-19 14:44:20,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:44:20,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:44:20,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:44:20,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:44:20,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:44:19" (1/3) ... [2022-07-19 14:44:20,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd6f236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:44:20, skipping insertion in model container [2022-07-19 14:44:20,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:19" (2/3) ... [2022-07-19 14:44:20,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd6f236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:44:20, skipping insertion in model container [2022-07-19 14:44:20,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:44:20" (3/3) ... [2022-07-19 14:44:20,299 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-07-19 14:44:20,308 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:44:20,309 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:44:20,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:44:20,365 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@3caf077, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b796bfe [2022-07-19 14:44:20,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:44:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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-19 14:44:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:44:20,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:20,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:20,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-07-19 14:44:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:20,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768253594] [2022-07-19 14:44:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:20,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:20,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:20,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:20,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 14:44:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:20,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:44:20,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:20,593 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-19 14:44:20,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:44:20,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:20,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768253594] [2022-07-19 14:44:20,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768253594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:20,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:20,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:44:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609897373] [2022-07-19 14:44:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:20,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:44:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:44:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:44:20,617 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-19 14:44:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:20,629 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-07-19 14:44:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:44:20,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 19 [2022-07-19 14:44:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:20,634 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:44:20,634 INFO L226 Difference]: Without dead ends: 24 [2022-07-19 14:44:20,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:44:20,638 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:20,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-19 14:44:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-19 14:44:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-19 14:44:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-07-19 14:44:20,661 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-07-19 14:44:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:20,662 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-19 14:44:20,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-19 14:44:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-07-19 14:44:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:44:20,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:20,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:20,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 14:44:20,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:20,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-07-19 14:44:20,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:20,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275960281] [2022-07-19 14:44:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:20,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:20,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:20,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:20,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 14:44:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:20,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:44:20,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:20,972 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-19 14:44:20,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:44:20,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:20,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275960281] [2022-07-19 14:44:20,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275960281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:20,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:20,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:44:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272405424] [2022-07-19 14:44:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:20,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:44:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:20,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:44:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:44:20,975 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-19 14:44:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:20,984 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-19 14:44:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:44:20,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-07-19 14:44:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:20,985 INFO L225 Difference]: With dead ends: 46 [2022-07-19 14:44:20,985 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:44:20,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:44:20,986 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:20,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:44:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-07-19 14:44:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-19 14:44:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-19 14:44:20,991 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-07-19 14:44:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:20,992 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-19 14:44:20,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-19 14:44:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-07-19 14:44:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:44:20,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:20,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:21,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-19 14:44:21,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:21,201 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-07-19 14:44:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:21,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782537000] [2022-07-19 14:44:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:21,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:21,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:21,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 14:44:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:21,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:44:21,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:21,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:21,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:21,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782537000] [2022-07-19 14:44:21,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782537000] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:44:21,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:21,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 14:44:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785203216] [2022-07-19 14:44:21,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:21,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:44:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:21,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:44:21,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:21,353 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:44:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:21,378 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-07-19 14:44:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:44:21,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-19 14:44:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:21,379 INFO L225 Difference]: With dead ends: 50 [2022-07-19 14:44:21,379 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 14:44:21,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:21,380 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:21,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 105 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 14:44:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-19 14:44:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-19 14:44:21,385 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2022-07-19 14:44:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:21,385 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-19 14:44:21,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:44:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-19 14:44:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:44:21,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:21,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:21,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:21,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:21,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:21,597 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2022-07-19 14:44:21,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:21,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142351104] [2022-07-19 14:44:21,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:44:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:21,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:21,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:21,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 14:44:21,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 14:44:21,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:44:21,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:44:21,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 14:44:21,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:44:21,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:21,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142351104] [2022-07-19 14:44:21,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142351104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:21,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:21,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:44:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626159529] [2022-07-19 14:44:21,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:21,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:44:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:44:21,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:21,779 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 14:44:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:21,808 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-07-19 14:44:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:44:21,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 37 [2022-07-19 14:44:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:21,809 INFO L225 Difference]: With dead ends: 38 [2022-07-19 14:44:21,809 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 14:44:21,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:44:21,810 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:21,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 14:44:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-19 14:44:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-19 14:44:21,818 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2022-07-19 14:44:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:21,819 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-19 14:44:21,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 14:44:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-19 14:44:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:44:21,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:21,820 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:21,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-19 14:44:22,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:22,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:22,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-07-19 14:44:22,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:22,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933498998] [2022-07-19 14:44:22,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:22,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:22,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:22,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:22,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:44:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:22,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 14:44:22,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:22,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-19 14:44:22,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:22,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-19 14:44:22,921 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:22,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-19 14:44:22,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:22,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-19 14:44:23,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-19 14:44:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:44:23,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:23,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-19 14:44:23,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-19 14:44:23,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-19 14:44:23,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_ArrVal_222) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-19 14:44:23,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933498998] [2022-07-19 14:44:23,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933498998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:23,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [308268216] [2022-07-19 14:44:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:23,388 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:44:23,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:44:23,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:44:23,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-19 14:44:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:23,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 14:44:23,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:24,097 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-19 14:44:24,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2022-07-19 14:44:24,114 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:44:24,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2022-07-19 14:44:24,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-19 14:44:24,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:24,395 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-19 14:44:24,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 80 [2022-07-19 14:44:24,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:24,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2022-07-19 14:44:24,408 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:44:24,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:24,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:24,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:24,810 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 14:44:24,813 INFO L158 Benchmark]: Toolchain (without parser) took 5365.16ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 41.4MB in the beginning and 66.7MB in the end (delta: -25.3MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2022-07-19 14:44:24,813 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:44:24,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.25ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 37.7MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 14:44:24,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.87ms. Allocated memory is still 62.9MB. Free memory was 37.7MB in the beginning and 35.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:24,814 INFO L158 Benchmark]: Boogie Preprocessor took 47.58ms. Allocated memory is still 62.9MB. Free memory was 35.5MB in the beginning and 33.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:24,814 INFO L158 Benchmark]: RCFGBuilder took 354.51ms. Allocated memory is still 62.9MB. Free memory was 33.5MB in the beginning and 37.6MB in the end (delta: -4.1MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-07-19 14:44:24,815 INFO L158 Benchmark]: TraceAbstraction took 4519.82ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 37.1MB in the beginning and 66.7MB in the end (delta: -29.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2022-07-19 14:44:24,816 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.15ms. Allocated memory is still 62.9MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.25ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 37.7MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.87ms. Allocated memory is still 62.9MB. Free memory was 37.7MB in the beginning and 35.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.58ms. Allocated memory is still 62.9MB. Free memory was 35.5MB in the beginning and 33.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.51ms. Allocated memory is still 62.9MB. Free memory was 33.5MB in the beginning and 37.6MB in the end (delta: -4.1MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4519.82ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 37.1MB in the beginning and 66.7MB in the end (delta: -29.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:44:24,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER