./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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 valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:11,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:11,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:11,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:11,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:11,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:11,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:11,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:11,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:11,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:11,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:11,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:11,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:11,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:11,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:11,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:11,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:11,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:11,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:11,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:11,720 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:11,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:11,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:11,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:11,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:11,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:11,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:11,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:11,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:11,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:11,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:11,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:11,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:11,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:11,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:11,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:11,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:11,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:11,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:11,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:11,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:11,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:11,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:50:11,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:11,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:11,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:11,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:11,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:11,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:11,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:11,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:11,755 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:11,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:11,756 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:11,756 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:11,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:11,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:11,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:11,757 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:11,757 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:11,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:11,757 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:11,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:11,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:11,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:11,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:11,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:11,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:11,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:11,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:11,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:50:11,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:50:11,760 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 valid-memcleanup) ) 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 -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2022-07-14 05:50:11,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:11,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:11,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:11,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:11,968 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:11,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2022-07-14 05:50:12,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a365d1e74/4f921c72c85d42bca2787f671db0afea/FLAG0efd8b5a0 [2022-07-14 05:50:12,393 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:12,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2022-07-14 05:50:12,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a365d1e74/4f921c72c85d42bca2787f671db0afea/FLAG0efd8b5a0 [2022-07-14 05:50:12,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a365d1e74/4f921c72c85d42bca2787f671db0afea [2022-07-14 05:50:12,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:12,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:12,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:12,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:12,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:12,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e4d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12, skipping insertion in model container [2022-07-14 05:50:12,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:12,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:12,627 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/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2022-07-14 05:50:12,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:12,655 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:12,680 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/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2022-07-14 05:50:12,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:12,719 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:12,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12 WrapperNode [2022-07-14 05:50:12,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:12,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:12,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:12,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:12,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,783 INFO L137 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2022-07-14 05:50:12,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:12,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:12,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:12,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:12,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:12,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:12,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:12,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:12,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (1/1) ... [2022-07-14 05:50:12,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:12,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:12,861 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-14 05:50:12,862 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-14 05:50:12,889 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-14 05:50:12,890 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2022-07-14 05:50:12,890 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 05:50:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2022-07-14 05:50:12,891 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2022-07-14 05:50:12,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 05:50:12,891 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2022-07-14 05:50:12,895 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2022-07-14 05:50:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:12,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:12,981 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:12,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:13,394 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:13,399 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:13,399 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-14 05:50:13,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:13 BoogieIcfgContainer [2022-07-14 05:50:13,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:13,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:13,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:13,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:13,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:12" (1/3) ... [2022-07-14 05:50:13,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb1b008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:13, skipping insertion in model container [2022-07-14 05:50:13,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:12" (2/3) ... [2022-07-14 05:50:13,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb1b008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:13, skipping insertion in model container [2022-07-14 05:50:13,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:13" (3/3) ... [2022-07-14 05:50:13,406 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2022-07-14 05:50:13,415 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:13,415 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2022-07-14 05:50:13,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:13,459 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@4ad27d68, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5cf2db4f [2022-07-14 05:50:13,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2022-07-14 05:50:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 120 states have (on average 2.1083333333333334) internal successors, (253), 210 states have internal predecessors, (253), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-14 05:50:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 05:50:13,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:13,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 05:50:13,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 6220774, now seen corresponding path program 1 times [2022-07-14 05:50:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:13,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857247851] [2022-07-14 05:50:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:13,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857247851] [2022-07-14 05:50:13,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857247851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:13,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:13,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5172907] [2022-07-14 05:50:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:13,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 05:50:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:13,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 05:50:13,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 05:50:13,611 INFO L87 Difference]: Start difference. First operand has 223 states, 120 states have (on average 2.1083333333333334) internal successors, (253), 210 states have internal predecessors, (253), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:13,631 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2022-07-14 05:50:13,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 05:50:13,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-14 05:50:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:13,638 INFO L225 Difference]: With dead ends: 221 [2022-07-14 05:50:13,638 INFO L226 Difference]: Without dead ends: 219 [2022-07-14 05:50:13,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 05:50:13,641 INFO L413 NwaCegarLoop]: 242 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, 242 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-14 05:50:13,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-14 05:50:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-07-14 05:50:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 116 states have (on average 1.8448275862068966) internal successors, (214), 206 states have internal predecessors, (214), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2022-07-14 05:50:13,674 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 4 [2022-07-14 05:50:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:13,674 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2022-07-14 05:50:13,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2022-07-14 05:50:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:50:13,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:13,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:50:13,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:50:13,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154958, now seen corresponding path program 1 times [2022-07-14 05:50:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:13,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3065121] [2022-07-14 05:50:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:13,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:13,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3065121] [2022-07-14 05:50:13,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3065121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:13,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:13,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695266848] [2022-07-14 05:50:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:13,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:13,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:13,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:13,739 INFO L87 Difference]: Start difference. First operand 219 states and 240 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:13,834 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2022-07-14 05:50:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:13,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 05:50:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:13,836 INFO L225 Difference]: With dead ends: 217 [2022-07-14 05:50:13,837 INFO L226 Difference]: Without dead ends: 217 [2022-07-14 05:50:13,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:13,838 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 17 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:13,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 367 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-14 05:50:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-14 05:50:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 116 states have (on average 1.8275862068965518) internal successors, (212), 204 states have internal predecessors, (212), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2022-07-14 05:50:13,848 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 6 [2022-07-14 05:50:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:13,849 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2022-07-14 05:50:13,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2022-07-14 05:50:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:50:13,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:13,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:50:13,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:50:13,850 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154959, now seen corresponding path program 1 times [2022-07-14 05:50:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:13,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893510238] [2022-07-14 05:50:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893510238] [2022-07-14 05:50:13,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893510238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:13,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:13,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32679066] [2022-07-14 05:50:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:13,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:13,897 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:13,983 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2022-07-14 05:50:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 05:50:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:13,985 INFO L225 Difference]: With dead ends: 215 [2022-07-14 05:50:13,985 INFO L226 Difference]: Without dead ends: 215 [2022-07-14 05:50:13,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:13,986 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:13,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 372 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-14 05:50:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-07-14 05:50:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 116 states have (on average 1.8103448275862069) internal successors, (210), 202 states have internal predecessors, (210), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2022-07-14 05:50:13,993 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 6 [2022-07-14 05:50:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:13,993 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2022-07-14 05:50:13,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2022-07-14 05:50:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:50:13,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:13,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:13,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:50:13,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -387700622, now seen corresponding path program 1 times [2022-07-14 05:50:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294368576] [2022-07-14 05:50:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:14,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294368576] [2022-07-14 05:50:14,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294368576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:14,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808855076] [2022-07-14 05:50:14,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:14,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:14,093 INFO L87 Difference]: Start difference. First operand 215 states and 236 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,254 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2022-07-14 05:50:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:50:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,256 INFO L225 Difference]: With dead ends: 210 [2022-07-14 05:50:14,256 INFO L226 Difference]: Without dead ends: 210 [2022-07-14 05:50:14,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:14,258 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 60 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 606 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-14 05:50:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-07-14 05:50:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 197 states have internal predecessors, (205), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2022-07-14 05:50:14,264 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 10 [2022-07-14 05:50:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,265 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2022-07-14 05:50:14,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2022-07-14 05:50:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:50:14,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:50:14,266 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash -387700621, now seen corresponding path program 1 times [2022-07-14 05:50:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325879131] [2022-07-14 05:50:14,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325879131] [2022-07-14 05:50:14,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325879131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161940474] [2022-07-14 05:50:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:14,332 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,517 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2022-07-14 05:50:14,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:14,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:50:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,519 INFO L225 Difference]: With dead ends: 205 [2022-07-14 05:50:14,519 INFO L226 Difference]: Without dead ends: 205 [2022-07-14 05:50:14,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-14 05:50:14,520 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 39 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 544 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-14 05:50:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-14 05:50:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.7241379310344827) internal successors, (200), 192 states have internal predecessors, (200), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2022-07-14 05:50:14,526 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 10 [2022-07-14 05:50:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,526 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2022-07-14 05:50:14,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2022-07-14 05:50:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:14,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:50:14,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 866182740, now seen corresponding path program 1 times [2022-07-14 05:50:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061075931] [2022-07-14 05:50:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061075931] [2022-07-14 05:50:14,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061075931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641902134] [2022-07-14 05:50:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:14,586 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,728 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2022-07-14 05:50:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:50:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,730 INFO L225 Difference]: With dead ends: 204 [2022-07-14 05:50:14,730 INFO L226 Difference]: Without dead ends: 204 [2022-07-14 05:50:14,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:14,731 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 21 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 630 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-14 05:50:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-07-14 05:50:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 116 states have (on average 1.7155172413793103) internal successors, (199), 191 states have internal predecessors, (199), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2022-07-14 05:50:14,736 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2022-07-14 05:50:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,736 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2022-07-14 05:50:14,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2022-07-14 05:50:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:14,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 05:50:14,737 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash 866182741, now seen corresponding path program 1 times [2022-07-14 05:50:14,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279731330] [2022-07-14 05:50:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:14,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279731330] [2022-07-14 05:50:14,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279731330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:14,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742286597] [2022-07-14 05:50:14,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:14,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:14,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:14,785 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:14,918 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2022-07-14 05:50:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:14,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:50:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:14,919 INFO L225 Difference]: With dead ends: 203 [2022-07-14 05:50:14,919 INFO L226 Difference]: Without dead ends: 203 [2022-07-14 05:50:14,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:14,920 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 20 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:14,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 858 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-14 05:50:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-07-14 05:50:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 116 states have (on average 1.706896551724138) internal successors, (198), 190 states have internal predecessors, (198), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2022-07-14 05:50:14,925 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 11 [2022-07-14 05:50:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:14,925 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2022-07-14 05:50:14,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2022-07-14 05:50:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 05:50:14,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:14,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 05:50:14,926 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:14,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash -610249734, now seen corresponding path program 1 times [2022-07-14 05:50:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111189822] [2022-07-14 05:50:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111189822] [2022-07-14 05:50:15,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111189822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143107863] [2022-07-14 05:50:15,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:15,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:15,074 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,405 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2022-07-14 05:50:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:15,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-14 05:50:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,409 INFO L225 Difference]: With dead ends: 202 [2022-07-14 05:50:15,409 INFO L226 Difference]: Without dead ends: 202 [2022-07-14 05:50:15,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:15,409 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 72 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 562 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-14 05:50:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-14 05:50:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 116 states have (on average 1.6982758620689655) internal successors, (197), 189 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2022-07-14 05:50:15,421 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2022-07-14 05:50:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,422 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2022-07-14 05:50:15,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2022-07-14 05:50:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 05:50:15,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:50:15,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:15,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash -610249733, now seen corresponding path program 1 times [2022-07-14 05:50:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199261732] [2022-07-14 05:50:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:15,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199261732] [2022-07-14 05:50:15,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199261732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876170167] [2022-07-14 05:50:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:15,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:15,581 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,892 INFO L93 Difference]: Finished difference Result 218 states and 245 transitions. [2022-07-14 05:50:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:15,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-14 05:50:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,895 INFO L225 Difference]: With dead ends: 218 [2022-07-14 05:50:15,895 INFO L226 Difference]: Without dead ends: 218 [2022-07-14 05:50:15,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:15,896 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 64 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 521 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-14 05:50:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 207. [2022-07-14 05:50:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 120 states have (on average 1.6833333333333333) internal successors, (202), 193 states have internal predecessors, (202), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2022-07-14 05:50:15,901 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 19 [2022-07-14 05:50:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,901 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2022-07-14 05:50:15,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2022-07-14 05:50:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 05:50:15,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,902 INFO L195 NwaCegarLoop]: trace histogram [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-14 05:50:15,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 05:50:15,902 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1097063055, now seen corresponding path program 1 times [2022-07-14 05:50:15,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177131756] [2022-07-14 05:50:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177131756] [2022-07-14 05:50:16,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177131756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185499080] [2022-07-14 05:50:16,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:16,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:16,037 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,290 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2022-07-14 05:50:16,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:16,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-14 05:50:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,291 INFO L225 Difference]: With dead ends: 206 [2022-07-14 05:50:16,291 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 05:50:16,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:16,292 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 126 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 509 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 05:50:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-14 05:50:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 120 states have (on average 1.675) internal successors, (201), 192 states have internal predecessors, (201), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 229 transitions. [2022-07-14 05:50:16,295 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 229 transitions. Word has length 24 [2022-07-14 05:50:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,296 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 229 transitions. [2022-07-14 05:50:16,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 229 transitions. [2022-07-14 05:50:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 05:50:16,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,296 INFO L195 NwaCegarLoop]: trace histogram [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-14 05:50:16,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:50:16,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1097063054, now seen corresponding path program 1 times [2022-07-14 05:50:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028281135] [2022-07-14 05:50:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028281135] [2022-07-14 05:50:16,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028281135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891486917] [2022-07-14 05:50:16,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:16,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:16,411 INFO L87 Difference]: Start difference. First operand 206 states and 229 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,675 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2022-07-14 05:50:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-14 05:50:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,678 INFO L225 Difference]: With dead ends: 205 [2022-07-14 05:50:16,693 INFO L226 Difference]: Without dead ends: 205 [2022-07-14 05:50:16,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:16,694 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 184 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 361 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-14 05:50:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-14 05:50:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 120 states have (on average 1.6666666666666667) internal successors, (200), 191 states have internal predecessors, (200), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2022-07-14 05:50:16,698 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 24 [2022-07-14 05:50:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,698 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2022-07-14 05:50:16,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2022-07-14 05:50:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 05:50:16,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:16,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:50:16,699 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 450998278, now seen corresponding path program 1 times [2022-07-14 05:50:16,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869090902] [2022-07-14 05:50:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 05:50:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:16,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869090902] [2022-07-14 05:50:16,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869090902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:16,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097256529] [2022-07-14 05:50:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:16,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:16,952 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-14 05:50:16,953 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-14 05:50:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 05:50:17,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:17,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:17,151 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-07-14 05:50:17,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 23 [2022-07-14 05:50:17,173 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 44 treesize of output 42 [2022-07-14 05:50:17,202 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-14 05:50:17,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:17,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:17,331 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-14 05:50:17,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:17,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-14 05:50:17,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:17,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097256529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:17,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:17,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2022-07-14 05:50:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109537858] [2022-07-14 05:50:17,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 05:50:17,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 05:50:17,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-07-14 05:50:17,595 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 05:50:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,998 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2022-07-14 05:50:17,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:17,998 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-07-14 05:50:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,999 INFO L225 Difference]: With dead ends: 223 [2022-07-14 05:50:17,999 INFO L226 Difference]: Without dead ends: 223 [2022-07-14 05:50:18,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-14 05:50:18,000 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 50 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 920 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 502 Invalid, 0 Unknown, 128 Unchecked, 0.3s Time] [2022-07-14 05:50:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-14 05:50:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2022-07-14 05:50:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 127 states have (on average 1.6141732283464567) internal successors, (205), 197 states have internal predecessors, (205), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 231 transitions. [2022-07-14 05:50:18,005 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 231 transitions. Word has length 34 [2022-07-14 05:50:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,005 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 231 transitions. [2022-07-14 05:50:18,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 05:50:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 231 transitions. [2022-07-14 05:50:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 05:50:18,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,006 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2022-07-14 05:50:18,030 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-14 05:50:18,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-14 05:50:18,212 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1428439082, now seen corresponding path program 1 times [2022-07-14 05:50:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207617825] [2022-07-14 05:50:18,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 05:50:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:18,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207617825] [2022-07-14 05:50:18,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207617825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:18,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10810675] [2022-07-14 05:50:18,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:18,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:18,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:18,348 INFO L87 Difference]: Start difference. First operand 211 states and 231 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 1 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-14 05:50:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:18,673 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2022-07-14 05:50:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:18,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 1 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 45 [2022-07-14 05:50:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:18,675 INFO L225 Difference]: With dead ends: 216 [2022-07-14 05:50:18,675 INFO L226 Difference]: Without dead ends: 216 [2022-07-14 05:50:18,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:18,676 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 240 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 343 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-14 05:50:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2022-07-14 05:50:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 127 states have (on average 1.5590551181102361) internal successors, (198), 190 states have internal predecessors, (198), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 224 transitions. [2022-07-14 05:50:18,680 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 224 transitions. Word has length 45 [2022-07-14 05:50:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,680 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 224 transitions. [2022-07-14 05:50:18,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 1 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-14 05:50:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 224 transitions. [2022-07-14 05:50:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 05:50:18,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,681 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2022-07-14 05:50:18,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 05:50:18,682 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1428439081, now seen corresponding path program 1 times [2022-07-14 05:50:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064346908] [2022-07-14 05:50:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 05:50:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064346908] [2022-07-14 05:50:18,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064346908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620980707] [2022-07-14 05:50:18,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:18,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:18,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:18,797 INFO L87 Difference]: Start difference. First operand 204 states and 224 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 1 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-14 05:50:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,135 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2022-07-14 05:50:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:19,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 1 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 45 [2022-07-14 05:50:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,137 INFO L225 Difference]: With dead ends: 231 [2022-07-14 05:50:19,137 INFO L226 Difference]: Without dead ends: 231 [2022-07-14 05:50:19,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:19,137 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 359 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:19,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 279 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-14 05:50:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 206. [2022-07-14 05:50:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 134 states have (on average 1.492537313432836) internal successors, (200), 191 states have internal predecessors, (200), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2022-07-14 05:50:19,142 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 45 [2022-07-14 05:50:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,142 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2022-07-14 05:50:19,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 1 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-14 05:50:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2022-07-14 05:50:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 05:50:19,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-14 05:50:19,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 05:50:19,143 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1331938361, now seen corresponding path program 1 times [2022-07-14 05:50:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:19,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180554556] [2022-07-14 05:50:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 05:50:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:19,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180554556] [2022-07-14 05:50:19,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180554556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:19,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:19,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153653563] [2022-07-14 05:50:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:19,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:19,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:19,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:19,260 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 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-14 05:50:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,578 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2022-07-14 05:50:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:19,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 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 46 [2022-07-14 05:50:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,579 INFO L225 Difference]: With dead ends: 211 [2022-07-14 05:50:19,579 INFO L226 Difference]: Without dead ends: 211 [2022-07-14 05:50:19,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:19,580 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 183 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:19,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 437 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-14 05:50:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 199. [2022-07-14 05:50:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 184 states have internal predecessors, (193), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 05:50:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2022-07-14 05:50:19,583 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 46 [2022-07-14 05:50:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,584 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2022-07-14 05:50:19,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 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-14 05:50:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2022-07-14 05:50:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 05:50:19,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-14 05:50:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 05:50:19,584 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1331938360, now seen corresponding path program 1 times [2022-07-14 05:50:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:19,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737793224] [2022-07-14 05:50:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 05:50:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:19,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737793224] [2022-07-14 05:50:19,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737793224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:19,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:19,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348284212] [2022-07-14 05:50:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:19,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:19,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:19,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:19,688 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 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-14 05:50:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:20,048 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2022-07-14 05:50:20,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:20,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 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 46 [2022-07-14 05:50:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:20,050 INFO L225 Difference]: With dead ends: 234 [2022-07-14 05:50:20,050 INFO L226 Difference]: Without dead ends: 234 [2022-07-14 05:50:20,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:20,050 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 311 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:20,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 333 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-14 05:50:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2022-07-14 05:50:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 190 states have internal predecessors, (202), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-14 05:50:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 232 transitions. [2022-07-14 05:50:20,067 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 232 transitions. Word has length 46 [2022-07-14 05:50:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:20,067 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 232 transitions. [2022-07-14 05:50:20,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 1 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-14 05:50:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 232 transitions. [2022-07-14 05:50:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 05:50:20,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:20,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-07-14 05:50:20,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 05:50:20,068 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:20,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1810979602, now seen corresponding path program 1 times [2022-07-14 05:50:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:20,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763883747] [2022-07-14 05:50:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:20,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 05:50:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:20,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763883747] [2022-07-14 05:50:20,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763883747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:20,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954876860] [2022-07-14 05:50:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:20,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:20,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:20,605 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-14 05:50:20,606 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-14 05:50:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:20,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-14 05:50:20,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:20,845 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 11 treesize of output 7 [2022-07-14 05:50:20,944 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:20,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-14 05:50:20,951 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 6 treesize of output 4 [2022-07-14 05:50:21,099 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:50:21,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-07-14 05:50:21,145 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:21,145 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 11 treesize of output 3 [2022-07-14 05:50:21,381 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (and (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1275) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1276) |c_#memory_$Pointer$.base|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-07-14 05:50:21,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:21,415 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-14 05:50:21,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-07-14 05:50:21,431 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 24 treesize of output 20 [2022-07-14 05:50:21,490 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 6 treesize of output 5 [2022-07-14 05:50:21,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:50:21,632 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-14 05:50:21,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:50:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 05:50:21,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:21,717 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:21,717 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 19 treesize of output 15 [2022-07-14 05:50:21,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954876860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:21,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:21,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 38 [2022-07-14 05:50:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336348775] [2022-07-14 05:50:21,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:21,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 05:50:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:21,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 05:50:21,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1430, Unknown=18, NotChecked=76, Total=1640 [2022-07-14 05:50:21,811 INFO L87 Difference]: Start difference. First operand 207 states and 232 transitions. Second operand has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:23,209 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2022-07-14 05:50:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:50:23,209 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2022-07-14 05:50:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:23,210 INFO L225 Difference]: With dead ends: 235 [2022-07-14 05:50:23,210 INFO L226 Difference]: Without dead ends: 235 [2022-07-14 05:50:23,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=234, Invalid=2604, Unknown=28, NotChecked=104, Total=2970 [2022-07-14 05:50:23,211 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 194 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 538 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:23,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 2388 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1889 Invalid, 0 Unknown, 538 Unchecked, 0.8s Time] [2022-07-14 05:50:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-14 05:50:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 222. [2022-07-14 05:50:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 160 states have (on average 1.3875) internal successors, (222), 204 states have internal predecessors, (222), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 254 transitions. [2022-07-14 05:50:23,216 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 254 transitions. Word has length 51 [2022-07-14 05:50:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:23,216 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 254 transitions. [2022-07-14 05:50:23,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 254 transitions. [2022-07-14 05:50:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 05:50:23,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:23,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:23,238 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-14 05:50:23,426 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,SelfDestructingSolverStorable16 [2022-07-14 05:50:23,426 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:23,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash 878718428, now seen corresponding path program 1 times [2022-07-14 05:50:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:23,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849505868] [2022-07-14 05:50:23,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:23,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 05:50:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:23,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849505868] [2022-07-14 05:50:23,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849505868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:23,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906848086] [2022-07-14 05:50:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:23,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:23,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:23,918 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-14 05:50:23,919 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-14 05:50:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:24,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-14 05:50:24,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:24,163 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 11 treesize of output 7 [2022-07-14 05:50:24,280 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:50:24,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-14 05:50:24,391 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-14 05:50:24,391 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 35 treesize of output 29 [2022-07-14 05:50:24,441 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:24,441 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 20 treesize of output 8 [2022-07-14 05:50:24,678 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_1494) |chain_node_~node~0#1.base| v_ArrVal_1496) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1497)) (<= |chain_node_~node~0#1.base| |chain_node_alloc_node_~ptr~0#1.base|) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-07-14 05:50:24,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:24,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:24,723 INFO L356 Elim1Store]: treesize reduction 43, result has 47.6 percent of original size [2022-07-14 05:50:24,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 57 [2022-07-14 05:50:24,736 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 6 treesize of output 4 [2022-07-14 05:50:24,778 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 6 treesize of output 5 [2022-07-14 05:50:24,845 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 20 treesize of output 12 [2022-07-14 05:50:24,851 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:24,851 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-14 05:50:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 05:50:24,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:24,901 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 10 treesize of output 8 [2022-07-14 05:50:24,979 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_main_~#p2~0#1.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) (forall ((|v_chain_node_alloc_node_~ptr~0#1.base_20| Int) (|v_chain_node_~node~0#1.base_14| Int) (v_ArrVal_1508 (Array Int Int)) (v_ArrVal_1507 (Array Int Int)) (v_ArrVal_1506 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_20| v_ArrVal_1508) |v_chain_node_~node~0#1.base_14| v_ArrVal_1507) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_1506) |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) 0)) (< |v_chain_node_alloc_node_~ptr~0#1.base_20| |v_chain_node_~node~0#1.base_14|) (not (< |v_chain_node_alloc_node_~ptr~0#1.base_20| |c_#StackHeapBarrier|))))) is different from false [2022-07-14 05:50:24,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906848086] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:24,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:24,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 37 [2022-07-14 05:50:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459389797] [2022-07-14 05:50:24,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:24,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 05:50:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:24,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 05:50:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1207, Unknown=17, NotChecked=142, Total=1482 [2022-07-14 05:50:24,982 INFO L87 Difference]: Start difference. First operand 222 states and 254 transitions. Second operand has 37 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,406 INFO L93 Difference]: Finished difference Result 237 states and 267 transitions. [2022-07-14 05:50:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 05:50:26,406 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2022-07-14 05:50:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,407 INFO L225 Difference]: With dead ends: 237 [2022-07-14 05:50:26,407 INFO L226 Difference]: Without dead ends: 237 [2022-07-14 05:50:26,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=263, Invalid=2474, Unknown=27, NotChecked=206, Total=2970 [2022-07-14 05:50:26,408 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 219 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 644 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2490 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1838 Invalid, 0 Unknown, 644 Unchecked, 0.9s Time] [2022-07-14 05:50:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-14 05:50:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 222. [2022-07-14 05:50:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 160 states have (on average 1.38125) internal successors, (221), 204 states have internal predecessors, (221), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 253 transitions. [2022-07-14 05:50:26,412 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 253 transitions. Word has length 53 [2022-07-14 05:50:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,413 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 253 transitions. [2022-07-14 05:50:26,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 253 transitions. [2022-07-14 05:50:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 05:50:26,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:26,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-14 05:50:26,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 05:50:26,635 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash 878707492, now seen corresponding path program 1 times [2022-07-14 05:50:26,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:26,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502422228] [2022-07-14 05:50:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 05:50:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 05:50:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:27,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502422228] [2022-07-14 05:50:27,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502422228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:27,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561678946] [2022-07-14 05:50:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:27,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:27,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:27,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:27,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 05:50:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:27,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-14 05:50:27,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:27,557 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-14 05:50:27,557 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-07-14 05:50:27,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-14 05:50:27,796 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 05:50:27,797 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 15 treesize of output 15 [2022-07-14 05:50:27,883 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:27,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-14 05:50:27,893 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 14 treesize of output 10 [2022-07-14 05:50:28,114 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:50:28,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-07-14 05:50:28,234 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:28,235 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 41 treesize of output 25 [2022-07-14 05:50:28,238 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-14 05:50:29,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:29,743 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-14 05:50:29,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 67 [2022-07-14 05:50:29,766 INFO L356 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2022-07-14 05:50:29,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 73 treesize of output 98 [2022-07-14 05:50:29,770 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 05:50:29,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:29,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:29,980 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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-14 05:50:29,981 INFO L158 Benchmark]: Toolchain (without parser) took 17559.92ms. Allocated memory was 104.9MB in the beginning and 251.7MB in the end (delta: 146.8MB). Free memory was 75.3MB in the beginning and 159.6MB in the end (delta: -84.3MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:29,981 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:50:29,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.26ms. Allocated memory was 104.9MB in the beginning and 144.7MB in the end (delta: 39.8MB). Free memory was 75.3MB in the beginning and 111.5MB in the end (delta: -36.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 05:50:29,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.33ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 109.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:29,983 INFO L158 Benchmark]: Boogie Preprocessor took 51.62ms. Allocated memory is still 144.7MB. Free memory was 109.1MB in the beginning and 107.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:29,983 INFO L158 Benchmark]: RCFGBuilder took 564.80ms. Allocated memory is still 144.7MB. Free memory was 106.7MB in the beginning and 115.1MB in the end (delta: -8.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-14 05:50:29,983 INFO L158 Benchmark]: TraceAbstraction took 16578.64ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 114.4MB in the beginning and 159.6MB in the end (delta: -45.2MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:29,984 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.11ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.26ms. Allocated memory was 104.9MB in the beginning and 144.7MB in the end (delta: 39.8MB). Free memory was 75.3MB in the beginning and 111.5MB in the end (delta: -36.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.33ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 109.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.62ms. Allocated memory is still 144.7MB. Free memory was 109.1MB in the beginning and 107.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 564.80ms. Allocated memory is still 144.7MB. Free memory was 106.7MB in the beginning and 115.1MB in the end (delta: -8.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16578.64ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 114.4MB in the beginning and 159.6MB in the end (delta: -45.2MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 05:50:30,009 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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 valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:31,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:31,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:31,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:31,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:31,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:31,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:31,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:31,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:31,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:31,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:31,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:31,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:31,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:31,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:31,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:31,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:31,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:31,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:31,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:31,711 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:31,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:31,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:31,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:31,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:31,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:31,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:31,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:31,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:31,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:31,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:31,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:31,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:31,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:31,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:31,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:31,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:31,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:31,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:31,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:31,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:31,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:31,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-07-14 05:50:31,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:31,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:31,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:31,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:31,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:31,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:31,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:31,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:31,756 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:31,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:31,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:31,757 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:31,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:31,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:31,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:31,758 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:31,758 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:31,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:31,758 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:31,758 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 05:50:31,758 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 05:50:31,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:31,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:31,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:31,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:31,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:31,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:31,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:31,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:31,760 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 05:50:31,760 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:31,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 05:50:31,760 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 valid-memcleanup) ) 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 -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2022-07-14 05:50:32,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:32,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:32,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:32,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:32,030 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:32,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2022-07-14 05:50:32,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b07d7516/a27a8cd354744cb9ae47beb2e0691e6f/FLAGe54c78882 [2022-07-14 05:50:32,493 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:32,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2022-07-14 05:50:32,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b07d7516/a27a8cd354744cb9ae47beb2e0691e6f/FLAGe54c78882 [2022-07-14 05:50:32,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b07d7516/a27a8cd354744cb9ae47beb2e0691e6f [2022-07-14 05:50:32,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:32,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:32,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:32,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:32,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:32,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159c227a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32, skipping insertion in model container [2022-07-14 05:50:32,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:32,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:32,769 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/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2022-07-14 05:50:32,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:32,813 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:32,846 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/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2022-07-14 05:50:32,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:32,894 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:32,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32 WrapperNode [2022-07-14 05:50:32,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:32,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:32,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:32,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:32,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,934 INFO L137 Inliner]: procedures = 130, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 201 [2022-07-14 05:50:32,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:32,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:32,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:32,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:32,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:32,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:32,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:32,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:32,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (1/1) ... [2022-07-14 05:50:32,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:32,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:33,013 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-14 05:50:33,015 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-14 05:50:33,046 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-14 05:50:33,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-14 05:50:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 05:50:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2022-07-14 05:50:33,047 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2022-07-14 05:50:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 05:50:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 05:50:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2022-07-14 05:50:33,048 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2022-07-14 05:50:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2022-07-14 05:50:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2022-07-14 05:50:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:33,163 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:33,164 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:33,739 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:33,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:33,745 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-14 05:50:33,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:33 BoogieIcfgContainer [2022-07-14 05:50:33,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:33,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:33,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:33,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:33,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:32" (1/3) ... [2022-07-14 05:50:33,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694c56e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:33, skipping insertion in model container [2022-07-14 05:50:33,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:32" (2/3) ... [2022-07-14 05:50:33,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694c56e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:33, skipping insertion in model container [2022-07-14 05:50:33,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:33" (3/3) ... [2022-07-14 05:50:33,752 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2022-07-14 05:50:33,760 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:33,761 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2022-07-14 05:50:33,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:33,810 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@38ee1eea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@590acd9 [2022-07-14 05:50:33,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2022-07-14 05:50:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 117 states have (on average 2.1367521367521367) internal successors, (250), 207 states have internal predecessors, (250), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-14 05:50:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 05:50:33,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:33,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 05:50:33,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash 6220742, now seen corresponding path program 1 times [2022-07-14 05:50:33,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062996020] [2022-07-14 05:50:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:33,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:33,833 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-14 05:50:33,872 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-14 05:50:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:33,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 05:50:33,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:33,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:33,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:33,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062996020] [2022-07-14 05:50:33,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062996020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:33,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:33,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729906011] [2022-07-14 05:50:33,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:33,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 05:50:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 05:50:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 05:50:33,954 INFO L87 Difference]: Start difference. First operand has 220 states, 117 states have (on average 2.1367521367521367) internal successors, (250), 207 states have internal predecessors, (250), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:33,973 INFO L93 Difference]: Finished difference Result 218 states and 239 transitions. [2022-07-14 05:50:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 05:50:33,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-14 05:50:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:33,980 INFO L225 Difference]: With dead ends: 218 [2022-07-14 05:50:33,980 INFO L226 Difference]: Without dead ends: 216 [2022-07-14 05:50:33,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 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-14 05:50:33,983 INFO L413 NwaCegarLoop]: 239 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, 239 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-14 05:50:33,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-14 05:50:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-14 05:50:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 113 states have (on average 1.8672566371681416) internal successors, (211), 203 states have internal predecessors, (211), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 237 transitions. [2022-07-14 05:50:34,030 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 237 transitions. Word has length 4 [2022-07-14 05:50:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:34,030 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 237 transitions. [2022-07-14 05:50:34,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2022-07-14 05:50:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:50:34,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:34,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:50:34,040 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-14 05:50:34,235 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-14 05:50:34,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1692065585, now seen corresponding path program 1 times [2022-07-14 05:50:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:34,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946409110] [2022-07-14 05:50:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:34,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:34,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:34,239 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-14 05:50:34,240 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-14 05:50:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:34,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 05:50:34,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:34,347 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 6 treesize of output 5 [2022-07-14 05:50:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:34,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:34,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:34,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946409110] [2022-07-14 05:50:34,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946409110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:34,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:34,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399926325] [2022-07-14 05:50:34,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:34,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:34,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:34,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:34,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:34,366 INFO L87 Difference]: Start difference. First operand 216 states and 237 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:34,598 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2022-07-14 05:50:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:34,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 05:50:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:34,599 INFO L225 Difference]: With dead ends: 214 [2022-07-14 05:50:34,599 INFO L226 Difference]: Without dead ends: 214 [2022-07-14 05:50:34,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:34,600 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:34,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 361 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-14 05:50:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-07-14 05:50:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 113 states have (on average 1.8495575221238938) internal successors, (209), 201 states have internal predecessors, (209), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 235 transitions. [2022-07-14 05:50:34,613 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 235 transitions. Word has length 6 [2022-07-14 05:50:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:34,613 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 235 transitions. [2022-07-14 05:50:34,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 235 transitions. [2022-07-14 05:50:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:50:34,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:34,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:50:34,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-14 05:50:34,815 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-14 05:50:34,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1692065586, now seen corresponding path program 1 times [2022-07-14 05:50:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:34,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822371626] [2022-07-14 05:50:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:34,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:34,818 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-14 05:50:34,819 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-14 05:50:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:34,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 05:50:34,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:34,894 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 6 treesize of output 5 [2022-07-14 05:50:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:34,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:34,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:34,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822371626] [2022-07-14 05:50:34,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822371626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:34,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:34,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:34,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153176256] [2022-07-14 05:50:34,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:34,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:34,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:34,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:34,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:34,913 INFO L87 Difference]: Start difference. First operand 214 states and 235 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:35,125 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2022-07-14 05:50:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 05:50:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:35,127 INFO L225 Difference]: With dead ends: 212 [2022-07-14 05:50:35,127 INFO L226 Difference]: Without dead ends: 212 [2022-07-14 05:50:35,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:35,128 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:35,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 366 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-14 05:50:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-07-14 05:50:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 113 states have (on average 1.831858407079646) internal successors, (207), 199 states have internal predecessors, (207), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 05:50:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 233 transitions. [2022-07-14 05:50:35,139 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 233 transitions. Word has length 6 [2022-07-14 05:50:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:35,139 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 233 transitions. [2022-07-14 05:50:35,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 233 transitions. [2022-07-14 05:50:35,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:50:35,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:35,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:35,149 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-14 05:50:35,340 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-14 05:50:35,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1321164331, now seen corresponding path program 1 times [2022-07-14 05:50:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:35,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873969396] [2022-07-14 05:50:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:35,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:35,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:35,345 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-14 05:50:35,347 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-14 05:50:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:35,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 05:50:35,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:35,462 INFO L356 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2022-07-14 05:50:35,464 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 2 case distinctions, treesize of input 12 treesize of output 33 [2022-07-14 05:50:35,535 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:50:35,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 27 [2022-07-14 05:50:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:35,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:35,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:35,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873969396] [2022-07-14 05:50:35,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873969396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:35,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:35,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:35,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797439581] [2022-07-14 05:50:35,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:35,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:35,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:35,601 INFO L87 Difference]: Start difference. First operand 212 states and 233 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:35,826 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2022-07-14 05:50:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:35,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:50:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:35,829 INFO L225 Difference]: With dead ends: 225 [2022-07-14 05:50:35,829 INFO L226 Difference]: Without dead ends: 225 [2022-07-14 05:50:35,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-14 05:50:35,829 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 13 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:35,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 655 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2022-07-14 05:50:35,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-14 05:50:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2022-07-14 05:50:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 122 states have (on average 1.7950819672131149) internal successors, (219), 209 states have internal predecessors, (219), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2022-07-14 05:50:35,837 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 10 [2022-07-14 05:50:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:35,838 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2022-07-14 05:50:35,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2022-07-14 05:50:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:50:35,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:35,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:35,852 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-14 05:50:36,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:36,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1321164330, now seen corresponding path program 1 times [2022-07-14 05:50:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:36,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565957466] [2022-07-14 05:50:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:36,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:36,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:36,047 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:36,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 05:50:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:36,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 05:50:36,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:36,167 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-14 05:50:36,168 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-07-14 05:50:36,204 INFO L356 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2022-07-14 05:50:36,204 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 2 case distinctions, treesize of input 12 treesize of output 33 [2022-07-14 05:50:36,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:36,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:36,301 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:36,301 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-14 05:50:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:36,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:36,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:36,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565957466] [2022-07-14 05:50:36,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565957466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:36,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:36,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052634293] [2022-07-14 05:50:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:36,343 INFO L87 Difference]: Start difference. First operand 224 states and 251 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:36,897 INFO L93 Difference]: Finished difference Result 216 states and 241 transitions. [2022-07-14 05:50:36,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:50:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:36,899 INFO L225 Difference]: With dead ends: 216 [2022-07-14 05:50:36,899 INFO L226 Difference]: Without dead ends: 216 [2022-07-14 05:50:36,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-14 05:50:36,900 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 40 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:36,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 535 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 05:50:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-14 05:50:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2022-07-14 05:50:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 121 states have (on average 1.71900826446281) internal successors, (208), 200 states have internal predecessors, (208), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 240 transitions. [2022-07-14 05:50:36,909 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 240 transitions. Word has length 10 [2022-07-14 05:50:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:36,910 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 240 transitions. [2022-07-14 05:50:36,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 240 transitions. [2022-07-14 05:50:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:36,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:36,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:36,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-14 05:50:37,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:37,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:37,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1993578833, now seen corresponding path program 1 times [2022-07-14 05:50:37,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:37,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177893502] [2022-07-14 05:50:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:37,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:37,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:37,131 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-14 05:50:37,132 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-14 05:50:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:37,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 05:50:37,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:37,212 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 6 treesize of output 5 [2022-07-14 05:50:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:37,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:37,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:37,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177893502] [2022-07-14 05:50:37,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177893502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:37,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:37,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:37,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498860947] [2022-07-14 05:50:37,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:37,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:37,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:37,236 INFO L87 Difference]: Start difference. First operand 215 states and 240 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:37,527 INFO L93 Difference]: Finished difference Result 214 states and 239 transitions. [2022-07-14 05:50:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:50:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:37,528 INFO L225 Difference]: With dead ends: 214 [2022-07-14 05:50:37,528 INFO L226 Difference]: Without dead ends: 214 [2022-07-14 05:50:37,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:37,529 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 26 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:37,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 618 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-14 05:50:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-07-14 05:50:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 121 states have (on average 1.7107438016528926) internal successors, (207), 199 states have internal predecessors, (207), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 239 transitions. [2022-07-14 05:50:37,534 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 239 transitions. Word has length 11 [2022-07-14 05:50:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:37,535 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 239 transitions. [2022-07-14 05:50:37,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 239 transitions. [2022-07-14 05:50:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:37,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:37,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:37,544 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-14 05:50:37,741 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-14 05:50:37,742 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1993578834, now seen corresponding path program 1 times [2022-07-14 05:50:37,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:37,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765189402] [2022-07-14 05:50:37,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:37,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:37,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:37,747 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-14 05:50:37,748 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-14 05:50:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:37,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 05:50:37,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:37,829 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 6 treesize of output 5 [2022-07-14 05:50:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:37,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:37,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:37,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765189402] [2022-07-14 05:50:37,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765189402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:37,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:37,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:37,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504459640] [2022-07-14 05:50:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:37,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:37,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:37,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:37,866 INFO L87 Difference]: Start difference. First operand 214 states and 239 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:38,233 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2022-07-14 05:50:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 05:50:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:38,235 INFO L225 Difference]: With dead ends: 213 [2022-07-14 05:50:38,235 INFO L226 Difference]: Without dead ends: 213 [2022-07-14 05:50:38,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:38,235 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 23 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:38,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 635 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-14 05:50:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-07-14 05:50:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 121 states have (on average 1.7024793388429753) internal successors, (206), 198 states have internal predecessors, (206), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 238 transitions. [2022-07-14 05:50:38,240 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 238 transitions. Word has length 11 [2022-07-14 05:50:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:38,240 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 238 transitions. [2022-07-14 05:50:38,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 238 transitions. [2022-07-14 05:50:38,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 05:50:38,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:38,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:38,253 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-14 05:50:38,441 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-14 05:50:38,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting chain_nodeErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash 273848882, now seen corresponding path program 1 times [2022-07-14 05:50:38,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:38,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595995123] [2022-07-14 05:50:38,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:38,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:38,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:38,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 05:50:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:38,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 05:50:38,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:38,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:38,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:38,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595995123] [2022-07-14 05:50:38,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595995123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:38,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:38,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:38,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933913589] [2022-07-14 05:50:38,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:38,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:38,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:38,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:38,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:38,561 INFO L87 Difference]: Start difference. First operand 213 states and 238 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:38,708 INFO L93 Difference]: Finished difference Result 212 states and 237 transitions. [2022-07-14 05:50:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:38,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 05:50:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:38,710 INFO L225 Difference]: With dead ends: 212 [2022-07-14 05:50:38,710 INFO L226 Difference]: Without dead ends: 212 [2022-07-14 05:50:38,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:38,711 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:38,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 358 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-14 05:50:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-07-14 05:50:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 197 states have internal predecessors, (205), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2022-07-14 05:50:38,715 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 13 [2022-07-14 05:50:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:38,715 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2022-07-14 05:50:38,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2022-07-14 05:50:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:50:38,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:38,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:38,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:38,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:38,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2066019085, now seen corresponding path program 1 times [2022-07-14 05:50:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:38,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705005085] [2022-07-14 05:50:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:38,919 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:38,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 05:50:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:39,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 05:50:39,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:39,032 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-14 05:50:39,033 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 2 case distinctions, treesize of input 12 treesize of output 30 [2022-07-14 05:50:39,145 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 05:50:39,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 28 [2022-07-14 05:50:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:39,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:39,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:39,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705005085] [2022-07-14 05:50:39,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705005085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:39,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:39,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048154742] [2022-07-14 05:50:39,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:39,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:39,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:39,231 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:39,501 INFO L93 Difference]: Finished difference Result 217 states and 243 transitions. [2022-07-14 05:50:39,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:39,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-14 05:50:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:39,503 INFO L225 Difference]: With dead ends: 217 [2022-07-14 05:50:39,503 INFO L226 Difference]: Without dead ends: 217 [2022-07-14 05:50:39,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:39,505 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 67 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:39,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 521 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 0 Unknown, 282 Unchecked, 0.3s Time] [2022-07-14 05:50:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-14 05:50:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2022-07-14 05:50:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 121 states have (on average 1.6859504132231404) internal successors, (204), 196 states have internal predecessors, (204), 20 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2022-07-14 05:50:39,512 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 18 [2022-07-14 05:50:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:39,512 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2022-07-14 05:50:39,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2022-07-14 05:50:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:50:39,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:39,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:39,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:39,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:39,721 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2066019086, now seen corresponding path program 1 times [2022-07-14 05:50:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:39,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326411667] [2022-07-14 05:50:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:39,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:39,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:39,723 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:39,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 05:50:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:39,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 05:50:39,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:39,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:39,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:39,845 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:39,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-07-14 05:50:39,850 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 14 treesize of output 12 [2022-07-14 05:50:39,913 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:39,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 05:50:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:39,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:39,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:39,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326411667] [2022-07-14 05:50:39,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326411667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:39,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:39,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:39,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560369720] [2022-07-14 05:50:39,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:39,978 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:40,297 INFO L93 Difference]: Finished difference Result 228 states and 254 transitions. [2022-07-14 05:50:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-14 05:50:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:40,300 INFO L225 Difference]: With dead ends: 228 [2022-07-14 05:50:40,300 INFO L226 Difference]: Without dead ends: 228 [2022-07-14 05:50:40,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:40,301 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 45 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:40,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 581 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 186 Invalid, 0 Unknown, 264 Unchecked, 0.3s Time] [2022-07-14 05:50:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-14 05:50:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2022-07-14 05:50:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.6296296296296295) internal successors, (220), 210 states have internal predecessors, (220), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 05:50:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 254 transitions. [2022-07-14 05:50:40,306 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 254 transitions. Word has length 18 [2022-07-14 05:50:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:40,306 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 254 transitions. [2022-07-14 05:50:40,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 254 transitions. [2022-07-14 05:50:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 05:50:40,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:40,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:40,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:40,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:40,514 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:40,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1434990185, now seen corresponding path program 1 times [2022-07-14 05:50:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:40,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876686476] [2022-07-14 05:50:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:40,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:40,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:40,516 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:40,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 05:50:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:40,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 05:50:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:40,651 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-14 05:50:40,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 37 [2022-07-14 05:50:40,752 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 05:50:40,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 28 [2022-07-14 05:50:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:40,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:40,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:40,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876686476] [2022-07-14 05:50:40,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876686476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:40,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:40,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578406427] [2022-07-14 05:50:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:40,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:40,787 INFO L87 Difference]: Start difference. First operand 227 states and 254 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:41,045 INFO L93 Difference]: Finished difference Result 230 states and 257 transitions. [2022-07-14 05:50:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:41,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-07-14 05:50:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:41,046 INFO L225 Difference]: With dead ends: 230 [2022-07-14 05:50:41,046 INFO L226 Difference]: Without dead ends: 230 [2022-07-14 05:50:41,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:41,047 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 61 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:41,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 520 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 204 Invalid, 0 Unknown, 272 Unchecked, 0.2s Time] [2022-07-14 05:50:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-14 05:50:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2022-07-14 05:50:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 212 states have internal predecessors, (223), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 05:50:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 257 transitions. [2022-07-14 05:50:41,051 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 257 transitions. Word has length 22 [2022-07-14 05:50:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:41,052 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 257 transitions. [2022-07-14 05:50:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 257 transitions. [2022-07-14 05:50:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 05:50:41,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:41,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:41,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:41,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:41,260 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1434990184, now seen corresponding path program 1 times [2022-07-14 05:50:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:41,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782386661] [2022-07-14 05:50:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:41,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:41,262 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:41,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 05:50:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:41,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 05:50:41,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:41,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:41,405 INFO L356 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-07-14 05:50:41,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 20 [2022-07-14 05:50:41,410 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 10 treesize of output 8 [2022-07-14 05:50:41,484 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-14 05:50:41,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 30 [2022-07-14 05:50:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:41,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:41,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:41,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782386661] [2022-07-14 05:50:41,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782386661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:41,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:41,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314000822] [2022-07-14 05:50:41,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:41,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:41,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:41,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:41,643 INFO L87 Difference]: Start difference. First operand 229 states and 257 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:41,926 INFO L93 Difference]: Finished difference Result 247 states and 275 transitions. [2022-07-14 05:50:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:41,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-07-14 05:50:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:41,928 INFO L225 Difference]: With dead ends: 247 [2022-07-14 05:50:41,928 INFO L226 Difference]: Without dead ends: 247 [2022-07-14 05:50:41,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:41,929 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 46 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:41,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 578 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 186 Invalid, 0 Unknown, 271 Unchecked, 0.3s Time] [2022-07-14 05:50:41,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-14 05:50:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2022-07-14 05:50:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 152 states have (on average 1.5723684210526316) internal successors, (239), 228 states have internal predecessors, (239), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (14), 10 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:50:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 275 transitions. [2022-07-14 05:50:41,935 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 275 transitions. Word has length 22 [2022-07-14 05:50:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:41,936 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 275 transitions. [2022-07-14 05:50:41,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 275 transitions. [2022-07-14 05:50:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 05:50:41,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:41,939 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:41,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:42,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:42,146 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 823372381, now seen corresponding path program 1 times [2022-07-14 05:50:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:42,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550048771] [2022-07-14 05:50:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:42,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:42,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:42,148 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:42,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 05:50:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 05:50:42,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:42,298 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 05:50:42,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 05:50:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:42,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:42,373 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:50:42,374 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 11 [2022-07-14 05:50:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:42,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:42,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550048771] [2022-07-14 05:50:42,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550048771] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:42,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:42,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-14 05:50:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574457572] [2022-07-14 05:50:42,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:42,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:42,388 INFO L87 Difference]: Start difference. First operand 246 states and 275 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:42,655 INFO L93 Difference]: Finished difference Result 245 states and 273 transitions. [2022-07-14 05:50:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:42,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-14 05:50:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:42,656 INFO L225 Difference]: With dead ends: 245 [2022-07-14 05:50:42,656 INFO L226 Difference]: Without dead ends: 245 [2022-07-14 05:50:42,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:42,657 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 30 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:42,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 791 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-14 05:50:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 236. [2022-07-14 05:50:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 145 states have (on average 1.5862068965517242) internal successors, (230), 219 states have internal predecessors, (230), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 05:50:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 262 transitions. [2022-07-14 05:50:42,661 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 262 transitions. Word has length 24 [2022-07-14 05:50:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:42,662 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 262 transitions. [2022-07-14 05:50:42,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 05:50:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 262 transitions. [2022-07-14 05:50:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 05:50:42,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:42,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:42,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:42,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:42,867 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1607136150, now seen corresponding path program 1 times [2022-07-14 05:50:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:42,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299586346] [2022-07-14 05:50:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:42,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:42,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:42,869 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:42,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 05:50:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:43,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 05:50:43,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:43,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:43,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:43,048 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:43,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-07-14 05:50:43,059 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 14 treesize of output 12 [2022-07-14 05:50:43,076 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-14 05:50:43,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:43,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:43,263 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:43,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 05:50:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:43,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:43,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:43,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299586346] [2022-07-14 05:50:43,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299586346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:43,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1842384955] [2022-07-14 05:50:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:43,476 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:43,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:50:43,477 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:50:43,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-07-14 05:50:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:43,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 05:50:43,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:43,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:43,744 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-07-14 05:50:43,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 23 [2022-07-14 05:50:43,751 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 39 treesize of output 37 [2022-07-14 05:50:43,763 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-14 05:50:43,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:43,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:43,881 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-14 05:50:43,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:43,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 05:50:44,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:44,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1842384955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:44,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:44,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-14 05:50:44,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178000734] [2022-07-14 05:50:44,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:44,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 05:50:44,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:44,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 05:50:44,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 05:50:44,114 INFO L87 Difference]: Start difference. First operand 236 states and 262 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 05:50:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:44,530 INFO L93 Difference]: Finished difference Result 254 states and 281 transitions. [2022-07-14 05:50:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:50:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-07-14 05:50:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:44,532 INFO L225 Difference]: With dead ends: 254 [2022-07-14 05:50:44,532 INFO L226 Difference]: Without dead ends: 254 [2022-07-14 05:50:44,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-14 05:50:44,532 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 81 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 545 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:44,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 753 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 257 Invalid, 0 Unknown, 545 Unchecked, 0.4s Time] [2022-07-14 05:50:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-14 05:50:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2022-07-14 05:50:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 157 states have (on average 1.535031847133758) internal successors, (241), 232 states have internal predecessors, (241), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (14), 10 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 05:50:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 277 transitions. [2022-07-14 05:50:44,537 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 277 transitions. Word has length 32 [2022-07-14 05:50:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:44,537 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 277 transitions. [2022-07-14 05:50:44,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 05:50:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 277 transitions. [2022-07-14 05:50:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 05:50:44,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:44,538 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:44,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:44,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:44,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:44,942 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1364319342, now seen corresponding path program 1 times [2022-07-14 05:50:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:44,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013698102] [2022-07-14 05:50:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:44,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:44,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:44,944 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:44,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 05:50:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:45,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 05:50:45,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:45,145 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-14 05:50:45,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 37 [2022-07-14 05:50:45,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 21 [2022-07-14 05:50:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:45,277 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 05:50:45,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 43 [2022-07-14 05:50:46,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 30 treesize of output 26 [2022-07-14 05:50:46,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:46,841 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 05:50:46,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 48 [2022-07-14 05:50:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:47,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:47,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:47,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013698102] [2022-07-14 05:50:47,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013698102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:47,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [929727404] [2022-07-14 05:50:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:47,386 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:50:47,388 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:50:47,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-14 05:50:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:47,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 05:50:47,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:47,720 INFO L356 Elim1Store]: treesize reduction 76, result has 35.0 percent of original size [2022-07-14 05:50:47,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 27 treesize of output 56 [2022-07-14 05:50:47,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:47,806 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 24 treesize of output 28 [2022-07-14 05:50:47,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:47,990 INFO L356 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2022-07-14 05:50:47,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2022-07-14 05:50:48,183 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:48,183 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 25 treesize of output 21 [2022-07-14 05:50:48,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:48,284 INFO L356 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2022-07-14 05:50:48,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 43 [2022-07-14 05:50:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:48,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:48,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [929727404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:48,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:48,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-14 05:50:48,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168932267] [2022-07-14 05:50:48,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:48,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 05:50:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:48,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 05:50:48,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-07-14 05:50:48,675 INFO L87 Difference]: Start difference. First operand 250 states and 277 transitions. Second operand has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:49,090 INFO L93 Difference]: Finished difference Result 280 states and 309 transitions. [2022-07-14 05:50:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 05:50:49,090 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-07-14 05:50:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:49,093 INFO L225 Difference]: With dead ends: 280 [2022-07-14 05:50:49,093 INFO L226 Difference]: Without dead ends: 280 [2022-07-14 05:50:49,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-07-14 05:50:49,093 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 22 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 756 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:49,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1546 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 285 Invalid, 0 Unknown, 756 Unchecked, 0.3s Time] [2022-07-14 05:50:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-14 05:50:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2022-07-14 05:50:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 183 states have (on average 1.469945355191257) internal successors, (269), 258 states have internal predecessors, (269), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 05:50:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2022-07-14 05:50:49,099 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 36 [2022-07-14 05:50:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:49,099 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2022-07-14 05:50:49,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2022-07-14 05:50:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 05:50:49,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:49,100 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:49,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:49,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2022-07-14 05:50:49,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:49,515 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1364319343, now seen corresponding path program 1 times [2022-07-14 05:50:49,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:49,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713293948] [2022-07-14 05:50:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:49,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:49,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:49,517 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:49,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 05:50:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:49,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 05:50:49,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:49,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:49,728 INFO L356 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-07-14 05:50:49,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 20 [2022-07-14 05:50:49,732 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 10 treesize of output 8 [2022-07-14 05:50:49,758 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:49,758 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 7 [2022-07-14 05:50:49,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:49,865 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 05:50:49,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 26 [2022-07-14 05:50:49,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:49,989 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 21 treesize of output 25 [2022-07-14 05:50:50,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:50,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:50,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:50,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:50,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713293948] [2022-07-14 05:50:50,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713293948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:50,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1192728185] [2022-07-14 05:50:50,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:50,303 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:50:50,304 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:50:50,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-14 05:50:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:50,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 05:50:50,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:50,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:50,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:50,640 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:50,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-07-14 05:50:50,654 INFO L356 Elim1Store]: treesize reduction 2, result has 75.0 percent of original size [2022-07-14 05:50:50,654 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 44 treesize of output 46 [2022-07-14 05:50:50,685 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-14 05:50:50,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:50,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:50,840 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-14 05:50:50,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:50,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 05:50:50,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:51,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1192728185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:51,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:51,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-07-14 05:50:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585793122] [2022-07-14 05:50:51,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:51,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 05:50:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 05:50:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:50:51,088 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand has 12 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:51,719 INFO L93 Difference]: Finished difference Result 284 states and 314 transitions. [2022-07-14 05:50:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 05:50:51,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-07-14 05:50:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:51,720 INFO L225 Difference]: With dead ends: 284 [2022-07-14 05:50:51,720 INFO L226 Difference]: Without dead ends: 284 [2022-07-14 05:50:51,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:50:51,721 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 28 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:51,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1485 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 545 Invalid, 0 Unknown, 258 Unchecked, 0.6s Time] [2022-07-14 05:50:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-14 05:50:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2022-07-14 05:50:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 186 states have (on average 1.4623655913978495) internal successors, (272), 260 states have internal predecessors, (272), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 05:50:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 310 transitions. [2022-07-14 05:50:51,726 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 310 transitions. Word has length 36 [2022-07-14 05:50:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:51,726 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 310 transitions. [2022-07-14 05:50:51,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:50:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 310 transitions. [2022-07-14 05:50:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 05:50:51,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:51,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:51,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:51,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-14 05:50:52,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:52,131 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash 956122662, now seen corresponding path program 1 times [2022-07-14 05:50:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:52,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354838810] [2022-07-14 05:50:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:52,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:52,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:52,133 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:52,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 05:50:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:52,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 05:50:52,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:52,334 INFO L356 Elim1Store]: treesize reduction 2, result has 75.0 percent of original size [2022-07-14 05:50:52,335 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 44 treesize of output 46 [2022-07-14 05:50:52,455 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:50:52,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 05:50:52,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:52,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:52,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:52,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354838810] [2022-07-14 05:50:52,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354838810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:52,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:52,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597869343] [2022-07-14 05:50:52,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:52,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:52,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:52,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:52,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:52,480 INFO L87 Difference]: Start difference. First operand 282 states and 310 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-14 05:50:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:52,849 INFO L93 Difference]: Finished difference Result 288 states and 318 transitions. [2022-07-14 05:50:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 42 [2022-07-14 05:50:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:52,850 INFO L225 Difference]: With dead ends: 288 [2022-07-14 05:50:52,850 INFO L226 Difference]: Without dead ends: 288 [2022-07-14 05:50:52,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:52,851 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 163 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:52,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 427 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 391 Invalid, 0 Unknown, 150 Unchecked, 0.4s Time] [2022-07-14 05:50:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-14 05:50:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 275. [2022-07-14 05:50:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 186 states have (on average 1.424731182795699) internal successors, (265), 253 states have internal predecessors, (265), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 05:50:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2022-07-14 05:50:52,856 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 42 [2022-07-14 05:50:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:52,856 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2022-07-14 05:50:52,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-14 05:50:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2022-07-14 05:50:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 05:50:52,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:52,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:52,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:53,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:53,078 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:53,078 INFO L85 PathProgramCache]: Analyzing trace with hash 956122663, now seen corresponding path program 1 times [2022-07-14 05:50:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:53,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341686804] [2022-07-14 05:50:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:53,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:53,080 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:53,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 05:50:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:53,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 05:50:53,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:53,299 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 6 treesize of output 5 [2022-07-14 05:50:53,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:53,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-14 05:50:53,443 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:53,443 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-14 05:50:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:53,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:53,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:53,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341686804] [2022-07-14 05:50:53,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341686804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:53,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:53,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762766162] [2022-07-14 05:50:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:53,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:53,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:53,471 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-14 05:50:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:54,100 INFO L93 Difference]: Finished difference Result 400 states and 444 transitions. [2022-07-14 05:50:54,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:54,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 42 [2022-07-14 05:50:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:54,102 INFO L225 Difference]: With dead ends: 400 [2022-07-14 05:50:54,102 INFO L226 Difference]: Without dead ends: 400 [2022-07-14 05:50:54,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:54,102 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 266 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:54,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 406 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 447 Invalid, 0 Unknown, 221 Unchecked, 0.6s Time] [2022-07-14 05:50:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-14 05:50:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 336. [2022-07-14 05:50:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 241 states have (on average 1.4854771784232366) internal successors, (358), 308 states have internal predecessors, (358), 29 states have call successors, (29), 9 states have call predecessors, (29), 8 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-14 05:50:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 408 transitions. [2022-07-14 05:50:54,111 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 408 transitions. Word has length 42 [2022-07-14 05:50:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:54,111 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 408 transitions. [2022-07-14 05:50:54,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-14 05:50:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 408 transitions. [2022-07-14 05:50:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 05:50:54,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:54,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-14 05:50:54,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-14 05:50:54,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:54,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash -424968332, now seen corresponding path program 1 times [2022-07-14 05:50:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:54,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113109896] [2022-07-14 05:50:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:54,323 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:54,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 05:50:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:54,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 05:50:54,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:54,518 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 14 treesize of output 12 [2022-07-14 05:50:54,525 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 6 treesize of output 5 [2022-07-14 05:50:54,607 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:50:54,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 05:50:54,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 05:50:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:54,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:54,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:54,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113109896] [2022-07-14 05:50:54,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113109896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:54,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:54,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786305839] [2022-07-14 05:50:54,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:54,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:54,630 INFO L87 Difference]: Start difference. First operand 336 states and 408 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-14 05:50:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:55,053 INFO L93 Difference]: Finished difference Result 359 states and 431 transitions. [2022-07-14 05:50:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:55,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 43 [2022-07-14 05:50:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:55,054 INFO L225 Difference]: With dead ends: 359 [2022-07-14 05:50:55,054 INFO L226 Difference]: Without dead ends: 359 [2022-07-14 05:50:55,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:55,055 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 161 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:55,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 459 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 439 Invalid, 0 Unknown, 147 Unchecked, 0.4s Time] [2022-07-14 05:50:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-14 05:50:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 345. [2022-07-14 05:50:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 255 states have (on average 1.4352941176470588) internal successors, (366), 315 states have internal predecessors, (366), 30 states have call successors, (30), 9 states have call predecessors, (30), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-14 05:50:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 418 transitions. [2022-07-14 05:50:55,064 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 418 transitions. Word has length 43 [2022-07-14 05:50:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:55,064 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 418 transitions. [2022-07-14 05:50:55,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-14 05:50:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 418 transitions. [2022-07-14 05:50:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 05:50:55,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:55,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-14 05:50:55,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:55,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:55,274 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:55,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash -424968331, now seen corresponding path program 1 times [2022-07-14 05:50:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:55,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047910225] [2022-07-14 05:50:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:55,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:55,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:55,276 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:55,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 05:50:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:55,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 05:50:55,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:55,478 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 6 treesize of output 5 [2022-07-14 05:50:57,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:57,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-14 05:50:57,622 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:57,623 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-14 05:50:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:57,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:57,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:57,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047910225] [2022-07-14 05:50:57,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047910225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:57,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:57,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131468224] [2022-07-14 05:50:57,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:57,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:57,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:57,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2022-07-14 05:50:57,676 INFO L87 Difference]: Start difference. First operand 345 states and 418 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-14 05:50:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:58,454 INFO L93 Difference]: Finished difference Result 448 states and 534 transitions. [2022-07-14 05:50:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:58,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 43 [2022-07-14 05:50:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:58,456 INFO L225 Difference]: With dead ends: 448 [2022-07-14 05:50:58,456 INFO L226 Difference]: Without dead ends: 448 [2022-07-14 05:50:58,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-07-14 05:50:58,457 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 156 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:58,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 449 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 549 Invalid, 0 Unknown, 168 Unchecked, 0.7s Time] [2022-07-14 05:50:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-14 05:50:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 399. [2022-07-14 05:50:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 304 states have (on average 1.444078947368421) internal successors, (439), 364 states have internal predecessors, (439), 35 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-14 05:50:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 501 transitions. [2022-07-14 05:50:58,463 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 501 transitions. Word has length 43 [2022-07-14 05:50:58,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:58,464 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 501 transitions. [2022-07-14 05:50:58,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-14 05:50:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 501 transitions. [2022-07-14 05:50:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 05:50:58,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:58,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-07-14 05:50:58,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:58,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:50:58,665 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:50:58,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash 587207845, now seen corresponding path program 1 times [2022-07-14 05:50:58,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:58,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778978126] [2022-07-14 05:50:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:58,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:58,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:58,667 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:50:58,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 05:50:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:58,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 05:50:58,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:59,000 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 11 treesize of output 7 [2022-07-14 05:50:59,101 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:50:59,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-14 05:50:59,224 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-14 05:50:59,224 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 35 treesize of output 29 [2022-07-14 05:50:59,552 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| (_ BitVec 32)) (v_ArrVal_1235 (Array (_ BitVec 32) (_ BitVec 32)))) (and (not (= |chain_node_~node~0#1.base| (_ bv0 32))) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1235))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)))) (= (_ bv0 1) (select |c_old(#valid)| |chain_node_~node~0#1.base|)))) is different from true [2022-07-14 05:50:59,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:59,644 INFO L356 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2022-07-14 05:50:59,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 104 [2022-07-14 05:50:59,660 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:59,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2022-07-14 05:50:59,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-14 05:50:59,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:59,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 12 [2022-07-14 05:51:00,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-07-14 05:51:00,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:00,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:00,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 49 [2022-07-14 05:51:00,437 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 12 treesize of output 8 [2022-07-14 05:51:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 05:51:00,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:00,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:00,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778978126] [2022-07-14 05:51:00,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778978126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:00,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1282889549] [2022-07-14 05:51:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:00,697 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:00,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:51:00,699 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:51:00,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-14 05:51:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:01,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 05:51:01,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:01,274 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 11 treesize of output 7 [2022-07-14 05:51:01,457 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:01,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-14 05:51:01,467 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 6 treesize of output 4 [2022-07-14 05:51:01,651 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:51:01,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-07-14 05:51:01,728 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:51:01,731 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 11 treesize of output 3 [2022-07-14 05:51:02,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:02,329 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-14 05:51:02,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-07-14 05:51:02,334 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 7 treesize of output 5 [2022-07-14 05:51:02,343 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 6 treesize of output 4 [2022-07-14 05:51:02,457 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 6 treesize of output 5 [2022-07-14 05:51:02,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 05:51:02,696 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-14 05:51:02,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 05:51:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:02,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:02,835 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:51:02,836 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 19 treesize of output 15 [2022-07-14 05:51:03,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1282889549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:03,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:03,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2022-07-14 05:51:03,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421921071] [2022-07-14 05:51:03,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:03,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 05:51:03,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:03,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 05:51:03,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1994, Unknown=27, NotChecked=90, Total=2256 [2022-07-14 05:51:03,038 INFO L87 Difference]: Start difference. First operand 399 states and 501 transitions. Second operand has 42 states, 40 states have (on average 2.0) internal successors, (80), 38 states have internal predecessors, (80), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:03,603 WARN L855 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|) (_ bv0 32))) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((|chain_node_~node~0#1.base| (_ BitVec 32)) (v_ArrVal_1235 (Array (_ BitVec 32) (_ BitVec 32)))) (and (not (= |chain_node_~node~0#1.base| (_ bv0 32))) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1235))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)))) (= (_ bv0 1) (select |c_old(#valid)| |chain_node_~node~0#1.base|)))) (exists ((|chain_node_~node~0#1.base| (_ BitVec 32)) (v_ArrVal_1331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1330 (Array (_ BitVec 32) (_ BitVec 32)))) (and (bvult |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1330) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1331) |c_#memory_$Pointer$.base|))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-07-14 05:51:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:13,376 INFO L93 Difference]: Finished difference Result 432 states and 536 transitions. [2022-07-14 05:51:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 05:51:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.0) internal successors, (80), 38 states have internal predecessors, (80), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2022-07-14 05:51:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:13,378 INFO L225 Difference]: With dead ends: 432 [2022-07-14 05:51:13,378 INFO L226 Difference]: Without dead ends: 432 [2022-07-14 05:51:13,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=325, Invalid=4051, Unknown=54, NotChecked=262, Total=4692 [2022-07-14 05:51:13,380 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 144 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1802 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:13,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 2799 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1123 Invalid, 0 Unknown, 1802 Unchecked, 1.1s Time] [2022-07-14 05:51:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-07-14 05:51:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 426. [2022-07-14 05:51:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 328 states have (on average 1.4329268292682926) internal successors, (470), 389 states have internal predecessors, (470), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-14 05:51:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 534 transitions. [2022-07-14 05:51:13,386 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 534 transitions. Word has length 48 [2022-07-14 05:51:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:13,386 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 534 transitions. [2022-07-14 05:51:13,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.0) internal successors, (80), 38 states have internal predecessors, (80), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 534 transitions. [2022-07-14 05:51:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 05:51:13,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:13,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-07-14 05:51:13,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:13,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:13,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:13,798 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:51:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1655188335, now seen corresponding path program 1 times [2022-07-14 05:51:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:13,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679858821] [2022-07-14 05:51:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:13,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:13,800 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:13,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 05:51:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:14,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 05:51:14,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:14,036 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 10 treesize of output 8 [2022-07-14 05:51:14,115 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 11 treesize of output 7 [2022-07-14 05:51:14,223 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:51:14,224 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 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-14 05:51:14,313 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 05:51:14,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-07-14 05:51:14,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 9 treesize of output 7 [2022-07-14 05:51:14,650 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| (_ BitVec 32)) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32)))) (and (not (= |chain_node_~node~0#1.base| (_ bv0 32))) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1424))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)))) (= (_ bv0 1) (select |c_old(#valid)| |chain_node_~node~0#1.base|)))) is different from true [2022-07-14 05:51:14,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:14,738 INFO L356 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2022-07-14 05:51:14,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 97 [2022-07-14 05:51:14,755 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:14,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-14 05:51:14,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:14,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2022-07-14 05:51:14,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:14,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2022-07-14 05:51:14,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-14 05:51:15,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-14 05:51:15,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:15,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 84 [2022-07-14 05:51:15,539 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-14 05:51:15,543 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 12 treesize of output 8 [2022-07-14 05:51:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 05:51:15,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:15,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:15,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679858821] [2022-07-14 05:51:15,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679858821] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:15,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1592421568] [2022-07-14 05:51:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:15,802 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 05:51:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 05:51:15,803 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 05:51:15,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-14 05:51:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:16,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 05:51:16,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:16,138 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 10 treesize of output 8 [2022-07-14 05:51:16,377 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 11 treesize of output 7 [2022-07-14 05:51:16,616 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 05:51:16,616 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 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-14 05:51:16,727 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 05:51:16,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-07-14 05:51:16,744 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 9 treesize of output 7 [2022-07-14 05:51:16,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-14 05:51:17,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:17,376 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-14 05:51:17,377 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 2 case distinctions, treesize of input 18 treesize of output 30 [2022-07-14 05:51:17,388 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 6 treesize of output 4 [2022-07-14 05:51:17,485 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 6 treesize of output 5 [2022-07-14 05:51:17,618 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 20 treesize of output 12 [2022-07-14 05:51:17,632 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:17,636 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-14 05:51:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:17,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:17,710 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 10 treesize of output 8 [2022-07-14 05:51:17,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1592421568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:51:17,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:17,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 40 [2022-07-14 05:51:17,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374839879] [2022-07-14 05:51:17,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:17,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 05:51:17,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:17,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 05:51:17,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1734, Unknown=15, NotChecked=84, Total=1980 [2022-07-14 05:51:17,898 INFO L87 Difference]: Start difference. First operand 426 states and 534 transitions. Second operand has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:28,476 INFO L93 Difference]: Finished difference Result 434 states and 537 transitions. [2022-07-14 05:51:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 05:51:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 50 [2022-07-14 05:51:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:28,478 INFO L225 Difference]: With dead ends: 434 [2022-07-14 05:51:28,478 INFO L226 Difference]: Without dead ends: 434 [2022-07-14 05:51:28,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=306, Invalid=3444, Unknown=36, NotChecked=120, Total=3906 [2022-07-14 05:51:28,479 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 129 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1017 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:28,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 2742 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1570 Invalid, 0 Unknown, 1017 Unchecked, 1.5s Time] [2022-07-14 05:51:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-14 05:51:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 426. [2022-07-14 05:51:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 328 states have (on average 1.4298780487804879) internal successors, (469), 389 states have internal predecessors, (469), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-14 05:51:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 533 transitions. [2022-07-14 05:51:28,486 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 533 transitions. Word has length 50 [2022-07-14 05:51:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:28,486 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 533 transitions. [2022-07-14 05:51:28,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 05:51:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 533 transitions. [2022-07-14 05:51:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 05:51:28,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:28,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-07-14 05:51:28,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:28,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:28,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:28,892 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-07-14 05:51:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1655177492, now seen corresponding path program 1 times [2022-07-14 05:51:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:28,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271788959] [2022-07-14 05:51:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:28,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:28,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:28,894 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 05:51:28,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 05:51:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:29,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 05:51:29,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:29,205 INFO L356 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2022-07-14 05:51:29,205 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 2 case distinctions, treesize of input 12 treesize of output 33 [2022-07-14 05:51:29,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-14 05:51:29,382 INFO L356 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2022-07-14 05:51:29,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 35 [2022-07-14 05:51:29,487 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:51:29,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-14 05:51:29,496 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 14 treesize of output 10 [2022-07-14 05:51:29,710 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:51:29,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2022-07-14 05:51:30,116 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| (_ BitVec 32)) (v_ArrVal_1619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1616 (_ BitVec 1)) (v_ArrVal_1620 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| v_ArrVal_1616)) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1619) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1620) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| |chain_node_~node~0#1.base|)))) is different from true [2022-07-14 05:51:30,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:30,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:30,199 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-14 05:51:30,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2022-07-14 05:51:30,308 INFO L356 Elim1Store]: treesize reduction 96, result has 44.5 percent of original size [2022-07-14 05:51:30,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 87 treesize of output 150 [2022-07-14 05:51:30,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271788959] [2022-07-14 05:51:30,312 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 05:51:30,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:30,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 05:51:30,513 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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-14 05:51:30,517 INFO L158 Benchmark]: Toolchain (without parser) took 57997.52ms. Allocated memory was 56.6MB in the beginning and 96.5MB in the end (delta: 39.8MB). Free memory was 33.7MB in the beginning and 59.4MB in the end (delta: -25.6MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2022-07-14 05:51:30,517 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 38.4MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:51:30,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.12ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 31.3MB in the end (delta: 2.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 05:51:30,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.24ms. Allocated memory is still 56.6MB. Free memory was 31.3MB in the beginning and 28.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:51:30,518 INFO L158 Benchmark]: Boogie Preprocessor took 39.76ms. Allocated memory is still 56.6MB. Free memory was 28.8MB in the beginning and 26.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 05:51:30,518 INFO L158 Benchmark]: RCFGBuilder took 770.03ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 26.3MB in the beginning and 47.0MB in the end (delta: -20.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-14 05:51:30,518 INFO L158 Benchmark]: TraceAbstraction took 56768.73ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 46.3MB in the beginning and 59.4MB in the end (delta: -13.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-07-14 05:51:30,519 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 38.4MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.12ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 31.3MB in the end (delta: 2.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.24ms. Allocated memory is still 56.6MB. Free memory was 31.3MB in the beginning and 28.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.76ms. Allocated memory is still 56.6MB. Free memory was 28.8MB in the beginning and 26.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 770.03ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 26.3MB in the beginning and 47.0MB in the end (delta: -20.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 56768.73ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 46.3MB in the beginning and 59.4MB in the end (delta: -13.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 05:51:30,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER