./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:23:06,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:23:06,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:23:06,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:23:06,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:23:06,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:23:06,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:23:06,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:23:06,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:23:06,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:23:06,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:23:06,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:23:06,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:23:06,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:23:06,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:23:06,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:23:06,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:23:06,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:23:06,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:23:06,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:23:06,116 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:23:06,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:23:06,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:23:06,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:23:06,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:23:06,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:23:06,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:23:06,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:23:06,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:23:06,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:23:06,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:23:06,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:23:06,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:23:06,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:23:06,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:23:06,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:23:06,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:23:06,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:23:06,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:23:06,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:23:06,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:23:06,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:23:06,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:23:06,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:23:06,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:23:06,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:23:06,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:23:06,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:23:06,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:23:06,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:23:06,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:23:06,160 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:23:06,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:23:06,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:23:06,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:23:06,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:23:06,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:23:06,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:23:06,162 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:23:06,162 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:23:06,162 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:23:06,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:23:06,162 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:23:06,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:23:06,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:23:06,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:23:06,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:23:06,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:23:06,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:23:06,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:23:06,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:23:06,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:23:06,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:23:06,164 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2022-07-20 06:23:06,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:23:06,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:23:06,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:23:06,384 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:23:06,385 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:23:06,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2022-07-20 06:23:06,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b4db50c/673ca93241bd4487b4198d2431535a7d/FLAG6494ec0f8 [2022-07-20 06:23:06,770 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:23:06,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2022-07-20 06:23:06,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b4db50c/673ca93241bd4487b4198d2431535a7d/FLAG6494ec0f8 [2022-07-20 06:23:07,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b4db50c/673ca93241bd4487b4198d2431535a7d [2022-07-20 06:23:07,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:23:07,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:23:07,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:23:07,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:23:07,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:23:07,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb75d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07, skipping insertion in model container [2022-07-20 06:23:07,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:23:07,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:23:07,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2022-07-20 06:23:07,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:23:07,484 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:23:07,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2022-07-20 06:23:07,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:23:07,561 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:23:07,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07 WrapperNode [2022-07-20 06:23:07,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:23:07,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:23:07,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:23:07,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:23:07,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,623 INFO L137 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2022-07-20 06:23:07,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:23:07,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:23:07,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:23:07,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:23:07,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:23:07,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:23:07,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:23:07,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:23:07,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (1/1) ... [2022-07-20 06:23:07,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:23:07,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:23:07,733 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-20 06:23:07,757 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-20 06:23:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:23:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-20 06:23:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-20 06:23:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:23:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:23:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:23:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:23:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:23:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:23:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 06:23:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:23:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:23:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:23:07,867 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:23:07,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:23:08,116 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:23:08,121 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:23:08,121 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 06:23:08,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:23:08 BoogieIcfgContainer [2022-07-20 06:23:08,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:23:08,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:23:08,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:23:08,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:23:08,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:23:07" (1/3) ... [2022-07-20 06:23:08,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c5539b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:23:08, skipping insertion in model container [2022-07-20 06:23:08,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:07" (2/3) ... [2022-07-20 06:23:08,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c5539b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:23:08, skipping insertion in model container [2022-07-20 06:23:08,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:23:08" (3/3) ... [2022-07-20 06:23:08,139 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2022-07-20 06:23:08,148 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:23:08,149 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-07-20 06:23:08,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:23:08,190 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@321c918e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8fc7df1 [2022-07-20 06:23:08,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-07-20 06:23:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:23:08,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:08,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:23:08,205 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:08,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:08,209 INFO L85 PathProgramCache]: Analyzing trace with hash 893736149, now seen corresponding path program 1 times [2022-07-20 06:23:08,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:08,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495905560] [2022-07-20 06:23:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:08,350 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-20 06:23:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:08,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495905560] [2022-07-20 06:23:08,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495905560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:08,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:08,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:23:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872508973] [2022-07-20 06:23:08,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:08,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:23:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:08,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:23:08,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:23:08,384 INFO L87 Difference]: Start difference. First operand has 93 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 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-20 06:23:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:08,474 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-07-20 06:23:08,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:23:08,477 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-20 06:23:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:08,482 INFO L225 Difference]: With dead ends: 91 [2022-07-20 06:23:08,482 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:23:08,484 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-20 06:23:08,486 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:08,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:23:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:23:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 06:23:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-07-20 06:23:08,509 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 6 [2022-07-20 06:23:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:08,509 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-07-20 06:23:08,509 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-20 06:23:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-07-20 06:23:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:23:08,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:08,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:23:08,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:23:08,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 893736150, now seen corresponding path program 1 times [2022-07-20 06:23:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:08,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857889461] [2022-07-20 06:23:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:08,544 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-20 06:23:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:08,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857889461] [2022-07-20 06:23:08,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857889461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:08,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:08,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:23:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911304593] [2022-07-20 06:23:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:08,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:23:08,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:08,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:23:08,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:23:08,547 INFO L87 Difference]: Start difference. First operand 88 states and 92 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-20 06:23:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:08,589 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-07-20 06:23:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:23:08,589 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-20 06:23:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:08,590 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:23:08,590 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:23:08,591 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-20 06:23:08,591 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:08,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:23:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:23:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-20 06:23:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-07-20 06:23:08,597 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 6 [2022-07-20 06:23:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:08,597 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-07-20 06:23:08,597 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-20 06:23:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-07-20 06:23:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:23:08,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:08,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:08,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:23:08,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1919809879, now seen corresponding path program 1 times [2022-07-20 06:23:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:08,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017143640] [2022-07-20 06:23:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:23:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:08,660 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-20 06:23:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017143640] [2022-07-20 06:23:08,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017143640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:08,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:08,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:23:08,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455771868] [2022-07-20 06:23:08,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:08,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:23:08,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:08,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:23:08,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:23:08,662 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-20 06:23:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:08,772 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-07-20 06:23:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:23:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-07-20 06:23:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:08,778 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:23:08,778 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:23:08,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:23:08,785 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:08,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:23:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:23:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2022-07-20 06:23:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-07-20 06:23:08,801 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 13 [2022-07-20 06:23:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:08,801 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-07-20 06:23:08,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-20 06:23:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-07-20 06:23:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:23:08,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:08,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:08,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:23:08,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 951797020, now seen corresponding path program 1 times [2022-07-20 06:23:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:08,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140534553] [2022-07-20 06:23:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:23:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:08,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:23:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:23:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:08,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140534553] [2022-07-20 06:23:08,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140534553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:08,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:08,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:23:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998674868] [2022-07-20 06:23:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:08,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:23:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:08,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:23:08,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:23:08,986 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:09,157 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-07-20 06:23:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:23:09,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-20 06:23:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:09,160 INFO L225 Difference]: With dead ends: 141 [2022-07-20 06:23:09,160 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 06:23:09,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:23:09,161 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 67 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:09,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 245 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:23:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 06:23:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 86. [2022-07-20 06:23:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-07-20 06:23:09,166 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 22 [2022-07-20 06:23:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:09,167 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-07-20 06:23:09,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-07-20 06:23:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:23:09,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:09,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:09,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:23:09,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash 951797021, now seen corresponding path program 1 times [2022-07-20 06:23:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:09,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159185065] [2022-07-20 06:23:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:23:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:23:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:09,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:09,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159185065] [2022-07-20 06:23:09,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159185065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:09,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:09,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:23:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782991092] [2022-07-20 06:23:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:09,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:23:09,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:09,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:23:09,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:23:09,332 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:09,459 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-07-20 06:23:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:23:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-20 06:23:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:09,462 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:23:09,462 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:23:09,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:23:09,463 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 231 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:09,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 231 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:23:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:23:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-07-20 06:23:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-07-20 06:23:09,467 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 22 [2022-07-20 06:23:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:09,468 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-07-20 06:23:09,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-07-20 06:23:09,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:23:09,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:09,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:09,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:23:09,469 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:09,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -389076539, now seen corresponding path program 1 times [2022-07-20 06:23:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:09,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793512010] [2022-07-20 06:23:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:23:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:23:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:23:09,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:09,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793512010] [2022-07-20 06:23:09,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793512010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:09,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276386442] [2022-07-20 06:23:09,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:09,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:23:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:23:09,634 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-20 06:23:09,655 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-20 06:23:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:09,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:23:09,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:09,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, 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-20 06:23:10,025 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:23:10,031 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 17 treesize of output 21 [2022-07-20 06:23:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:10,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:10,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276386442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:10,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:10,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-20 06:23:10,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680960218] [2022-07-20 06:23:10,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:10,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:23:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:23:10,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:23:10,112 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:23:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:10,259 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2022-07-20 06:23:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:23:10,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-20 06:23:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:10,261 INFO L225 Difference]: With dead ends: 138 [2022-07-20 06:23:10,261 INFO L226 Difference]: Without dead ends: 138 [2022-07-20 06:23:10,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:23:10,264 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 65 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:10,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 247 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 2 Unchecked, 0.1s Time] [2022-07-20 06:23:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-20 06:23:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 84. [2022-07-20 06:23:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.826086956521739) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-20 06:23:10,272 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 25 [2022-07-20 06:23:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:10,272 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-20 06:23:10,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:23:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-20 06:23:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:23:10,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:10,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:10,292 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-20 06:23:10,491 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,SelfDestructingSolverStorable5 [2022-07-20 06:23:10,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -389076538, now seen corresponding path program 1 times [2022-07-20 06:23:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:10,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725014474] [2022-07-20 06:23:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:10,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:23:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:23:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:10,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:10,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725014474] [2022-07-20 06:23:10,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725014474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:10,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700918886] [2022-07-20 06:23:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:10,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:23:10,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:23:10,692 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-20 06:23:10,693 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-20 06:23:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:10,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 06:23:10,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:10,782 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-20 06:23:10,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:10,978 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-20 06:23:10,993 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:23:10,993 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-20 06:23:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:23:11,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:11,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700918886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:11,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:11,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2022-07-20 06:23:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604918175] [2022-07-20 06:23:11,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:11,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 06:23:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:11,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 06:23:11,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-07-20 06:23:11,108 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:23:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:11,429 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-07-20 06:23:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:23:11,431 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-07-20 06:23:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:11,432 INFO L225 Difference]: With dead ends: 138 [2022-07-20 06:23:11,432 INFO L226 Difference]: Without dead ends: 138 [2022-07-20 06:23:11,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-07-20 06:23:11,433 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 372 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:11,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 286 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 558 Invalid, 0 Unknown, 3 Unchecked, 0.3s Time] [2022-07-20 06:23:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-20 06:23:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2022-07-20 06:23:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-07-20 06:23:11,436 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 25 [2022-07-20 06:23:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:11,436 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-07-20 06:23:11,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:23:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-07-20 06:23:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:23:11,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:11,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:11,469 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-20 06:23:11,637 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,SelfDestructingSolverStorable6 [2022-07-20 06:23:11,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:11,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:11,638 INFO L85 PathProgramCache]: Analyzing trace with hash 904455987, now seen corresponding path program 1 times [2022-07-20 06:23:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:11,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348297786] [2022-07-20 06:23:11,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:11,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:23:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:23:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:23:11,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348297786] [2022-07-20 06:23:11,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348297786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:11,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108700897] [2022-07-20 06:23:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:11,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:23:11,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:23:11,715 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-20 06:23:11,716 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-20 06:23:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:11,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:23:11,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:23:11,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:11,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108700897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:11,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:23:11,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-20 06:23:11,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032073188] [2022-07-20 06:23:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:11,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:23:11,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:11,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:23:11,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:23:11,827 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:11,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:11,836 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2022-07-20 06:23:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:23:11,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-07-20 06:23:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:11,838 INFO L225 Difference]: With dead ends: 138 [2022-07-20 06:23:11,838 INFO L226 Difference]: Without dead ends: 138 [2022-07-20 06:23:11,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:23:11,839 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 122 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:11,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 171 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:23:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-20 06:23:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 84. [2022-07-20 06:23:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-20 06:23:11,845 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 29 [2022-07-20 06:23:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:11,846 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-20 06:23:11,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-20 06:23:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:23:11,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:11,847 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:11,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:12,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:23:12,065 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash 904455976, now seen corresponding path program 1 times [2022-07-20 06:23:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:12,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053503762] [2022-07-20 06:23:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:12,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:23:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:12,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:23:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:23:12,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:12,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053503762] [2022-07-20 06:23:12,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053503762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:12,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509613727] [2022-07-20 06:23:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:12,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:23:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:23:12,181 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-20 06:23:12,195 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-20 06:23:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:12,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:23:12,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:12,322 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-20 06:23:12,338 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-20 06:23:12,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:12,408 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-20 06:23:12,418 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-20 06:23:12,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:12,500 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-20 06:23:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:23:12,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:12,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509613727] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:12,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:12,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2022-07-20 06:23:12,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131070240] [2022-07-20 06:23:12,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:12,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 06:23:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:23:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 06:23:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:23:12,551 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:23:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:12,798 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-07-20 06:23:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:23:12,798 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-07-20 06:23:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:12,799 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:23:12,799 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 06:23:12,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-07-20 06:23:12,799 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 145 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:12,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 321 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 354 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2022-07-20 06:23:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 06:23:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 80. [2022-07-20 06:23:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.6875) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-07-20 06:23:12,802 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 29 [2022-07-20 06:23:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:12,802 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-07-20 06:23:12,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:23:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-07-20 06:23:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:23:12,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:12,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:12,824 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-20 06:23:13,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:23:13,019 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash 904455977, now seen corresponding path program 1 times [2022-07-20 06:23:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:23:13,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222768649] [2022-07-20 06:23:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:23:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:23:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 06:23:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:23:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:23:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222768649] [2022-07-20 06:23:13,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222768649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484869783] [2022-07-20 06:23:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:13,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:23:13,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:23:13,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:23:13,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:23:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:13,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 06:23:13,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:13,292 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-20 06:23:13,308 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-20 06:23:13,398 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 06:23:13,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:13,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 06:23:13,630 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 54629 column 46: unknown constant v_#length_BEFORE_CALL_4 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) 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-20 06:23:13,634 INFO L158 Benchmark]: Toolchain (without parser) took 6453.07ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 76.0MB in the beginning and 114.8MB in the end (delta: -38.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-20 06:23:13,635 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:23:13,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.80ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 71.9MB in the end (delta: 4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 06:23:13,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.93ms. Allocated memory is still 104.9MB. Free memory was 71.9MB in the beginning and 69.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:23:13,635 INFO L158 Benchmark]: Boogie Preprocessor took 50.58ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 68.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:23:13,636 INFO L158 Benchmark]: RCFGBuilder took 447.35ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.1MB in the beginning and 100.4MB in the end (delta: -32.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2022-07-20 06:23:13,636 INFO L158 Benchmark]: TraceAbstraction took 5510.24ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 99.8MB in the beginning and 114.8MB in the end (delta: -15.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-07-20 06:23:13,637 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.80ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 71.9MB in the end (delta: 4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.93ms. Allocated memory is still 104.9MB. Free memory was 71.9MB in the beginning and 69.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.58ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 68.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.35ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.1MB in the beginning and 100.4MB in the end (delta: -32.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5510.24ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 99.8MB in the beginning and 114.8MB in the end (delta: -15.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 54629 column 46: unknown constant v_#length_BEFORE_CALL_4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 54629 column 46: unknown constant v_#length_BEFORE_CALL_4: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 06:23:13,648 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 1 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/list-simple/sll2c_remove_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:23:15,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:23:15,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:23:15,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:23:15,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:23:15,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:23:15,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:23:15,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:23:15,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:23:15,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:23:15,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:23:15,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:23:15,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:23:15,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:23:15,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:23:15,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:23:15,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:23:15,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:23:15,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:23:15,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:23:15,354 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:23:15,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:23:15,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:23:15,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:23:15,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:23:15,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:23:15,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:23:15,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:23:15,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:23:15,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:23:15,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:23:15,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:23:15,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:23:15,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:23:15,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:23:15,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:23:15,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:23:15,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:23:15,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:23:15,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:23:15,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:23:15,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:23:15,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:23:15,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:23:15,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:23:15,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:23:15,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:23:15,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:23:15,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:23:15,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:23:15,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:23:15,415 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:23:15,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:23:15,416 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:23:15,416 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:23:15,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:23:15,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:23:15,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:23:15,417 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:23:15,417 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:23:15,417 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:23:15,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:23:15,417 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:23:15,418 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:23:15,418 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:23:15,418 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:23:15,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:23:15,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:23:15,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:23:15,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:23:15,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:23:15,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:23:15,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:23:15,419 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:23:15,419 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:23:15,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:23:15,420 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2022-07-20 06:23:15,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:23:15,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:23:15,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:23:15,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:23:15,689 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:23:15,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2022-07-20 06:23:15,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2c072f4/e85b2aa0f53b4a3da2dd36980b820a94/FLAGf966c43b0 [2022-07-20 06:23:16,172 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:23:16,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2022-07-20 06:23:16,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2c072f4/e85b2aa0f53b4a3da2dd36980b820a94/FLAGf966c43b0 [2022-07-20 06:23:16,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2c072f4/e85b2aa0f53b4a3da2dd36980b820a94 [2022-07-20 06:23:16,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:23:16,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:23:16,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:23:16,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:23:16,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:23:16,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708322c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16, skipping insertion in model container [2022-07-20 06:23:16,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:23:16,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:23:16,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2022-07-20 06:23:16,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:23:16,473 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:23:16,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2022-07-20 06:23:16,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:23:16,551 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:23:16,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16 WrapperNode [2022-07-20 06:23:16,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:23:16,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:23:16,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:23:16,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:23:16,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,605 INFO L137 Inliner]: procedures = 129, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2022-07-20 06:23:16,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:23:16,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:23:16,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:23:16,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:23:16,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:23:16,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:23:16,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:23:16,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:23:16,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (1/1) ... [2022-07-20 06:23:16,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:23:16,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:23:16,657 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-20 06:23:16,673 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-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-20 06:23:16,690 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 06:23:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 06:23:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:23:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:23:16,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:23:16,761 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:23:16,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:23:17,109 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:23:17,113 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:23:17,114 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 06:23:17,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:23:17 BoogieIcfgContainer [2022-07-20 06:23:17,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:23:17,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:23:17,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:23:17,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:23:17,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:23:16" (1/3) ... [2022-07-20 06:23:17,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77151ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:23:17, skipping insertion in model container [2022-07-20 06:23:17,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:23:16" (2/3) ... [2022-07-20 06:23:17,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77151ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:23:17, skipping insertion in model container [2022-07-20 06:23:17,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:23:17" (3/3) ... [2022-07-20 06:23:17,120 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2022-07-20 06:23:17,129 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:23:17,129 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-07-20 06:23:17,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:23:17,168 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@639e6ac, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6cead13f [2022-07-20 06:23:17,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-07-20 06:23:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:23:17,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:17,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:23:17,181 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash 893736149, now seen corresponding path program 1 times [2022-07-20 06:23:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:17,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103753830] [2022-07-20 06:23:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:17,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:17,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:17,196 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-20 06:23:17,243 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-20 06:23:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:17,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:23:17,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:17,365 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-20 06:23:17,394 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-20 06:23:17,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:17,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:17,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103753830] [2022-07-20 06:23:17,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103753830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:17,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:17,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:23:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924753333] [2022-07-20 06:23:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:17,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:23:17,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:23:17,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:23:17,426 INFO L87 Difference]: Start difference. First operand has 93 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 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-20 06:23:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:17,596 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-07-20 06:23:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:23:17,599 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-20 06:23:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:17,605 INFO L225 Difference]: With dead ends: 91 [2022-07-20 06:23:17,605 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:23:17,606 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-20 06:23:17,611 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:17,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:23:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:23:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 06:23:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-07-20 06:23:17,652 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 6 [2022-07-20 06:23:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:17,652 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-07-20 06:23:17,653 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-20 06:23:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-07-20 06:23:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:23:17,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:17,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:23:17,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 06:23:17,860 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-20 06:23:17,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash 893736150, now seen corresponding path program 1 times [2022-07-20 06:23:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:17,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955184520] [2022-07-20 06:23:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:17,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:17,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:17,863 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-20 06:23:17,865 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-20 06:23:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:17,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:23:17,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:17,918 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-20 06:23:17,930 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-20 06:23:17,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:17,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:17,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955184520] [2022-07-20 06:23:17,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955184520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:17,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:17,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:23:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230217614] [2022-07-20 06:23:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:17,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:23:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:17,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:23:17,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:23:17,937 INFO L87 Difference]: Start difference. First operand 88 states and 92 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-20 06:23:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:18,068 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-07-20 06:23:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:23:18,068 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-20 06:23:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:18,069 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:23:18,069 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:23:18,070 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-20 06:23:18,070 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:18,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:23:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:23:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-20 06:23:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-07-20 06:23:18,076 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 6 [2022-07-20 06:23:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:18,077 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-07-20 06:23:18,077 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-20 06:23:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-07-20 06:23:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:23:18,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:18,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:18,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:18,285 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-20 06:23:18,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1919809879, now seen corresponding path program 1 times [2022-07-20 06:23:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:18,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431160374] [2022-07-20 06:23:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:18,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:18,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:18,291 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-20 06:23:18,319 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-20 06:23:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:18,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:23:18,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:18,372 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-20 06:23:18,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:18,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:18,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431160374] [2022-07-20 06:23:18,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431160374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:18,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:18,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:23:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925570066] [2022-07-20 06:23:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:18,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:23:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:23:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:23:18,379 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 06:23:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:18,387 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-07-20 06:23:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:23:18,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-07-20 06:23:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:18,388 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:23:18,388 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:23:18,389 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-20 06:23:18,389 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:18,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 173 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:23:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:23:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2022-07-20 06:23:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-07-20 06:23:18,396 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 13 [2022-07-20 06:23:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:18,396 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-07-20 06:23:18,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 06:23:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-07-20 06:23:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:23:18,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:18,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:18,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-20 06:23:18,612 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-20 06:23:18,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash 951797020, now seen corresponding path program 1 times [2022-07-20 06:23:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:18,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572249427] [2022-07-20 06:23:18,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:18,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:18,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:18,617 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-20 06:23:18,618 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-20 06:23:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:18,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:23:18,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:18,711 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-20 06:23:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:18,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:18,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:18,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572249427] [2022-07-20 06:23:18,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572249427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:18,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:18,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:23:18,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344426360] [2022-07-20 06:23:18,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:18,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:23:18,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:23:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:23:18,743 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:19,003 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-07-20 06:23:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:23:19,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-20 06:23:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:19,005 INFO L225 Difference]: With dead ends: 141 [2022-07-20 06:23:19,005 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 06:23:19,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:23:19,006 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 66 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:19,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 220 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:23:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 06:23:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 86. [2022-07-20 06:23:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-07-20 06:23:19,010 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 22 [2022-07-20 06:23:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:19,010 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-07-20 06:23:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-07-20 06:23:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:23:19,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:19,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:19,029 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-20 06:23:19,218 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-20 06:23:19,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:19,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash 951797021, now seen corresponding path program 1 times [2022-07-20 06:23:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:19,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995142297] [2022-07-20 06:23:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:19,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:19,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:19,223 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-20 06:23:19,224 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-20 06:23:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:19,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:23:19,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:19,317 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-20 06:23:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:19,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:19,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:19,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995142297] [2022-07-20 06:23:19,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995142297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:19,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:19,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:23:19,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098749302] [2022-07-20 06:23:19,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:19,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:23:19,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:19,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:23:19,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:23:19,397 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:19,641 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-07-20 06:23:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:23:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-20 06:23:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:19,643 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:23:19,643 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:23:19,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:23:19,644 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 76 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:19,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 206 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:23:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:23:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-07-20 06:23:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:23:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-07-20 06:23:19,647 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 22 [2022-07-20 06:23:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:19,647 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-07-20 06:23:19,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-07-20 06:23:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:23:19,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:19,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:19,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:19,855 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-20 06:23:19,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:19,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash -389076539, now seen corresponding path program 1 times [2022-07-20 06:23:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:19,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723597544] [2022-07-20 06:23:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:19,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:19,860 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-20 06:23:19,861 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-20 06:23:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:19,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:23:19,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:19,975 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-20 06:23:20,074 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:23:20,074 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 17 treesize of output 24 [2022-07-20 06:23:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:20,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:22,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:22,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723597544] [2022-07-20 06:23:22,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723597544] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:23:22,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:22,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-20 06:23:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377169220] [2022-07-20 06:23:22,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:22,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:23:22,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:22,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:23:22,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2022-07-20 06:23:22,291 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:23:22,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:22,602 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2022-07-20 06:23:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:23:22,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-20 06:23:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:22,604 INFO L225 Difference]: With dead ends: 145 [2022-07-20 06:23:22,604 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 06:23:22,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=34, Invalid=97, Unknown=1, NotChecked=0, Total=132 [2022-07-20 06:23:22,604 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:22,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 291 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2022-07-20 06:23:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 06:23:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2022-07-20 06:23:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 86 states have internal predecessors, (90), 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-20 06:23:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2022-07-20 06:23:22,609 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 25 [2022-07-20 06:23:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:22,609 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2022-07-20 06:23:22,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:23:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-07-20 06:23:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:23:22,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:22,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:22,617 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-20 06:23:22,810 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-20 06:23:22,810 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:22,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash -389076538, now seen corresponding path program 1 times [2022-07-20 06:23:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:22,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085985728] [2022-07-20 06:23:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:22,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:22,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:22,812 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-20 06:23:22,813 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-20 06:23:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:22,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:23:22,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:22,907 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-20 06:23:22,911 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-20 06:23:23,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:23,085 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-20 06:23:23,091 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:23:23,092 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-20 06:23:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:23:23,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:25,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:25,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085985728] [2022-07-20 06:23:25,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085985728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:25,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [85020287] [2022-07-20 06:23:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:25,354 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:23:25,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:23:25,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:23:25,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-20 06:23:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:25,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:23:25,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:25,522 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-20 06:23:25,527 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-20 06:23:27,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:27,639 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-20 06:23:27,648 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:23:27,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, 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-20 06:23:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:23:27,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:31,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [85020287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:31,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:31,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-20 06:23:31,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877869636] [2022-07-20 06:23:31,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:31,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:23:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:31,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:23:31,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2022-07-20 06:23:31,958 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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-20 06:23:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:32,638 INFO L93 Difference]: Finished difference Result 217 states and 228 transitions. [2022-07-20 06:23:32,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:23:32,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 25 [2022-07-20 06:23:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:32,640 INFO L225 Difference]: With dead ends: 217 [2022-07-20 06:23:32,640 INFO L226 Difference]: Without dead ends: 217 [2022-07-20 06:23:32,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2022-07-20 06:23:32,641 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 123 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:32,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 267 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 119 Unchecked, 0.6s Time] [2022-07-20 06:23:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-20 06:23:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 97. [2022-07-20 06:23:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:23:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-07-20 06:23:32,645 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 25 [2022-07-20 06:23:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:32,645 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-07-20 06:23:32,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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-20 06:23:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-07-20 06:23:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:23:32,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:32,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:32,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-07-20 06:23:32,866 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-20 06:23:33,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:33,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 904455987, now seen corresponding path program 1 times [2022-07-20 06:23:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:33,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677738316] [2022-07-20 06:23:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:33,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:33,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:33,049 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-20 06:23:33,050 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-20 06:23:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:33,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:23:33,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:23:33,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:33,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:33,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677738316] [2022-07-20 06:23:33,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677738316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:33,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:33,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:23:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758628147] [2022-07-20 06:23:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:33,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:23:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:23:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:23:33,179 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:33,197 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-07-20 06:23:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:23:33,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-07-20 06:23:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:33,198 INFO L225 Difference]: With dead ends: 152 [2022-07-20 06:23:33,198 INFO L226 Difference]: Without dead ends: 152 [2022-07-20 06:23:33,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:23:33,198 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 179 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:33,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 164 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:23:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-20 06:23:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 98. [2022-07-20 06:23:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:23:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-07-20 06:23:33,207 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 29 [2022-07-20 06:23:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:33,207 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-07-20 06:23:33,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-07-20 06:23:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:23:33,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:33,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:33,215 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-20 06:23:33,409 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-20 06:23:33,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:33,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash 904455976, now seen corresponding path program 1 times [2022-07-20 06:23:33,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:33,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745515628] [2022-07-20 06:23:33,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:33,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:33,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:33,411 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-20 06:23:33,413 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-20 06:23:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:33,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:23:33,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:33,529 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-20 06:23:33,606 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:23:33,606 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 21 [2022-07-20 06:23:33,708 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:23:33,709 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 18 treesize of output 27 [2022-07-20 06:23:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:33,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:34,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:34,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745515628] [2022-07-20 06:23:34,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745515628] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:23:34,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:34,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-20 06:23:34,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460278036] [2022-07-20 06:23:34,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:34,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:23:34,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:34,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:23:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:23:34,274 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:23:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:34,544 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-07-20 06:23:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:23:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-07-20 06:23:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:34,546 INFO L225 Difference]: With dead ends: 134 [2022-07-20 06:23:34,546 INFO L226 Difference]: Without dead ends: 134 [2022-07-20 06:23:34,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:23:34,546 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 186 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:34,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 273 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 124 Invalid, 0 Unknown, 221 Unchecked, 0.2s Time] [2022-07-20 06:23:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-20 06:23:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2022-07-20 06:23:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:23:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-07-20 06:23:34,551 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 29 [2022-07-20 06:23:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:34,551 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-07-20 06:23:34,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:23:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-07-20 06:23:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:23:34,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:34,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:34,573 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-20 06:23:34,752 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-20 06:23:34,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash 904455977, now seen corresponding path program 1 times [2022-07-20 06:23:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:34,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063169467] [2022-07-20 06:23:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:34,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:34,754 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-20 06:23:34,756 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-20 06:23:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:34,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:23:34,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:34,935 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-20 06:23:34,938 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-20 06:23:37,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:37,027 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-20 06:23:37,035 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:23:37,035 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-20 06:23:39,113 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:23:39,114 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-20 06:23:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:23:39,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:39,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063169467] [2022-07-20 06:23:39,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063169467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1423227761] [2022-07-20 06:23:39,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:39,540 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:23:39,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:23:39,541 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:23:39,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-20 06:23:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:39,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:23:39,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:39,708 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-20 06:23:39,768 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-20 06:23:41,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:41,898 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-20 06:23:41,958 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-20 06:23:44,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:23:44,096 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-20 06:23:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:23:44,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:44,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1423227761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:23:44,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:44,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2022-07-20 06:23:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956592353] [2022-07-20 06:23:44,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:44,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 06:23:44,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:44,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 06:23:44,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=349, Unknown=4, NotChecked=0, Total=420 [2022-07-20 06:23:44,488 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 17 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (4), 4 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-20 06:23:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:45,511 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-07-20 06:23:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:23:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (4), 4 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 29 [2022-07-20 06:23:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:45,512 INFO L225 Difference]: With dead ends: 130 [2022-07-20 06:23:45,512 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:23:45,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=110, Invalid=642, Unknown=4, NotChecked=0, Total=756 [2022-07-20 06:23:45,513 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:45,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 582 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 284 Unchecked, 0.4s Time] [2022-07-20 06:23:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:23:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2022-07-20 06:23:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 80 states have (on average 1.4625) internal successors, (117), 109 states have internal predecessors, (117), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:23:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2022-07-20 06:23:45,518 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 29 [2022-07-20 06:23:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:45,519 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2022-07-20 06:23:45,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (4), 4 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-20 06:23:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2022-07-20 06:23:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:23:45,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:45,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:45,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:45,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-20 06:23:45,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:45,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2026635805, now seen corresponding path program 1 times [2022-07-20 06:23:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846551105] [2022-07-20 06:23:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:45,946 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-20 06:23:45,947 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-20 06:23:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:46,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:23:46,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:46,075 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-20 06:23:46,164 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 17 treesize of output 9 [2022-07-20 06:23:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:46,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:46,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:46,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846551105] [2022-07-20 06:23:46,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846551105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:46,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:46,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:23:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174957642] [2022-07-20 06:23:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:46,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:23:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:46,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:23:46,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:23:46,177 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:46,881 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2022-07-20 06:23:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:23:46,882 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 06:23:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:46,883 INFO L225 Difference]: With dead ends: 157 [2022-07-20 06:23:46,883 INFO L226 Difference]: Without dead ends: 157 [2022-07-20 06:23:46,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:23:46,883 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 201 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:46,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 376 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:23:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-20 06:23:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 119. [2022-07-20 06:23:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 110 states have internal predecessors, (119), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:23:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2022-07-20 06:23:46,888 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2022-07-20 06:23:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:46,888 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2022-07-20 06:23:46,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2022-07-20 06:23:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:23:46,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:46,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:46,900 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-20 06:23:47,094 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-20 06:23:47,095 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2026635804, now seen corresponding path program 1 times [2022-07-20 06:23:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:47,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801437133] [2022-07-20 06:23:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:47,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:47,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:47,097 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-20 06:23:47,098 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-20 06:23:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:47,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 06:23:47,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:47,221 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-20 06:23:47,350 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 17 treesize of output 9 [2022-07-20 06:23:47,353 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 15 treesize of output 7 [2022-07-20 06:23:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:47,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:47,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:47,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801437133] [2022-07-20 06:23:47,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801437133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:47,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:47,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:23:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751759130] [2022-07-20 06:23:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:47,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:23:47,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:47,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:23:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:23:47,373 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:48,373 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2022-07-20 06:23:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:23:48,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 06:23:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:48,377 INFO L225 Difference]: With dead ends: 151 [2022-07-20 06:23:48,378 INFO L226 Difference]: Without dead ends: 151 [2022-07-20 06:23:48,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:23:48,379 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 366 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:48,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 289 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 06:23:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-20 06:23:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 119. [2022-07-20 06:23:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 110 states have internal predecessors, (118), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:23:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2022-07-20 06:23:48,391 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2022-07-20 06:23:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:48,391 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2022-07-20 06:23:48,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2022-07-20 06:23:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:23:48,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:48,392 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:23:48,401 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-20 06:23:48,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:48,602 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1976823067, now seen corresponding path program 1 times [2022-07-20 06:23:48,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:48,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402177550] [2022-07-20 06:23:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:48,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:48,606 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:23:48,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 06:23:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:48,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:23:48,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:23:48,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:48,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:48,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402177550] [2022-07-20 06:23:48,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402177550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:48,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:48,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:23:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195553243] [2022-07-20 06:23:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:48,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:23:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:48,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:23:48,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:23:48,763 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:48,861 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-07-20 06:23:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:23:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-07-20 06:23:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:48,862 INFO L225 Difference]: With dead ends: 112 [2022-07-20 06:23:48,862 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 06:23:48,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:23:48,862 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 151 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:48,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 83 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:23:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 06:23:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-20 06:23:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 103 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:23:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2022-07-20 06:23:48,865 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 32 [2022-07-20 06:23:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:48,865 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2022-07-20 06:23:48,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2022-07-20 06:23:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:23:48,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:48,865 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:23:48,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:49,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:49,066 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:49,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1055563858, now seen corresponding path program 1 times [2022-07-20 06:23:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:49,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733908159] [2022-07-20 06:23:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:49,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:49,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:49,068 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-20 06:23:49,071 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-20 06:23:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:49,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:23:49,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:49,374 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 15 treesize of output 7 [2022-07-20 06:23:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:49,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:49,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:49,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733908159] [2022-07-20 06:23:49,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733908159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:49,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:49,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:23:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391506046] [2022-07-20 06:23:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:49,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:23:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:23:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:23:49,414 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:50,167 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-07-20 06:23:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:23:50,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-07-20 06:23:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:50,168 INFO L225 Difference]: With dead ends: 161 [2022-07-20 06:23:50,169 INFO L226 Difference]: Without dead ends: 161 [2022-07-20 06:23:50,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:23:50,169 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 382 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:50,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 368 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:23:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-20 06:23:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 124. [2022-07-20 06:23:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 115 states have internal predecessors, (132), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:23:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2022-07-20 06:23:50,172 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 35 [2022-07-20 06:23:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:50,172 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2022-07-20 06:23:50,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-07-20 06:23:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:23:50,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:50,173 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:23:50,185 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-20 06:23:50,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:50,374 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:50,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:50,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1636827734, now seen corresponding path program 1 times [2022-07-20 06:23:50,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:50,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077822358] [2022-07-20 06:23:50,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:50,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:50,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:50,377 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:23:50,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 06:23:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:50,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:23:50,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:50,507 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-20 06:23:50,622 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 17 treesize of output 9 [2022-07-20 06:23:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:50,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:50,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:50,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077822358] [2022-07-20 06:23:50,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077822358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:50,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:50,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:23:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973106871] [2022-07-20 06:23:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:50,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:23:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:50,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:23:50,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:23:50,655 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:51,566 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2022-07-20 06:23:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:23:51,567 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-07-20 06:23:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:51,568 INFO L225 Difference]: With dead ends: 153 [2022-07-20 06:23:51,568 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 06:23:51,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:23:51,569 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 183 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:51,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 331 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 06:23:51,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 06:23:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2022-07-20 06:23:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.393939393939394) internal successors, (138), 119 states have internal predecessors, (138), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:23:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2022-07-20 06:23:51,571 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 36 [2022-07-20 06:23:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:51,571 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2022-07-20 06:23:51,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2022-07-20 06:23:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:23:51,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:51,572 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:23:51,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:51,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:51,780 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1636827733, now seen corresponding path program 1 times [2022-07-20 06:23:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:51,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655701871] [2022-07-20 06:23:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:51,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:51,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:51,782 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-20 06:23:51,784 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-20 06:23:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:51,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:23:51,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:51,903 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-20 06:23:52,068 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 17 treesize of output 9 [2022-07-20 06:23:52,071 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 15 treesize of output 7 [2022-07-20 06:23:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:52,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:52,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:52,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655701871] [2022-07-20 06:23:52,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655701871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:52,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:52,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:23:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111457474] [2022-07-20 06:23:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:52,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:23:52,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:52,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:23:52,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:23:52,114 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:53,130 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2022-07-20 06:23:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:23:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-07-20 06:23:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:53,140 INFO L225 Difference]: With dead ends: 171 [2022-07-20 06:23:53,140 INFO L226 Difference]: Without dead ends: 171 [2022-07-20 06:23:53,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:23:53,155 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 368 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:53,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 357 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 06:23:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-20 06:23:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2022-07-20 06:23:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 123 states have internal predecessors, (142), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:23:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2022-07-20 06:23:53,162 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 36 [2022-07-20 06:23:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:53,162 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2022-07-20 06:23:53,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2022-07-20 06:23:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:23:53,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:53,163 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:23:53,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:53,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:53,371 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1637258683, now seen corresponding path program 1 times [2022-07-20 06:23:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:53,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162250935] [2022-07-20 06:23:53,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:53,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:53,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:53,374 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:23:53,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 06:23:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:53,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 06:23:53,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:54,043 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 15 treesize of output 7 [2022-07-20 06:23:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:23:54,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:54,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:54,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162250935] [2022-07-20 06:23:54,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162250935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:54,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:54,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:23:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418555708] [2022-07-20 06:23:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:54,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 06:23:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:54,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 06:23:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:23:54,114 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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-20 06:23:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:54,185 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2022-07-20 06:23:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:23:54,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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 36 [2022-07-20 06:23:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:54,186 INFO L225 Difference]: With dead ends: 145 [2022-07-20 06:23:54,186 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 06:23:54,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:23:54,186 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:54,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 488 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 137 Unchecked, 0.0s Time] [2022-07-20 06:23:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 06:23:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2022-07-20 06:23:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 126 states have internal predecessors, (145), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:23:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2022-07-20 06:23:54,189 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 36 [2022-07-20 06:23:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:54,189 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2022-07-20 06:23:54,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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-20 06:23:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2022-07-20 06:23:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:23:54,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:54,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:23:54,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:54,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:23:54,398 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:54,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash -483056332, now seen corresponding path program 2 times [2022-07-20 06:23:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:54,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843486219] [2022-07-20 06:23:54,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:23:54,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:54,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:54,400 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-20 06:23:54,403 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-20 06:23:54,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:23:54,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:23:54,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:23:54,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:23:54,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:23:54,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:54,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843486219] [2022-07-20 06:23:54,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843486219] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:23:54,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:54,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 06:23:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111026038] [2022-07-20 06:23:54,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:54,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:23:54,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:54,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:23:54,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:23:54,645 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 06:23:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:54,674 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-07-20 06:23:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:23:54,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-07-20 06:23:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:54,675 INFO L225 Difference]: With dead ends: 104 [2022-07-20 06:23:54,675 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 06:23:54,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:23:54,677 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 165 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:54,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:23:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 06:23:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-20 06:23:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.4125) internal successors, (113), 99 states have internal predecessors, (113), 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-20 06:23:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-07-20 06:23:54,680 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 37 [2022-07-20 06:23:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:54,680 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-07-20 06:23:54,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 06:23:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-07-20 06:23:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:23:54,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:54,681 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:23:54,698 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-20 06:23:54,889 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-20 06:23:54,889 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 784588468, now seen corresponding path program 1 times [2022-07-20 06:23:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:54,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113529332] [2022-07-20 06:23:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:54,892 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-20 06:23:54,908 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-20 06:23:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:55,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:23:55,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:55,056 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-20 06:23:55,167 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 17 treesize of output 9 [2022-07-20 06:23:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:55,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:55,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:55,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113529332] [2022-07-20 06:23:55,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113529332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:55,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:55,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:23:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698928050] [2022-07-20 06:23:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:55,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:23:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:55,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:23:55,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:23:55,189 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:55,942 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-07-20 06:23:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:23:55,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-07-20 06:23:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:55,944 INFO L225 Difference]: With dead ends: 122 [2022-07-20 06:23:55,944 INFO L226 Difference]: Without dead ends: 122 [2022-07-20 06:23:55,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:23:55,944 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 132 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:55,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 316 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:23:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-20 06:23:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2022-07-20 06:23:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 100 states have internal predecessors, (114), 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-20 06:23:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2022-07-20 06:23:55,946 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 37 [2022-07-20 06:23:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:55,946 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2022-07-20 06:23:55,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:23:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2022-07-20 06:23:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:23:55,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:55,947 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:23:55,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 06:23:56,147 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-20 06:23:56,149 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1447561176, now seen corresponding path program 1 times [2022-07-20 06:23:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:56,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239381647] [2022-07-20 06:23:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:56,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:56,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:56,151 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-20 06:23:56,152 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-20 06:23:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:56,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 06:23:56,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:56,296 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-20 06:23:56,391 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:23:56,391 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-20 06:23:56,443 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-20 06:23:56,528 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:23:56,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-20 06:23:56,661 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 28 treesize of output 20 [2022-07-20 06:23:56,855 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:23:56,856 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-07-20 06:23:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:23:56,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:23:57,059 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 29 treesize of output 21 [2022-07-20 06:23:57,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2022-07-20 06:23:57,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-20 06:23:57,141 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:23:57,141 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-20 06:23:57,146 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 33 treesize of output 25 [2022-07-20 06:23:57,150 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-20 06:23:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:23:57,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:57,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239381647] [2022-07-20 06:23:57,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239381647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:23:57,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:23:57,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2022-07-20 06:23:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373227561] [2022-07-20 06:23:57,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:23:57,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:23:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:57,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:23:57,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=697, Unknown=2, NotChecked=106, Total=870 [2022-07-20 06:23:57,493 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:23:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:23:59,069 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-07-20 06:23:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:23:59,069 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-07-20 06:23:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:23:59,070 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:23:59,070 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:23:59,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=134, Invalid=1278, Unknown=2, NotChecked=146, Total=1560 [2022-07-20 06:23:59,071 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:23:59,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1047 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 642 Invalid, 0 Unknown, 157 Unchecked, 1.0s Time] [2022-07-20 06:23:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:23:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-20 06:23:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.353846153846154) internal successors, (88), 84 states have internal predecessors, (88), 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-20 06:23:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-07-20 06:23:59,073 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 38 [2022-07-20 06:23:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:23:59,073 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-07-20 06:23:59,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:23:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-07-20 06:23:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:23:59,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:23:59,073 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:23:59,083 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-20 06:23:59,279 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-20 06:23:59,280 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:23:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:23:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -306294352, now seen corresponding path program 1 times [2022-07-20 06:23:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:23:59,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509164052] [2022-07-20 06:23:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:23:59,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:23:59,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:23:59,283 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-20 06:23:59,284 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-20 06:23:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:23:59,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:23:59,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:23:59,944 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-20 06:23:59,944 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 55 [2022-07-20 06:23:59,949 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:23:59,949 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 31 [2022-07-20 06:23:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:23:59,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:23:59,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:23:59,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509164052] [2022-07-20 06:23:59,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509164052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:23:59,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:23:59,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-20 06:23:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214293530] [2022-07-20 06:23:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:23:59,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 06:23:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:23:59,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 06:23:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:23:59,985 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:01,097 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-07-20 06:24:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:24:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-07-20 06:24:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:01,098 INFO L225 Difference]: With dead ends: 109 [2022-07-20 06:24:01,098 INFO L226 Difference]: Without dead ends: 109 [2022-07-20 06:24:01,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 06:24:01,099 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 285 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:01,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 664 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:24:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-20 06:24:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2022-07-20 06:24:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.34375) internal successors, (86), 83 states have internal predecessors, (86), 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-20 06:24:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2022-07-20 06:24:01,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 41 [2022-07-20 06:24:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:01,101 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2022-07-20 06:24:01,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:24:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2022-07-20 06:24:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:24:01,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:01,101 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:24:01,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-20 06:24:01,301 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-20 06:24:01,302 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:24:01,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:01,302 INFO L85 PathProgramCache]: Analyzing trace with hash -306241737, now seen corresponding path program 1 times [2022-07-20 06:24:01,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:24:01,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954707580] [2022-07-20 06:24:01,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:01,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:24:01,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:24:01,304 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-20 06:24:01,305 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-20 06:24:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:01,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-20 06:24:01,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:01,477 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-20 06:24:01,551 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:01,551 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-20 06:24:01,588 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-20 06:24:01,679 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:01,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:24:01,949 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 45 treesize of output 33 [2022-07-20 06:24:02,104 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:24:02,105 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 25 [2022-07-20 06:24:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:02,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:02,390 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 28 treesize of output 20 [2022-07-20 06:24:02,587 INFO L356 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2022-07-20 06:24:02,588 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 28 treesize of output 27 [2022-07-20 06:24:02,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_939))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-07-20 06:24:02,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_939))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) is different from false [2022-07-20 06:24:02,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:02,630 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2022-07-20 06:24:02,705 INFO L356 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2022-07-20 06:24:02,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 120 [2022-07-20 06:24:02,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:02,722 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 93 treesize of output 87 [2022-07-20 06:24:03,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:24:03,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954707580] [2022-07-20 06:24:03,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954707580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:03,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125822800] [2022-07-20 06:24:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:03,253 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:24:03,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:24:03,254 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-20 06:24:03,266 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-20 06:24:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:03,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:24:03,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:03,527 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-20 06:24:03,825 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:24:03,826 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 17 treesize of output 24 [2022-07-20 06:24:04,038 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-20 06:24:04,278 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:04,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-20 06:24:04,873 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 55 treesize of output 39 [2022-07-20 06:24:05,122 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:05,122 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 28 [2022-07-20 06:24:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:05,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:05,430 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 28 treesize of output 20 [2022-07-20 06:24:05,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_986))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (bvadd (select |c_#valid| (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1)))))) is different from false [2022-07-20 06:24:05,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_986))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (_ bv1 1))))))) is different from false [2022-07-20 06:24:05,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:05,756 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2022-07-20 06:24:05,877 INFO L356 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2022-07-20 06:24:05,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 136 [2022-07-20 06:24:05,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:05,905 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 109 treesize of output 103 [2022-07-20 06:24:21,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1125822800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:21,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:24:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2022-07-20 06:24:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705539206] [2022-07-20 06:24:21,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:24:21,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 06:24:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:24:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 06:24:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2286, Unknown=8, NotChecked=396, Total=2862 [2022-07-20 06:24:21,746 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 33 states have internal predecessors, (67), 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-20 06:24:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:24:24,027 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-07-20 06:24:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:24:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 33 states have internal predecessors, (67), 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 41 [2022-07-20 06:24:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:24:24,028 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:24:24,028 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:24:24,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=301, Invalid=2899, Unknown=8, NotChecked=452, Total=3660 [2022-07-20 06:24:24,029 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:24:24,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 866 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 814 Invalid, 0 Unknown, 171 Unchecked, 1.5s Time] [2022-07-20 06:24:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:24:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-20 06:24:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 85 states have internal predecessors, (89), 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-20 06:24:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-07-20 06:24:24,031 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 41 [2022-07-20 06:24:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:24:24,031 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-07-20 06:24:24,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 33 states have internal predecessors, (67), 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-20 06:24:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-07-20 06:24:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:24:24,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:24:24,031 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:24:24,040 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-20 06:24:24,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-07-20 06:24:24,442 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-20 06:24:24,442 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:24:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:24:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -306241736, now seen corresponding path program 1 times [2022-07-20 06:24:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:24:24,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235865281] [2022-07-20 06:24:24,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:24,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:24:24,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:24:24,444 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-20 06:24:24,446 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-20 06:24:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:24,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 06:24:24,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:24,649 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-20 06:24:24,656 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-20 06:24:24,885 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:24,885 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-20 06:24:24,892 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-20 06:24:24,976 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-20 06:24:24,994 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-20 06:24:25,131 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:25,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:24:25,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:24:25,487 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-20 06:24:25,487 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 51 [2022-07-20 06:24:25,492 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:24:25,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2022-07-20 06:24:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:25,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:26,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (let ((.cse4 (select (select .cse5 .cse0) .cse3))) (let ((.cse1 (bvadd (_ bv4 32) .cse4))) (and (bvule .cse1 (select |c_#length| (select (select .cse2 .cse0) .cse3))) (bvule .cse4 .cse1)))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-07-20 06:24:27,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038))) (let ((.cse3 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse4 (select (select .cse5 .cse2) .cse3))) (let ((.cse0 (bvadd (_ bv4 32) .cse4))) (and (bvule .cse0 (select |c_#length| (select (select .cse1 .cse2) .cse3))) (bvule .cse4 .cse0)))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-07-20 06:24:27,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:27,177 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 173 [2022-07-20 06:24:27,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:27,186 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 117 [2022-07-20 06:24:27,287 INFO L356 Elim1Store]: treesize reduction 28, result has 67.1 percent of original size [2022-07-20 06:24:27,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 313 treesize of output 306 [2022-07-20 06:24:27,759 INFO L356 Elim1Store]: treesize reduction 140, result has 43.8 percent of original size [2022-07-20 06:24:27,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 744 treesize of output 658 [2022-07-20 06:24:27,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:27,909 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 576 treesize of output 536 [2022-07-20 06:24:28,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:28,012 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 520 treesize of output 486 [2022-07-20 06:24:34,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:24:34,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235865281] [2022-07-20 06:24:34,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235865281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:24:34,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2052757499] [2022-07-20 06:24:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:24:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:24:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:24:34,695 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-20 06:24:34,696 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-20 06:24:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:24:34,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-20 06:24:34,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:24:35,040 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-20 06:24:35,044 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-20 06:24:35,552 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:35,552 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-20 06:24:35,564 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-20 06:24:35,774 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-20 06:24:35,781 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-20 06:24:35,994 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:24:35,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:24:35,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:24:37,218 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:24:37,218 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-07-20 06:24:37,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-20 06:24:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:24:37,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:24:38,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_1092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1091)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1092))) (let ((.cse0 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (let ((.cse2 (select (select .cse5 .cse0) .cse1))) (let ((.cse3 (bvadd (_ bv4 32) .cse2))) (and (bvule .cse2 .cse3) (bvule .cse3 (select |c_#length| (select (select .cse4 .cse0) .cse1)))))))))) is different from false [2022-07-20 06:24:38,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_1092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1092)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1091))) (let ((.cse0 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (let ((.cse1 (select (select .cse5 .cse4) .cse0))) (let ((.cse2 (bvadd (_ bv4 32) .cse1))) (and (bvule .cse1 .cse2) (bvule .cse2 (select |c_#length| (select (select .cse3 .cse4) .cse0)))))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-07-20 06:24:38,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:38,502 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 173 [2022-07-20 06:24:38,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:38,513 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 117 [2022-07-20 06:24:38,701 INFO L356 Elim1Store]: treesize reduction 21, result has 73.1 percent of original size [2022-07-20 06:24:38,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 306 treesize of output 306 [2022-07-20 06:24:39,574 INFO L356 Elim1Store]: treesize reduction 67, result has 64.0 percent of original size [2022-07-20 06:24:39,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 744 treesize of output 674 [2022-07-20 06:24:39,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:39,721 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 611 treesize of output 567 [2022-07-20 06:24:39,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:24:39,883 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 533 treesize of output 497 [2022-07-20 06:25:50,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2052757499] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:25:50,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:25:50,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 38 [2022-07-20 06:25:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724533412] [2022-07-20 06:25:50,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:25:50,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-20 06:25:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:25:50,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-20 06:25:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2484, Unknown=4, NotChecked=412, Total=3080 [2022-07-20 06:25:50,969 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 39 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 34 states have internal predecessors, (65), 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-20 06:25:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:25:55,451 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-07-20 06:25:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:25:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 34 states have internal predecessors, (65), 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 41 [2022-07-20 06:25:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:25:55,453 INFO L225 Difference]: With dead ends: 124 [2022-07-20 06:25:55,453 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 06:25:55,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=445, Invalid=3857, Unknown=4, NotChecked=524, Total=4830 [2022-07-20 06:25:55,454 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 284 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:25:55,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 890 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 945 Invalid, 0 Unknown, 246 Unchecked, 2.0s Time] [2022-07-20 06:25:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 06:25:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2022-07-20 06:25:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 89 states have internal predecessors, (93), 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-20 06:25:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-07-20 06:25:55,456 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 41 [2022-07-20 06:25:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:25:55,456 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-07-20 06:25:55,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 34 states have internal predecessors, (65), 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-20 06:25:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-07-20 06:25:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:25:55,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:25:55,456 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:25:55,460 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-20 06:25:55,668 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-20 06:25:55,860 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-20 06:25:55,860 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:25:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:25:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash 408363075, now seen corresponding path program 1 times [2022-07-20 06:25:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:25:55,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16200040] [2022-07-20 06:25:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:25:55,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:25:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:25:55,862 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-20 06:25:55,864 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-20 06:25:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:25:56,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 06:25:56,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:25:56,099 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-20 06:25:56,272 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:25:56,272 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-20 06:25:56,368 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-20 06:25:56,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:25:56,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-20 06:25:57,164 INFO L356 Elim1Store]: treesize reduction 163, result has 11.4 percent of original size [2022-07-20 06:25:57,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 43 [2022-07-20 06:25:57,212 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 15 treesize of output 7 [2022-07-20 06:25:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:25:57,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:25:59,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:01,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem14#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:03,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:05,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:07,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:09,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem8#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) is different from false [2022-07-20 06:26:11,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.offset|))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:13,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31|) .cse0 .cse0))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:15,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_31|) .cse0 .cse0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:15,384 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 48 treesize of output 36 [2022-07-20 06:26:15,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:15,890 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 69 [2022-07-20 06:26:16,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:16,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1066 treesize of output 944 [2022-07-20 06:26:16,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:16,078 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 1054 treesize of output 926 [2022-07-20 06:26:19,409 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 1014 treesize of output 990 [2022-07-20 06:26:20,448 INFO L356 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-07-20 06:26:20,449 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 335 treesize of output 311 [2022-07-20 06:26:21,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:21,402 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 282 [2022-07-20 06:26:26,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:26:26,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16200040] [2022-07-20 06:26:26,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16200040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:26,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [44828733] [2022-07-20 06:26:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:26,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:26:26,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:26:26,381 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:26:26,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-20 06:26:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:26,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:26:26,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:26,801 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-20 06:26:27,332 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:26:27,332 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-20 06:26:27,618 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-20 06:26:27,925 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:26:27,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:26:29,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:26:29,078 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-20 06:26:29,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 24 [2022-07-20 06:26:29,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:29,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:26:29,462 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 15 treesize of output 7 [2022-07-20 06:26:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:29,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:29,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| v_ArrVal_1202) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:29,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem14#1.base| v_ArrVal_1202) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:29,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) v_ArrVal_1202) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:29,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.offset|) v_ArrVal_1202) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:26:29,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) v_ArrVal_1202) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) is different from false [2022-07-20 06:26:29,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_ArrVal_1202) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-07-20 06:26:29,540 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 54 treesize of output 38 [2022-07-20 06:26:29,544 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 17 treesize of output 15 [2022-07-20 06:26:29,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1201 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1201))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (= (_ bv0 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select .cse0 .cse1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (not (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) is different from false [2022-07-20 06:26:29,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1201 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1201))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32))))))) is different from false [2022-07-20 06:26:29,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:29,787 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 42 [2022-07-20 06:26:29,861 INFO L356 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2022-07-20 06:26:29,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 128 [2022-07-20 06:26:29,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:26:29,876 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 101 treesize of output 95 [2022-07-20 06:26:30,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [44828733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:30,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:26:30,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 45 [2022-07-20 06:26:30,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724496100] [2022-07-20 06:26:30,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:30,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-20 06:26:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:26:30,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-20 06:26:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=3189, Unknown=36, NotChecked=2210, Total=5700 [2022-07-20 06:26:30,845 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 46 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 40 states have internal predecessors, (76), 4 states have call successors, (4), 3 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-20 06:26:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:33,669 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-07-20 06:26:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 06:26:33,670 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 40 states have internal predecessors, (76), 4 states have call successors, (4), 3 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 46 [2022-07-20 06:26:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:33,670 INFO L225 Difference]: With dead ends: 96 [2022-07-20 06:26:33,670 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 06:26:33,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=452, Invalid=6057, Unknown=39, NotChecked=2958, Total=9506 [2022-07-20 06:26:33,673 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:33,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1082 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 216 Unchecked, 0.7s Time] [2022-07-20 06:26:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 06:26:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-20 06:26:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 91 states have internal predecessors, (95), 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-20 06:26:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2022-07-20 06:26:33,675 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 46 [2022-07-20 06:26:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:33,676 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2022-07-20 06:26:33,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 40 states have internal predecessors, (76), 4 states have call successors, (4), 3 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-20 06:26:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-07-20 06:26:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:26:33,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:33,677 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-20 06:26:33,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:33,889 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-20 06:26:34,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:26:34,088 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:26:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash 408415690, now seen corresponding path program 2 times [2022-07-20 06:26:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:26:34,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719212161] [2022-07-20 06:26:34,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:26:34,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:26:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:26:34,090 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:26:34,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-20 06:26:34,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:26:34,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:26:34,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 06:26:34,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:34,406 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-20 06:26:34,414 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-20 06:26:34,478 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 06:26:34,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2022-07-20 06:26:34,491 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:26:34,491 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 27 treesize of output 22 [2022-07-20 06:26:35,467 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-07-20 06:26:35,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 84 [2022-07-20 06:26:35,483 INFO L356 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-07-20 06:26:35,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 34 [2022-07-20 06:26:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:26:35,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:53,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:55,287 INFO L356 Elim1Store]: treesize reduction 1963, result has 42.5 percent of original size [2022-07-20 06:26:55,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 55 case distinctions, treesize of input 23478 treesize of output 20685