./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_add-2.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/ldv-sets/test_add-2.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 b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:35:22,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:35:22,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:35:22,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:35:22,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:35:22,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:35:22,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:35:22,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:35:22,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:35:22,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:35:22,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:35:22,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:35:22,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:35:22,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:35:22,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:35:22,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:35:22,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:35:22,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:35:22,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:35:22,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:35:22,704 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:35:22,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:35:22,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:35:22,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:35:22,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:35:22,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:35:22,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:35:22,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:35:22,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:35:22,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:35:22,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:35:22,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:35:22,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:35:22,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:35:22,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:35:22,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:35:22,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:35:22,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:35:22,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:35:22,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:35:22,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:35:22,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:35:22,722 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:35:22,742 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:35:22,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:35:22,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:35:22,743 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:35:22,743 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:35:22,743 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:35:22,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:35:22,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:35:22,744 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:35:22,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:35:22,745 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:35:22,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:35:22,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:35:22,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:35:22,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:35:22,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:35:22,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:35:22,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:35:22,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:35:22,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:35:22,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:35:22,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:35:22,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:35:22,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:35:22,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:35:22,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:35:22,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:35:22,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:35:22,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:35:22,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:35:22,754 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:35:22,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:35:22,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:35:22,755 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 -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2022-07-19 14:35:22,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:35:23,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:35:23,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:35:23,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:35:23,005 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:35:23,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-19 14:35:23,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60191c5c5/461f7ffae24a4ba18556dc72d9c88f22/FLAG94f1992aa [2022-07-19 14:35:23,533 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:35:23,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-19 14:35:23,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60191c5c5/461f7ffae24a4ba18556dc72d9c88f22/FLAG94f1992aa [2022-07-19 14:35:23,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60191c5c5/461f7ffae24a4ba18556dc72d9c88f22 [2022-07-19 14:35:23,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:35:23,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:35:23,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:35:23,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:35:23,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:35:23,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:35:23" (1/1) ... [2022-07-19 14:35:23,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69986c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:23, skipping insertion in model container [2022-07-19 14:35:23,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:35:23" (1/1) ... [2022-07-19 14:35:23,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:35:23,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:35:23,942 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/ldv-sets/test_add-2.i[25793,25806] [2022-07-19 14:35:23,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:35:23,956 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:35:24,029 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/ldv-sets/test_add-2.i[25793,25806] [2022-07-19 14:35:24,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:35:24,060 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:35:24,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24 WrapperNode [2022-07-19 14:35:24,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:35:24,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:35:24,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:35:24,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:35:24,068 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:35:24" (1/1) ... [2022-07-19 14:35:24,082 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:35:24" (1/1) ... [2022-07-19 14:35:24,105 INFO L137 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 55 [2022-07-19 14:35:24,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:35:24,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:35:24,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:35:24,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:35:24,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (1/1) ... [2022-07-19 14:35:24,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (1/1) ... [2022-07-19 14:35:24,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (1/1) ... [2022-07-19 14:35:24,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (1/1) ... [2022-07-19 14:35:24,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (1/1) ... [2022-07-19 14:35:24,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (1/1) ... [2022-07-19 14:35:24,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (1/1) ... [2022-07-19 14:35:24,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:35:24,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:35:24,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:35:24,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:35:24,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (1/1) ... [2022-07-19 14:35:24,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:35:24,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:35:24,174 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:35:24,180 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:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:35:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-19 14:35:24,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-19 14:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:35:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-19 14:35:24,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-19 14:35:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:35:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:35:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:35:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:35:24,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:35:24,293 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:35:24,294 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:35:24,489 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:35:24,507 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:35:24,508 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 14:35:24,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:35:24 BoogieIcfgContainer [2022-07-19 14:35:24,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:35:24,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:35:24,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:35:24,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:35:24,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:35:23" (1/3) ... [2022-07-19 14:35:24,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d5f1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:35:24, skipping insertion in model container [2022-07-19 14:35:24,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:24" (2/3) ... [2022-07-19 14:35:24,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d5f1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:35:24, skipping insertion in model container [2022-07-19 14:35:24,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:35:24" (3/3) ... [2022-07-19 14:35:24,526 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2022-07-19 14:35:24,537 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:35:24,537 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:35:24,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:35:24,589 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@6c949de2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38f4da06 [2022-07-19 14:35:24,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:35:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:35:24,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:24,600 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:35:24,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:24,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1019691704, now seen corresponding path program 1 times [2022-07-19 14:35:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:35:24,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023191292] [2022-07-19 14:35:24,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:24,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:35:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:35:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 14:35:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:35:24,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:35:24,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023191292] [2022-07-19 14:35:24,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023191292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:24,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:35:24,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:35:24,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359407960] [2022-07-19 14:35:24,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:24,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:35:24,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:35:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:35:24,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:35:24,885 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:24,908 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-07-19 14:35:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:35:24,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-19 14:35:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:24,915 INFO L225 Difference]: With dead ends: 59 [2022-07-19 14:35:24,916 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 14:35:24,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:35:24,922 INFO L413 NwaCegarLoop]: 34 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, 34 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:35:24,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:35:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 14:35:24,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-19 14:35:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-19 14:35:24,968 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2022-07-19 14:35:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:24,969 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-19 14:35:24,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-19 14:35:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:35:24,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:24,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:35:24,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:35:24,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1544963960, now seen corresponding path program 1 times [2022-07-19 14:35:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:35:24,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24046393] [2022-07-19 14:35:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:35:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:25,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:35:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 14:35:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:35:25,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:35:25,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24046393] [2022-07-19 14:35:25,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24046393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:35:25,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290448545] [2022-07-19 14:35:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:25,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:35:25,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:35:25,094 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:35:25,095 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:35:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:25,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:35:25,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:35:25,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:35:25,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290448545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:25,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:35:25,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-19 14:35:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333092940] [2022-07-19 14:35:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:25,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:35:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:35:25,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:35:25,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:35:25,218 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:25,236 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-19 14:35:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:35:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-19 14:35:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:25,239 INFO L225 Difference]: With dead ends: 44 [2022-07-19 14:35:25,239 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:35:25,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 2 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:35:25,241 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:35:25,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:35:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:35:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-19 14:35:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 14:35:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-07-19 14:35:25,248 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2022-07-19 14:35:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:25,249 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-19 14:35:25,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-07-19 14:35:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:35:25,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:25,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:35:25,289 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:35:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:35:25,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1439032465, now seen corresponding path program 1 times [2022-07-19 14:35:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:35:25,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106979168] [2022-07-19 14:35:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:35:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:35:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 14:35:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:35:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:35:25,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106979168] [2022-07-19 14:35:25,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106979168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:35:25,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910137399] [2022-07-19 14:35:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:25,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:35:25,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:35:25,711 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:35:25,713 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:35:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:25,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 14:35:25,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:35:25,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:35:25,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910137399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:25,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:35:25,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-07-19 14:35:25,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582569067] [2022-07-19 14:35:25,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:25,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:35:25,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:35:25,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:35:25,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:35:25,972 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:26,176 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-07-19 14:35:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:35:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-19 14:35:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:26,179 INFO L225 Difference]: With dead ends: 74 [2022-07-19 14:35:26,179 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 14:35:26,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-19 14:35:26,181 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:35:26,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:35:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 14:35:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-19 14:35:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-19 14:35:26,193 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 20 [2022-07-19 14:35:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:26,193 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-19 14:35:26,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-19 14:35:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:35:26,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:26,194 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, 1] [2022-07-19 14:35:26,213 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:35:26,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-19 14:35:26,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1950106983, now seen corresponding path program 1 times [2022-07-19 14:35:26,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:35:26,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870364676] [2022-07-19 14:35:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:35:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:35:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:26,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 14:35:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:35:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:35:26,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:35:26,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870364676] [2022-07-19 14:35:26,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870364676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:26,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:35:26,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 14:35:26,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056875926] [2022-07-19 14:35:26,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:26,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:35:26,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:35:26,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:35:26,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 14:35:26,654 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:27,031 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-07-19 14:35:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 14:35:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-07-19 14:35:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:27,033 INFO L225 Difference]: With dead ends: 44 [2022-07-19 14:35:27,034 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 14:35:27,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-07-19 14:35:27,037 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 97 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:35:27,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 66 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:35:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 14:35:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-19 14:35:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-19 14:35:27,048 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2022-07-19 14:35:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:27,049 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-19 14:35:27,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-19 14:35:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:35:27,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:27,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:35:27,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:35:27,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash -375503678, now seen corresponding path program 1 times [2022-07-19 14:35:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:35:27,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386519856] [2022-07-19 14:35:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:35:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:35:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:27,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 14:35:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:35:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:35:27,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:35:27,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386519856] [2022-07-19 14:35:27,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386519856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:27,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:35:27,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:35:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056274259] [2022-07-19 14:35:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:27,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:35:27,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:35:27,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:35:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:35:27,165 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:35:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:27,233 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-07-19 14:35:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:35:27,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-19 14:35:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:27,235 INFO L225 Difference]: With dead ends: 39 [2022-07-19 14:35:27,235 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 14:35:27,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:35:27,237 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:35:27,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:35:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 14:35:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-19 14:35:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-07-19 14:35:27,254 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2022-07-19 14:35:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:27,254 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-07-19 14:35:27,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:35:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-07-19 14:35:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 14:35:27,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:27,256 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, 1, 1, 1, 1] [2022-07-19 14:35:27,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 14:35:27,257 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -714160700, now seen corresponding path program 1 times [2022-07-19 14:35:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:35:27,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695205648] [2022-07-19 14:35:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:35:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:35:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 14:35:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:35:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:35:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:35:27,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695205648] [2022-07-19 14:35:27,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695205648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:35:27,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674523444] [2022-07-19 14:35:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:27,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:35:27,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:35:27,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:35:27,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:35:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:28,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-19 14:35:28,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:28,434 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:35:28,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 14:35:28,598 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 14 treesize of output 16 [2022-07-19 14:35:28,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 14:35:28,615 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 14 treesize of output 16 [2022-07-19 14:35:28,674 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 7 treesize of output 3 [2022-07-19 14:35:28,702 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 7 treesize of output 3 [2022-07-19 14:35:28,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:28,917 INFO L356 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-07-19 14:35:28,918 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:35:28,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:35:29,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:35:29,140 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) 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:35:29,144 INFO L158 Benchmark]: Toolchain (without parser) took 5580.72ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 63.9MB in the beginning and 90.0MB in the end (delta: -26.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-07-19 14:35:29,144 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:35:29,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.07ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 63.3MB in the end (delta: 374.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:35:29,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.43ms. Allocated memory is still 96.5MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:35:29,145 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 96.5MB. Free memory was 61.2MB in the beginning and 59.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:35:29,145 INFO L158 Benchmark]: RCFGBuilder took 371.65ms. Allocated memory is still 96.5MB. Free memory was 59.8MB in the beginning and 46.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:35:29,145 INFO L158 Benchmark]: TraceAbstraction took 4632.81ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 46.6MB in the beginning and 90.0MB in the end (delta: -43.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-19 14:35:29,147 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.20ms. Allocated memory is still 96.5MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.07ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 63.3MB in the end (delta: 374.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.43ms. Allocated memory is still 96.5MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 96.5MB. Free memory was 61.2MB in the beginning and 59.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 371.65ms. Allocated memory is still 96.5MB. Free memory was 59.8MB in the beginning and 46.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4632.81ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 46.6MB in the beginning and 90.0MB in the end (delta: -43.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:35:29,169 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/ldv-sets/test_add-2.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 b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:35:31,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:35:31,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:35:31,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:35:31,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:35:31,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:35:31,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:35:31,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:35:31,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:35:31,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:35:31,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:35:31,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:35:31,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:35:31,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:35:31,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:35:31,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:35:31,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:35:31,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:35:31,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:35:31,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:35:31,101 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:35:31,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:35:31,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:35:31,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:35:31,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:35:31,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:35:31,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:35:31,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:35:31,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:35:31,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:35:31,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:35:31,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:35:31,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:35:31,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:35:31,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:35:31,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:35:31,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:35:31,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:35:31,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:35:31,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:35:31,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:35:31,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:35:31,127 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:35:31,173 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:35:31,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:35:31,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:35:31,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:35:31,175 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:35:31,175 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:35:31,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:35:31,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:35:31,176 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:35:31,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:35:31,177 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:35:31,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:35:31,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:35:31,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:35:31,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:35:31,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:35:31,178 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:35:31,179 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:35:31,179 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:35:31,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:35:31,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:35:31,179 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:35:31,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:35:31,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:35:31,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:35:31,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:35:31,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:35:31,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:35:31,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:35:31,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:35:31,181 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:35:31,181 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:35:31,182 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:35:31,182 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:35:31,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:35:31,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:35:31,183 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 -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2022-07-19 14:35:31,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:35:31,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:35:31,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:35:31,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:35:31,524 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:35:31,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-19 14:35:31,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d93cdcc5/c5fc5068c4bc45dbb28db5c4573198bc/FLAG9a62ce4d8 [2022-07-19 14:35:32,058 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:35:32,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-19 14:35:32,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d93cdcc5/c5fc5068c4bc45dbb28db5c4573198bc/FLAG9a62ce4d8 [2022-07-19 14:35:32,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d93cdcc5/c5fc5068c4bc45dbb28db5c4573198bc [2022-07-19 14:35:32,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:35:32,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:35:32,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:35:32,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:35:32,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:35:32,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:35:32" (1/1) ... [2022-07-19 14:35:32,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4a8f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:32, skipping insertion in model container [2022-07-19 14:35:32,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:35:32" (1/1) ... [2022-07-19 14:35:32,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:35:32,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:35:32,993 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/ldv-sets/test_add-2.i[25793,25806] [2022-07-19 14:35:32,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:35:33,012 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 14:35:33,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:35:33,055 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/ldv-sets/test_add-2.i[25793,25806] [2022-07-19 14:35:33,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:35:33,060 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:35:33,088 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/ldv-sets/test_add-2.i[25793,25806] [2022-07-19 14:35:33,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:35:33,125 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:35:33,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33 WrapperNode [2022-07-19 14:35:33,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:35:33,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:35:33,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:35:33,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:35:33,132 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:35:33" (1/1) ... [2022-07-19 14:35:33,150 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:35:33" (1/1) ... [2022-07-19 14:35:33,174 INFO L137 Inliner]: procedures = 138, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 53 [2022-07-19 14:35:33,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:35:33,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:35:33,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:35:33,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:35:33,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (1/1) ... [2022-07-19 14:35:33,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (1/1) ... [2022-07-19 14:35:33,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (1/1) ... [2022-07-19 14:35:33,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (1/1) ... [2022-07-19 14:35:33,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (1/1) ... [2022-07-19 14:35:33,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (1/1) ... [2022-07-19 14:35:33,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (1/1) ... [2022-07-19 14:35:33,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:35:33,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:35:33,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:35:33,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:35:33,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (1/1) ... [2022-07-19 14:35:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:35:33,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:35:33,245 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:35:33,269 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:35:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:35:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-19 14:35:33,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-19 14:35:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:35:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:35:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:35:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-19 14:35:33,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-19 14:35:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:35:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:35:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:35:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:35:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:35:33,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:35:33,369 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:35:33,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:35:33,603 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:35:33,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:35:33,609 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 14:35:33,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:35:33 BoogieIcfgContainer [2022-07-19 14:35:33,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:35:33,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:35:33,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:35:33,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:35:33,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:35:32" (1/3) ... [2022-07-19 14:35:33,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a9617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:35:33, skipping insertion in model container [2022-07-19 14:35:33,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:35:33" (2/3) ... [2022-07-19 14:35:33,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a9617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:35:33, skipping insertion in model container [2022-07-19 14:35:33,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:35:33" (3/3) ... [2022-07-19 14:35:33,622 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2022-07-19 14:35:33,635 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:35:33,635 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:35:33,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:35:33,688 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@57f9eb74, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46ec47d0 [2022-07-19 14:35:33,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:35:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:35:33,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:33,703 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:35:33,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash -313984218, now seen corresponding path program 1 times [2022-07-19 14:35:33,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:35:33,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175133007] [2022-07-19 14:35:33,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:35:33,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:35:33,735 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:35:33,776 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:35:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:33,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:35:33,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:35:33,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:35:33,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:35:33,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175133007] [2022-07-19 14:35:33,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175133007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:33,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:35:33,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:35:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085754278] [2022-07-19 14:35:33,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:33,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:35:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:35:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:35:33,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:35:33,928 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:33,949 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-07-19 14:35:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:35:33,951 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-19 14:35:33,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:33,956 INFO L225 Difference]: With dead ends: 55 [2022-07-19 14:35:33,956 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 14:35:33,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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:35:33,963 INFO L413 NwaCegarLoop]: 32 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, 32 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:35:33,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:35:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 14:35:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-19 14:35:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-19 14:35:34,001 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-07-19 14:35:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:34,001 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-19 14:35:34,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-19 14:35:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:35:34,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:34,004 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:35:34,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:35:34,224 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:35:34,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 160343226, now seen corresponding path program 1 times [2022-07-19 14:35:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:35:34,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112010465] [2022-07-19 14:35:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:35:34,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:35:34,228 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:35:34,230 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:35:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:34,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:35:34,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:35:34,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:35:34,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:35:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112010465] [2022-07-19 14:35:34,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112010465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:34,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:35:34,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:35:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135376910] [2022-07-19 14:35:34,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:34,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:35:34,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:35:34,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:35:34,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:35:34,333 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:34,352 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-19 14:35:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:35:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-19 14:35:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:34,354 INFO L225 Difference]: With dead ends: 40 [2022-07-19 14:35:34,354 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:35:34,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:35:34,356 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:35:34,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:35:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:35:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 14:35:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 14:35:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-19 14:35:34,363 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2022-07-19 14:35:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:34,363 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-19 14:35:34,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-19 14:35:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:35:34,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:34,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:35:34,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:35:34,575 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:35:34,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1203047025, now seen corresponding path program 1 times [2022-07-19 14:35:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:35:34,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058504123] [2022-07-19 14:35:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:34,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:35:34,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:35:34,579 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:35:34,581 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:35:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:34,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 14:35:34,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:35:34,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:35:34,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:35:34,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058504123] [2022-07-19 14:35:34,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058504123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:34,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:35:34,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:35:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759833472] [2022-07-19 14:35:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:34,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:35:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:35:34,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:35:34,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:35:34,913 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:35,406 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-19 14:35:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:35:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-19 14:35:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:35,408 INFO L225 Difference]: With dead ends: 69 [2022-07-19 14:35:35,408 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 14:35:35,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:35:35,410 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:35:35,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 14:35:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 14:35:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-19 14:35:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-19 14:35:35,419 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18 [2022-07-19 14:35:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:35,420 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-19 14:35:35,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:35:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-19 14:35:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 14:35:35,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:35,421 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] [2022-07-19 14:35:35,433 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:35:35,631 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:35:35,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1209896972, now seen corresponding path program 1 times [2022-07-19 14:35:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:35:35,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134395371] [2022-07-19 14:35:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:35,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:35:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:35:35,634 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:35:35,637 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:35:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:35,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-19 14:35:35,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:35,910 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:35:35,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-19 14:35:36,289 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-19 14:35:36,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-19 14:35:36,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:36,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:36,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:37,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:37,664 INFO L356 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2022-07-19 14:35:37,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 217 [2022-07-19 14:35:37,758 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 5 treesize of output 3 [2022-07-19 14:35:37,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:37,921 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-19 14:35:37,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 21 [2022-07-19 14:35:38,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:38,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:38,135 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-19 14:35:38,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 51 [2022-07-19 14:35:38,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 5 treesize of output 3 [2022-07-19 14:35:38,149 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 5 treesize of output 3 [2022-07-19 14:35:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:35:38,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:35:38,919 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:35:38,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3014 treesize of output 2943 [2022-07-19 14:35:38,969 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 3638 treesize of output 3510 [2022-07-19 14:35:38,995 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 3862 treesize of output 3798 [2022-07-19 14:35:39,031 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 3798 treesize of output 3766 [2022-07-19 14:35:39,061 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 3766 treesize of output 3750 [2022-07-19 14:35:39,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:39,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:39,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:39,399 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 30 treesize of output 28 [2022-07-19 14:35:39,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:39,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:39,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:35:39,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134395371] [2022-07-19 14:35:39,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134395371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:35:39,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [223274006] [2022-07-19 14:35:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:39,565 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:35:39,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:35:39,568 INFO L229 MonitoredProcess]: Starting monitored process 6 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:35:39,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-07-19 14:35:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:39,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-19 14:35:39,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:39,894 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:35:39,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-19 14:35:40,283 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-19 14:35:40,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-19 14:35:40,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:40,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:40,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:41,360 INFO L356 Elim1Store]: treesize reduction 192, result has 19.7 percent of original size [2022-07-19 14:35:41,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 300 treesize of output 411 [2022-07-19 14:35:41,382 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 5 treesize of output 3 [2022-07-19 14:35:41,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:41,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:41,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:41,649 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-19 14:35:41,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 408 treesize of output 136 [2022-07-19 14:35:41,931 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 5 treesize of output 3 [2022-07-19 14:35:41,939 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 5 treesize of output 3 [2022-07-19 14:35:42,426 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_~#s1~0.offset| (_ bv0 32)) (or (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32))) (let ((.cse1 (select v_DerPreprocessor_27 |c_~#s1~0.offset|))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_22) |c_~#s1~0.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_22)) (.cse0 (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|))) (let ((.cse5 (store (store (store (store (store (store (store (store (store .cse3 |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0))) (let ((.cse6 (store (store (store (store (store (store (store (store (store (store .cse5 .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0))) (let ((.cse2 (select .cse6 __ldv_list_add_~next.base)) (.cse4 (select |c_#memory_$Pointer$.base| .cse1))) (and (= (select .cse0 |c_~#s1~0.offset|) .cse1) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse2) (= (select (store .cse3 |c_~#s1~0.base| v_DerPreprocessor_27) .cse1) .cse4) (= (select .cse5 .cse1) .cse4) (= (select .cse6 .cse1) .cse4) (= .cse2 v_DerPreprocessor_25) (not (= (_ bv3 32) .cse1)) (= .cse1 (select .cse4 |c_~#s1~0.offset|))))))))) (and (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|))) (let ((.cse9 (select .cse13 |c_~#s1~0.offset|))) (let ((.cse11 (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_26) .cse9 v_DerPreprocessor_22) |c_~#s1~0.base| v_DerPreprocessor_26) .cse9 v_DerPreprocessor_22))) (let ((.cse8 (store (store (store (store (store (store (store (store (store .cse11 |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13))) (let ((.cse12 (store (store (store (store (store (store (store (store (store (store .cse8 .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse7 (select .cse12 __ldv_list_add_~next.base))) (and (= v_DerPreprocessor_25 .cse7) (= (select .cse8 .cse9) .cse10) (= (select (store .cse11 |c_~#s1~0.base| v_DerPreprocessor_26) .cse9) .cse10) (= (select .cse12 .cse9) .cse10) (= (select v_DerPreprocessor_26 |c_~#s1~0.offset|) .cse9) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse7))))))))) (not (= |c_~#s1~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|) |c_~#s1~0.offset|))))) (= (_ bv3 32) |c_~#s1~0.base|)) is different from true [2022-07-19 14:35:43,051 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_~#s1~0.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ldv_is_in_set_#in~s.base|) |c_ldv_is_in_set_#in~s.offset|) |c_ldv_is_in_set_#in~s.base|) (or (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32))) (let ((.cse1 (select v_DerPreprocessor_27 |c_~#s1~0.offset|))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_22) |c_~#s1~0.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_22)) (.cse0 (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|))) (let ((.cse5 (store (store (store (store (store (store (store (store (store .cse3 |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0))) (let ((.cse6 (store (store (store (store (store (store (store (store (store (store .cse5 .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0))) (let ((.cse2 (select .cse6 __ldv_list_add_~next.base)) (.cse4 (select |c_#memory_$Pointer$.base| .cse1))) (and (= (select .cse0 |c_~#s1~0.offset|) .cse1) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse2) (= (select (store .cse3 |c_~#s1~0.base| v_DerPreprocessor_27) .cse1) .cse4) (= (select .cse5 .cse1) .cse4) (= (select .cse6 .cse1) .cse4) (= .cse2 v_DerPreprocessor_25) (not (= (_ bv3 32) .cse1)) (= .cse1 (select .cse4 |c_~#s1~0.offset|))))))))) (and (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|))) (let ((.cse9 (select .cse13 |c_~#s1~0.offset|))) (let ((.cse11 (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_26) .cse9 v_DerPreprocessor_22) |c_~#s1~0.base| v_DerPreprocessor_26) .cse9 v_DerPreprocessor_22))) (let ((.cse8 (store (store (store (store (store (store (store (store (store .cse11 |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13))) (let ((.cse12 (store (store (store (store (store (store (store (store (store (store .cse8 .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse7 (select .cse12 __ldv_list_add_~next.base))) (and (= v_DerPreprocessor_25 .cse7) (= (select .cse8 .cse9) .cse10) (= (select (store .cse11 |c_~#s1~0.base| v_DerPreprocessor_26) .cse9) .cse10) (= (select .cse12 .cse9) .cse10) (= (select v_DerPreprocessor_26 |c_~#s1~0.offset|) .cse9) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse7))))))))) (not (= |c_~#s1~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|) |c_~#s1~0.offset|))))) (= (_ bv3 32) |c_~#s1~0.base|)) is different from true [2022-07-19 14:35:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-19 14:35:43,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:35:43,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:35:43,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3014 treesize of output 2943 [2022-07-19 14:35:43,435 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 3638 treesize of output 3510 [2022-07-19 14:35:43,458 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 3862 treesize of output 3798 [2022-07-19 14:35:43,485 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 3798 treesize of output 3782 [2022-07-19 14:35:43,510 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 3782 treesize of output 3750 [2022-07-19 14:35:43,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:43,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:43,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:43,713 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 30 treesize of output 28 [2022-07-19 14:35:43,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:43,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:43,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [223274006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:35:43,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:35:43,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-19 14:35:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038098598] [2022-07-19 14:35:43,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:35:43,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 14:35:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:35:43,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 14:35:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=644, Unknown=3, NotChecked=106, Total=870 [2022-07-19 14:35:43,785 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 22 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:35:44,384 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse14 (not (= |c_~#s1~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|) |c_~#s1~0.offset|))))) (and (= |c_~#s1~0.offset| (_ bv0 32)) (or (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32))) (let ((.cse1 (select v_DerPreprocessor_27 |c_~#s1~0.offset|))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_22) |c_~#s1~0.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_22)) (.cse0 (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|))) (let ((.cse5 (store (store (store (store (store (store (store (store (store .cse3 |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0))) (let ((.cse6 (store (store (store (store (store (store (store (store (store (store .cse5 .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0))) (let ((.cse2 (select .cse6 __ldv_list_add_~next.base)) (.cse4 (select |c_#memory_$Pointer$.base| .cse1))) (and (= (select .cse0 |c_~#s1~0.offset|) .cse1) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse2) (= (select (store .cse3 |c_~#s1~0.base| v_DerPreprocessor_27) .cse1) .cse4) (= (select .cse5 .cse1) .cse4) (= (select .cse6 .cse1) .cse4) (= .cse2 v_DerPreprocessor_25) (not (= (_ bv3 32) .cse1)) (= .cse1 (select .cse4 |c_~#s1~0.offset|))))))))) (and (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|))) (let ((.cse9 (select .cse13 |c_~#s1~0.offset|))) (let ((.cse11 (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_26) .cse9 v_DerPreprocessor_22) |c_~#s1~0.base| v_DerPreprocessor_26) .cse9 v_DerPreprocessor_22))) (let ((.cse8 (store (store (store (store (store (store (store (store (store .cse11 |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13))) (let ((.cse12 (store (store (store (store (store (store (store (store (store (store .cse8 .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse7 (select .cse12 __ldv_list_add_~next.base))) (and (= v_DerPreprocessor_25 .cse7) (= (select .cse8 .cse9) .cse10) (= (select (store .cse11 |c_~#s1~0.base| v_DerPreprocessor_26) .cse9) .cse10) (= (select .cse12 .cse9) .cse10) (= (select v_DerPreprocessor_26 |c_~#s1~0.offset|) .cse9) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse7))))))))) .cse14)) .cse14 (= (_ bv3 32) |c_~#s1~0.base|))) is different from true [2022-07-19 14:35:44,395 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse14 (not (= |c_~#s1~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|) |c_~#s1~0.offset|))))) (and (= |c_~#s1~0.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ldv_is_in_set_#in~s.base|) |c_ldv_is_in_set_#in~s.offset|) |c_ldv_is_in_set_#in~s.base|) (or (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32))) (let ((.cse1 (select v_DerPreprocessor_27 |c_~#s1~0.offset|))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_22) |c_~#s1~0.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_22)) (.cse0 (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|))) (let ((.cse5 (store (store (store (store (store (store (store (store (store .cse3 |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_29) |c_~#s1~0.base| .cse0))) (let ((.cse6 (store (store (store (store (store (store (store (store (store (store .cse5 .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse1 v_DerPreprocessor_24) |c_~#s1~0.base| .cse0))) (let ((.cse2 (select .cse6 __ldv_list_add_~next.base)) (.cse4 (select |c_#memory_$Pointer$.base| .cse1))) (and (= (select .cse0 |c_~#s1~0.offset|) .cse1) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse2) (= (select (store .cse3 |c_~#s1~0.base| v_DerPreprocessor_27) .cse1) .cse4) (= (select .cse5 .cse1) .cse4) (= (select .cse6 .cse1) .cse4) (= .cse2 v_DerPreprocessor_25) (not (= (_ bv3 32) .cse1)) (= .cse1 (select .cse4 |c_~#s1~0.offset|))))))))) (and (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|))) (let ((.cse9 (select .cse13 |c_~#s1~0.offset|))) (let ((.cse11 (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_26) .cse9 v_DerPreprocessor_22) |c_~#s1~0.base| v_DerPreprocessor_26) .cse9 v_DerPreprocessor_22))) (let ((.cse8 (store (store (store (store (store (store (store (store (store .cse11 |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_31) |c_~#s1~0.base| .cse13))) (let ((.cse12 (store (store (store (store (store (store (store (store (store (store .cse8 .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13) __ldv_list_add_~next.base v_DerPreprocessor_25) .cse9 v_DerPreprocessor_24) |c_~#s1~0.base| .cse13))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse7 (select .cse12 __ldv_list_add_~next.base))) (and (= v_DerPreprocessor_25 .cse7) (= (select .cse8 .cse9) .cse10) (= (select (store .cse11 |c_~#s1~0.base| v_DerPreprocessor_26) .cse9) .cse10) (= (select .cse12 .cse9) .cse10) (= (select v_DerPreprocessor_26 |c_~#s1~0.offset|) .cse9) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse7))))))))) .cse14)) .cse14 (= (_ bv3 32) |c_~#s1~0.base|))) is different from true [2022-07-19 14:35:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:44,401 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-07-19 14:35:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 14:35:44,404 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2022-07-19 14:35:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:44,406 INFO L225 Difference]: With dead ends: 37 [2022-07-19 14:35:44,406 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:35:44,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=178, Invalid=825, Unknown=5, NotChecked=252, Total=1260 [2022-07-19 14:35:44,407 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:35:44,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 152 Unchecked, 0.1s Time] [2022-07-19 14:35:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:35:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-19 14:35:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-19 14:35:44,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2022-07-19 14:35:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:44,419 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-19 14:35:44,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:35:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-19 14:35:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 14:35:44,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:44,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:35:44,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:35:44,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:35:44,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-19 14:35:44,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1260690627, now seen corresponding path program 1 times [2022-07-19 14:35:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:35:44,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741804556] [2022-07-19 14:35:44,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:44,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:35:44,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:35:44,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:35:44,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:35:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:44,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:35:44,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:35:44,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:35:44,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:35:44,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741804556] [2022-07-19 14:35:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741804556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:35:44,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:35:44,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:35:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161966072] [2022-07-19 14:35:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:35:44,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:35:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:35:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:35:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:35:44,976 INFO L87 Difference]: Start difference. First operand 31 states and 32 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:35:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:35:44,991 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-07-19 14:35:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:35:44,992 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-19 14:35:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:35:44,993 INFO L225 Difference]: With dead ends: 36 [2022-07-19 14:35:44,993 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:35:44,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:35:44,994 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:35:44,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:35:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:35:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-19 14:35:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:35:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-07-19 14:35:44,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-07-19 14:35:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:35:45,000 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-07-19 14:35:45,000 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:35:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-07-19 14:35:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 14:35:45,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:35:45,001 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, 1, 1] [2022-07-19 14:35:45,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:35:45,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:35:45,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:35:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:35:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1228732403, now seen corresponding path program 1 times [2022-07-19 14:35:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:35:45,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769658077] [2022-07-19 14:35:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:35:45,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:35:45,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:35:45,216 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:35:45,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:35:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:35:45,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-19 14:35:45,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:35:45,515 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:35:45,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-19 14:35:45,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2022-07-19 14:35:45,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:35:45,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:35:46,055 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-19 14:35:46,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-19 14:35:46,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:46,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:46,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:35:46,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:46,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:46,235 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-19 14:35:46,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 94 [2022-07-19 14:35:46,260 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 5 treesize of output 3 [2022-07-19 14:35:46,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:46,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:46,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:46,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2022-07-19 14:35:46,328 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 5 treesize of output 3 [2022-07-19 14:35:46,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:35:46,463 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-19 14:35:46,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 23 [2022-07-19 14:35:46,473 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 5 treesize of output 3 [2022-07-19 14:35:46,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:35:46,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769658077] [2022-07-19 14:35:46,505 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:35:46,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:35:46,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:35:46,708 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraintForOnePosition(ArrayIndexEqualityManager.java:415) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraint(ArrayIndexEqualityManager.java:449) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.constructWriteConstraints2(Elim1Store.java:975) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:314) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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:35:46,710 INFO L158 Benchmark]: Toolchain (without parser) took 14124.10ms. Allocated memory was 58.7MB in the beginning and 113.2MB in the end (delta: 54.5MB). Free memory was 35.7MB in the beginning and 50.7MB in the end (delta: -15.0MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2022-07-19 14:35:46,710 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 40.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:35:46,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.56ms. Allocated memory is still 58.7MB. Free memory was 35.6MB in the beginning and 27.9MB in the end (delta: 7.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:35:46,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 27.9MB in the beginning and 60.1MB in the end (delta: -32.2MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-19 14:35:46,711 INFO L158 Benchmark]: Boogie Preprocessor took 28.20ms. Allocated memory is still 77.6MB. Free memory was 60.1MB in the beginning and 58.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:35:46,711 INFO L158 Benchmark]: RCFGBuilder took 407.97ms. Allocated memory is still 77.6MB. Free memory was 58.3MB in the beginning and 45.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:35:46,711 INFO L158 Benchmark]: TraceAbstraction took 13095.81ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 44.6MB in the beginning and 50.7MB in the end (delta: -6.1MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2022-07-19 14:35:46,713 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.20ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 40.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.56ms. Allocated memory is still 58.7MB. Free memory was 35.6MB in the beginning and 27.9MB in the end (delta: 7.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 27.9MB in the beginning and 60.1MB in the end (delta: -32.2MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.20ms. Allocated memory is still 77.6MB. Free memory was 60.1MB in the beginning and 58.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.97ms. Allocated memory is still 77.6MB. Free memory was 58.3MB in the beginning and 45.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13095.81ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 44.6MB in the beginning and 50.7MB in the end (delta: -6.1MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:35:46,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63)