./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:01:00,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:01:00,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:01:00,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:01:00,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:01:00,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:01:00,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:01:00,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:01:00,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:01:00,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:01:00,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:01:00,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:01:00,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:01:00,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:01:00,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:01:00,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:01:00,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:01:00,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:01:00,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:01:00,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:01:00,521 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:01:00,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:01:00,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:01:00,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:01:00,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:01:00,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:01:00,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:01:00,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:01:00,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:01:00,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:01:00,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:01:00,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:01:00,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:01:00,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:01:00,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:01:00,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:01:00,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:01:00,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:01:00,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:01:00,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:01:00,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:01:00,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:01:00,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:01:00,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:01:00,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:01:00,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:01:00,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:01:00,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:01:00,559 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:01:00,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:01:00,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:01:00,559 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:01:00,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:01:00,560 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:01:00,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:01:00,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:01:00,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:01:00,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:01:00,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:01:00,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:01:00,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:01:00,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:01:00,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:01:00,562 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2022-07-23 06:01:00,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:01:00,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:01:00,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:01:00,781 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:01:00,782 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:01:00,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-23 06:01:00,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3128629/80a4098415df4506b059500fd62b848a/FLAGa9a0bdffe [2022-07-23 06:01:01,297 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:01:01,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-23 06:01:01,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3128629/80a4098415df4506b059500fd62b848a/FLAGa9a0bdffe [2022-07-23 06:01:01,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3128629/80a4098415df4506b059500fd62b848a [2022-07-23 06:01:01,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:01:01,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:01:01,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:01:01,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:01:01,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:01:01,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:01:01" (1/1) ... [2022-07-23 06:01:01,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668cc191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:01, skipping insertion in model container [2022-07-23 06:01:01,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:01:01" (1/1) ... [2022-07-23 06:01:01,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:01:01,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:01:02,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:01:02,008 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:01:02,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:01:02,067 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:01:02,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02 WrapperNode [2022-07-23 06:01:02,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:01:02,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:01:02,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:01:02,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:01:02,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,109 INFO L137 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 304 [2022-07-23 06:01:02,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:01:02,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:01:02,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:01:02,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:01:02,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:01:02,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:01:02,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:01:02,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:01:02,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (1/1) ... [2022-07-23 06:01:02,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:01:02,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:01:02,185 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-23 06:01:02,201 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-23 06:01:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:01:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:01:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:01:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:01:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:01:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:01:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:01:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:01:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:01:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:01:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-23 06:01:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-23 06:01:02,286 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:01:02,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:01:02,725 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:01:02,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:01:02,733 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-23 06:01:02,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:01:02 BoogieIcfgContainer [2022-07-23 06:01:02,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:01:02,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:01:02,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:01:02,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:01:02,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:01:01" (1/3) ... [2022-07-23 06:01:02,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1892d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:01:02, skipping insertion in model container [2022-07-23 06:01:02,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:02" (2/3) ... [2022-07-23 06:01:02,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1892d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:01:02, skipping insertion in model container [2022-07-23 06:01:02,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:01:02" (3/3) ... [2022-07-23 06:01:02,755 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2022-07-23 06:01:02,774 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:01:02,774 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-23 06:01:02,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:01:02,823 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@73e0640d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4edeb322 [2022-07-23 06:01:02,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-23 06:01:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 160 states have (on average 2.1375) internal successors, (342), 309 states have internal predecessors, (342), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:01:02,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:02,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:01:02,842 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:02,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 06:01:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:02,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861793436] [2022-07-23 06:01:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:02,957 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-23 06:01:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:02,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861793436] [2022-07-23 06:01:02,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861793436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:02,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:02,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281758077] [2022-07-23 06:01:02,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:02,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:01:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:02,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:02,994 INFO L87 Difference]: Start difference. First operand has 323 states, 160 states have (on average 2.1375) internal successors, (342), 309 states have internal predecessors, (342), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:03,342 INFO L93 Difference]: Finished difference Result 548 states and 601 transitions. [2022-07-23 06:01:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:01:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:03,353 INFO L225 Difference]: With dead ends: 548 [2022-07-23 06:01:03,353 INFO L226 Difference]: Without dead ends: 546 [2022-07-23 06:01:03,354 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-23 06:01:03,356 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 246 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:03,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 436 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:01:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-23 06:01:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 407. [2022-07-23 06:01:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 247 states have (on average 2.0890688259109313) internal successors, (516), 393 states have internal predecessors, (516), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2022-07-23 06:01:03,402 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 3 [2022-07-23 06:01:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:03,402 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2022-07-23 06:01:03,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2022-07-23 06:01:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:01:03,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:03,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:01:03,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:01:03,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 06:01:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:03,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931798295] [2022-07-23 06:01:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:03,434 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-23 06:01:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:03,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931798295] [2022-07-23 06:01:03,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931798295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:03,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:03,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:03,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68669194] [2022-07-23 06:01:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:03,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:01:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:03,437 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:03,565 INFO L93 Difference]: Finished difference Result 408 states and 547 transitions. [2022-07-23 06:01:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:03,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:01:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:03,567 INFO L225 Difference]: With dead ends: 408 [2022-07-23 06:01:03,568 INFO L226 Difference]: Without dead ends: 408 [2022-07-23 06:01:03,568 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-23 06:01:03,569 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 6 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:03,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 554 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:01:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-23 06:01:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2022-07-23 06:01:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 247 states have (on average 2.080971659919028) internal successors, (514), 391 states have internal predecessors, (514), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 542 transitions. [2022-07-23 06:01:03,597 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 542 transitions. Word has length 3 [2022-07-23 06:01:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:03,597 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 542 transitions. [2022-07-23 06:01:03,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 542 transitions. [2022-07-23 06:01:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:01:03,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:03,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:03,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:01:03,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1117390162, now seen corresponding path program 1 times [2022-07-23 06:01:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:03,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148225501] [2022-07-23 06:01:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:03,636 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-23 06:01:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148225501] [2022-07-23 06:01:03,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148225501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:03,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:03,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155089099] [2022-07-23 06:01:03,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:03,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:01:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:03,639 INFO L87 Difference]: Start difference. First operand 405 states and 542 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:03,772 INFO L93 Difference]: Finished difference Result 400 states and 537 transitions. [2022-07-23 06:01:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:03,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:01:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:03,774 INFO L225 Difference]: With dead ends: 400 [2022-07-23 06:01:03,774 INFO L226 Difference]: Without dead ends: 400 [2022-07-23 06:01:03,775 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-23 06:01:03,775 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 43 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:03,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 497 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:01:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-23 06:01:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2022-07-23 06:01:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 247 states have (on average 2.0607287449392713) internal successors, (509), 386 states have internal predecessors, (509), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 537 transitions. [2022-07-23 06:01:03,784 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 537 transitions. Word has length 10 [2022-07-23 06:01:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:03,785 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 537 transitions. [2022-07-23 06:01:03,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 537 transitions. [2022-07-23 06:01:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:01:03,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:03,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:03,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:01:03,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:03,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1117390163, now seen corresponding path program 1 times [2022-07-23 06:01:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:03,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513151544] [2022-07-23 06:01:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:03,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:03,827 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-23 06:01:03,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:03,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513151544] [2022-07-23 06:01:03,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513151544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:03,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:03,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:03,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201839538] [2022-07-23 06:01:03,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:03,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:03,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:01:03,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:03,830 INFO L87 Difference]: Start difference. First operand 400 states and 537 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:03,962 INFO L93 Difference]: Finished difference Result 395 states and 532 transitions. [2022-07-23 06:01:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:03,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:01:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:03,965 INFO L225 Difference]: With dead ends: 395 [2022-07-23 06:01:03,965 INFO L226 Difference]: Without dead ends: 395 [2022-07-23 06:01:03,966 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-23 06:01:03,973 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 38 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:03,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 510 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:01:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-23 06:01:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-07-23 06:01:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 247 states have (on average 2.0404858299595143) internal successors, (504), 381 states have internal predecessors, (504), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 532 transitions. [2022-07-23 06:01:03,983 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 532 transitions. Word has length 10 [2022-07-23 06:01:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:03,984 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 532 transitions. [2022-07-23 06:01:03,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 532 transitions. [2022-07-23 06:01:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:01:03,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:03,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:03,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:01:03,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash 279357079, now seen corresponding path program 1 times [2022-07-23 06:01:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:03,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341287206] [2022-07-23 06:01:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:04,045 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-23 06:01:04,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:04,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341287206] [2022-07-23 06:01:04,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341287206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:04,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:04,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:01:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200812706] [2022-07-23 06:01:04,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:04,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:01:04,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:01:04,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:01:04,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:01:04,048 INFO L87 Difference]: Start difference. First operand 395 states and 532 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:04,413 INFO L93 Difference]: Finished difference Result 523 states and 574 transitions. [2022-07-23 06:01:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:01:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:01:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:04,415 INFO L225 Difference]: With dead ends: 523 [2022-07-23 06:01:04,415 INFO L226 Difference]: Without dead ends: 523 [2022-07-23 06:01:04,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:01:04,416 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 318 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:04,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 806 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:01:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-23 06:01:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 387. [2022-07-23 06:01:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 247 states have (on average 2.0080971659919027) internal successors, (496), 373 states have internal predecessors, (496), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 524 transitions. [2022-07-23 06:01:04,423 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 524 transitions. Word has length 11 [2022-07-23 06:01:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:04,423 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 524 transitions. [2022-07-23 06:01:04,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2022-07-23 06:01:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:01:04,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:04,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:04,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:01:04,425 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:04,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash 279357080, now seen corresponding path program 1 times [2022-07-23 06:01:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:04,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849512067] [2022-07-23 06:01:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:04,534 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-23 06:01:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:04,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849512067] [2022-07-23 06:01:04,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849512067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:04,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:04,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:01:04,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763874447] [2022-07-23 06:01:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:04,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:01:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:01:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:01:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:01:04,536 INFO L87 Difference]: Start difference. First operand 387 states and 524 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:04,979 INFO L93 Difference]: Finished difference Result 513 states and 564 transitions. [2022-07-23 06:01:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:01:04,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:01:04,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:04,981 INFO L225 Difference]: With dead ends: 513 [2022-07-23 06:01:04,981 INFO L226 Difference]: Without dead ends: 513 [2022-07-23 06:01:04,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:01:04,982 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 804 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:04,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 447 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:01:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-23 06:01:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 378. [2022-07-23 06:01:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 247 states have (on average 1.9676113360323886) internal successors, (486), 364 states have internal predecessors, (486), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2022-07-23 06:01:04,988 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 11 [2022-07-23 06:01:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:04,988 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2022-07-23 06:01:04,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2022-07-23 06:01:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:01:04,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:04,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:04,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:01:04,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash 693745101, now seen corresponding path program 1 times [2022-07-23 06:01:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:04,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131744211] [2022-07-23 06:01:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:05,126 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-23 06:01:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131744211] [2022-07-23 06:01:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131744211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:05,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:05,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:01:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166422904] [2022-07-23 06:01:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:05,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:01:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:01:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:01:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:01:05,129 INFO L87 Difference]: Start difference. First operand 378 states and 514 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-23 06:01:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:05,376 INFO L93 Difference]: Finished difference Result 398 states and 537 transitions. [2022-07-23 06:01:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:01:05,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 20 [2022-07-23 06:01:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:05,378 INFO L225 Difference]: With dead ends: 398 [2022-07-23 06:01:05,378 INFO L226 Difference]: Without dead ends: 398 [2022-07-23 06:01:05,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:01:05,379 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 32 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:05,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1568 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:01:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-23 06:01:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 386. [2022-07-23 06:01:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 254 states have (on average 1.9448818897637796) internal successors, (494), 371 states have internal predecessors, (494), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-23 06:01:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2022-07-23 06:01:05,404 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 20 [2022-07-23 06:01:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:05,404 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2022-07-23 06:01:05,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-23 06:01:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2022-07-23 06:01:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:01:05,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:05,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:01:05,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:05,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -964577360, now seen corresponding path program 1 times [2022-07-23 06:01:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:05,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397957651] [2022-07-23 06:01:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:05,549 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-23 06:01:05,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:05,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397957651] [2022-07-23 06:01:05,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397957651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:05,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:05,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:01:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862319187] [2022-07-23 06:01:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:05,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:01:05,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:01:05,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:01:05,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:01:05,552 INFO L87 Difference]: Start difference. First operand 386 states and 524 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-23 06:01:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:06,084 INFO L93 Difference]: Finished difference Result 526 states and 579 transitions. [2022-07-23 06:01:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:01:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 22 [2022-07-23 06:01:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:06,087 INFO L225 Difference]: With dead ends: 526 [2022-07-23 06:01:06,087 INFO L226 Difference]: Without dead ends: 526 [2022-07-23 06:01:06,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:01:06,088 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 753 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:06,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1277 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:01:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-23 06:01:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 389. [2022-07-23 06:01:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 257 states have (on average 1.933852140077821) internal successors, (497), 374 states have internal predecessors, (497), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-23 06:01:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2022-07-23 06:01:06,109 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 22 [2022-07-23 06:01:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:06,109 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2022-07-23 06:01:06,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-23 06:01:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2022-07-23 06:01:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:01:06,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:06,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:06,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:01:06,111 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash -339455757, now seen corresponding path program 1 times [2022-07-23 06:01:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:01:06,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794734079] [2022-07-23 06:01:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:06,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:01:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:06,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 06:01:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:06,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:01:06,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794734079] [2022-07-23 06:01:06,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794734079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:01:06,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515911548] [2022-07-23 06:01:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:06,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:01:06,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:01:06,432 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-23 06:01:06,460 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-23 06:01:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:06,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-23 06:01:06,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:06,609 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-23 06:01:06,806 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 13 treesize of output 9 [2022-07-23 06:01:06,866 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:06,866 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 16 treesize of output 22 [2022-07-23 06:01:06,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:01:07,143 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:07,145 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 31 treesize of output 37 [2022-07-23 06:01:07,150 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-23 06:01:07,186 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-23 06:01:07,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:01:07,369 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-23 06:01:07,375 INFO L158 Benchmark]: Toolchain (without parser) took 5665.06ms. Allocated memory was 104.9MB in the beginning and 192.9MB in the end (delta: 88.1MB). Free memory was 73.6MB in the beginning and 138.2MB in the end (delta: -64.6MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-07-23 06:01:07,375 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 104.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:01:07,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.98ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 73.6MB in the beginning and 90.6MB in the end (delta: -17.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 06:01:07,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.02ms. Allocated memory is still 125.8MB. Free memory was 90.6MB in the beginning and 87.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:01:07,376 INFO L158 Benchmark]: Boogie Preprocessor took 29.18ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 85.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:01:07,376 INFO L158 Benchmark]: RCFGBuilder took 594.41ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 76.3MB in the end (delta: 8.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2022-07-23 06:01:07,376 INFO L158 Benchmark]: TraceAbstraction took 4638.52ms. Allocated memory was 125.8MB in the beginning and 192.9MB in the end (delta: 67.1MB). Free memory was 75.8MB in the beginning and 138.2MB in the end (delta: -62.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-07-23 06:01:07,378 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.78ms. Allocated memory is still 104.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.98ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 73.6MB in the beginning and 90.6MB in the end (delta: -17.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.02ms. Allocated memory is still 125.8MB. Free memory was 90.6MB in the beginning and 87.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.18ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 85.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 594.41ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 76.3MB in the end (delta: 8.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4638.52ms. Allocated memory was 125.8MB in the beginning and 192.9MB in the end (delta: 67.1MB). Free memory was 75.8MB in the beginning and 138.2MB in the end (delta: -62.4MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-23 06:01:07,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:01:09,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:01:09,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:01:09,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:01:09,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:01:09,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:01:09,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:01:09,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:01:09,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:01:09,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:01:09,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:01:09,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:01:09,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:01:09,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:01:09,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:01:09,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:01:09,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:01:09,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:01:09,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:01:09,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:01:09,416 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:01:09,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:01:09,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:01:09,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:01:09,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:01:09,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:01:09,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:01:09,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:01:09,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:01:09,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:01:09,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:01:09,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:01:09,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:01:09,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:01:09,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:01:09,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:01:09,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:01:09,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:01:09,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:01:09,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:01:09,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:01:09,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:01:09,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 06:01:09,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:01:09,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:01:09,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:01:09,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:01:09,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:01:09,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:01:09,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:01:09,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:01:09,464 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:01:09,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:01:09,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:01:09,465 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:01:09,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:01:09,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:01:09,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:01:09,465 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:01:09,465 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:01:09,466 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:01:09,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:01:09,466 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:01:09,466 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:01:09,466 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:01:09,466 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:01:09,466 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:01:09,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:01:09,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:01:09,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:01:09,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:01:09,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:01:09,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:01:09,468 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:01:09,468 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:01:09,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:01:09,468 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2022-07-23 06:01:09,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:01:09,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:01:09,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:01:09,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:01:09,813 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:01:09,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-23 06:01:09,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4e22cc0/fa71653099d842689270040cc363ba58/FLAG7a0f2c086 [2022-07-23 06:01:10,289 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:01:10,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-23 06:01:10,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4e22cc0/fa71653099d842689270040cc363ba58/FLAG7a0f2c086 [2022-07-23 06:01:10,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4e22cc0/fa71653099d842689270040cc363ba58 [2022-07-23 06:01:10,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:01:10,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:01:10,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:01:10,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:01:10,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:01:10,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:01:10" (1/1) ... [2022-07-23 06:01:10,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735bc037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:10, skipping insertion in model container [2022-07-23 06:01:10,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:01:10" (1/1) ... [2022-07-23 06:01:10,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:01:10,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:01:10,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:01:11,011 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:01:11,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:01:11,058 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:01:11,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11 WrapperNode [2022-07-23 06:01:11,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:01:11,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:01:11,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:01:11,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:01:11,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,109 INFO L137 Inliner]: procedures = 126, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 294 [2022-07-23 06:01:11,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:01:11,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:01:11,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:01:11,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:01:11,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:01:11,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:01:11,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:01:11,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:01:11,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (1/1) ... [2022-07-23 06:01:11,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:01:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:01:11,193 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-23 06:01:11,207 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-23 06:01:11,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 06:01:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:01:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:01:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:01:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:01:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-23 06:01:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:01:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 06:01:11,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:01:11,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:01:11,227 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-23 06:01:11,227 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-23 06:01:11,404 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:01:11,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:01:12,307 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:01:12,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:01:12,321 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-23 06:01:12,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:01:12 BoogieIcfgContainer [2022-07-23 06:01:12,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:01:12,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:01:12,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:01:12,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:01:12,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:01:10" (1/3) ... [2022-07-23 06:01:12,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13dd92a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:01:12, skipping insertion in model container [2022-07-23 06:01:12,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:11" (2/3) ... [2022-07-23 06:01:12,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13dd92a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:01:12, skipping insertion in model container [2022-07-23 06:01:12,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:01:12" (3/3) ... [2022-07-23 06:01:12,332 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2022-07-23 06:01:12,347 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:01:12,347 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-23 06:01:12,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:01:12,473 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@72d93203, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68c7796f [2022-07-23 06:01:12,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-23 06:01:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 157 states have (on average 2.159235668789809) internal successors, (339), 306 states have internal predecessors, (339), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:01:12,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:12,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:01:12,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 06:01:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:12,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519800891] [2022-07-23 06:01:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:12,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:12,565 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-23 06:01:12,596 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-23 06:01:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:12,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:01:12,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:12,817 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-23 06:01:12,988 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-23 06:01:12,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:12,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:12,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519800891] [2022-07-23 06:01:12,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519800891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:12,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:12,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730556667] [2022-07-23 06:01:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:12,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:13,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:13,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:13,048 INFO L87 Difference]: Start difference. First operand has 320 states, 157 states have (on average 2.159235668789809) internal successors, (339), 306 states have internal predecessors, (339), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:14,139 INFO L93 Difference]: Finished difference Result 545 states and 598 transitions. [2022-07-23 06:01:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:14,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:01:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:14,152 INFO L225 Difference]: With dead ends: 545 [2022-07-23 06:01:14,156 INFO L226 Difference]: Without dead ends: 543 [2022-07-23 06:01:14,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:14,171 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 246 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:14,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 430 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 06:01:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-23 06:01:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 404. [2022-07-23 06:01:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 244 states have (on average 2.1024590163934427) internal successors, (513), 390 states have internal predecessors, (513), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 541 transitions. [2022-07-23 06:01:14,288 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 541 transitions. Word has length 3 [2022-07-23 06:01:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:14,288 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 541 transitions. [2022-07-23 06:01:14,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 541 transitions. [2022-07-23 06:01:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:01:14,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:14,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:01:14,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 06:01:14,517 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-23 06:01:14,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:14,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 06:01:14,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:14,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846073080] [2022-07-23 06:01:14,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:14,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:14,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:14,524 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-23 06:01:14,525 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-23 06:01:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:14,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:01:14,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:14,646 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-23 06:01:14,657 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-23 06:01:14,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:14,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846073080] [2022-07-23 06:01:14,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846073080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:14,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:14,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:14,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618952427] [2022-07-23 06:01:14,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:14,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:14,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:14,675 INFO L87 Difference]: Start difference. First operand 404 states and 541 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:15,435 INFO L93 Difference]: Finished difference Result 405 states and 544 transitions. [2022-07-23 06:01:15,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:15,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:01:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:15,438 INFO L225 Difference]: With dead ends: 405 [2022-07-23 06:01:15,438 INFO L226 Difference]: Without dead ends: 405 [2022-07-23 06:01:15,439 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-23 06:01:15,439 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:15,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 548 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 06:01:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-23 06:01:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2022-07-23 06:01:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 244 states have (on average 2.0942622950819674) internal successors, (511), 388 states have internal predecessors, (511), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 539 transitions. [2022-07-23 06:01:15,470 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 539 transitions. Word has length 3 [2022-07-23 06:01:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:15,476 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 539 transitions. [2022-07-23 06:01:15,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 539 transitions. [2022-07-23 06:01:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:01:15,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:15,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:15,491 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-23 06:01:15,686 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-23 06:01:15,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:15,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1117387183, now seen corresponding path program 1 times [2022-07-23 06:01:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:15,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135727005] [2022-07-23 06:01:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:15,692 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-23 06:01:15,792 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-23 06:01:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:15,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:01:15,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:15,892 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-23 06:01:15,896 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-23 06:01:15,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:15,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:15,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135727005] [2022-07-23 06:01:15,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135727005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:15,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:15,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:15,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025012003] [2022-07-23 06:01:15,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:15,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:15,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:15,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:15,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:15,917 INFO L87 Difference]: Start difference. First operand 402 states and 539 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:16,706 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2022-07-23 06:01:16,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:16,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:01:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:16,708 INFO L225 Difference]: With dead ends: 397 [2022-07-23 06:01:16,708 INFO L226 Difference]: Without dead ends: 397 [2022-07-23 06:01:16,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-23 06:01:16,709 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 43 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:16,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 491 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 06:01:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-23 06:01:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-07-23 06:01:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 244 states have (on average 2.0737704918032787) internal successors, (506), 383 states have internal predecessors, (506), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2022-07-23 06:01:16,722 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 10 [2022-07-23 06:01:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:16,722 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2022-07-23 06:01:16,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2022-07-23 06:01:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:01:16,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:16,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:16,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:16,932 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-23 06:01:16,932 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1117387184, now seen corresponding path program 1 times [2022-07-23 06:01:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:16,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087472123] [2022-07-23 06:01:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:16,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:16,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:16,943 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-23 06:01:16,963 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-23 06:01:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:17,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:01:17,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:17,094 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-23 06:01:17,100 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-23 06:01:17,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:17,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:17,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087472123] [2022-07-23 06:01:17,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087472123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:17,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:17,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:17,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782721772] [2022-07-23 06:01:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:17,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:17,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:17,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:17,106 INFO L87 Difference]: Start difference. First operand 397 states and 534 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:17,740 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2022-07-23 06:01:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:17,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:01:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:17,745 INFO L225 Difference]: With dead ends: 392 [2022-07-23 06:01:17,745 INFO L226 Difference]: Without dead ends: 392 [2022-07-23 06:01:17,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-23 06:01:17,745 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 38 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:17,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 504 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 06:01:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-23 06:01:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-07-23 06:01:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 244 states have (on average 2.05327868852459) internal successors, (501), 378 states have internal predecessors, (501), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2022-07-23 06:01:17,764 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 10 [2022-07-23 06:01:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:17,765 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2022-07-23 06:01:17,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2022-07-23 06:01:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:01:17,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:17,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:17,777 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-23 06:01:17,973 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-23 06:01:17,973 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash 279264727, now seen corresponding path program 1 times [2022-07-23 06:01:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:17,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231752906] [2022-07-23 06:01:17,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:17,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:17,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:17,980 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-23 06:01:17,993 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-23 06:01:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:18,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:01:18,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:18,195 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-23 06:01:18,755 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:01:18,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 06:01:18,795 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-23 06:01:18,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:18,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231752906] [2022-07-23 06:01:18,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231752906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:18,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:18,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:01:18,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242074411] [2022-07-23 06:01:18,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:18,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:01:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:18,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:01:18,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:01:18,831 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:19,902 INFO L93 Difference]: Finished difference Result 520 states and 571 transitions. [2022-07-23 06:01:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:01:19,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:01:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:19,904 INFO L225 Difference]: With dead ends: 520 [2022-07-23 06:01:19,905 INFO L226 Difference]: Without dead ends: 520 [2022-07-23 06:01:19,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:01:19,905 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 314 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:19,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 639 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 06:01:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-23 06:01:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 384. [2022-07-23 06:01:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 244 states have (on average 2.0204918032786887) internal successors, (493), 370 states have internal predecessors, (493), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 521 transitions. [2022-07-23 06:01:19,916 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 521 transitions. Word has length 11 [2022-07-23 06:01:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:19,917 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 521 transitions. [2022-07-23 06:01:19,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 521 transitions. [2022-07-23 06:01:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:01:19,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:19,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:19,934 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-23 06:01:20,125 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-23 06:01:20,125 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash 279264728, now seen corresponding path program 1 times [2022-07-23 06:01:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:20,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630895408] [2022-07-23 06:01:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:20,128 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-23 06:01:20,131 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-23 06:01:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:20,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 06:01:20,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:20,378 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-23 06:01:20,401 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-23 06:01:20,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:01:20,550 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-23 06:01:20,562 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:20,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-23 06:01:20,584 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-23 06:01:20,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:20,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:20,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630895408] [2022-07-23 06:01:20,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630895408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:20,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:20,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:01:20,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343420673] [2022-07-23 06:01:20,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:20,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:01:20,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:20,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:01:20,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:01:20,586 INFO L87 Difference]: Start difference. First operand 384 states and 521 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:22,331 INFO L93 Difference]: Finished difference Result 511 states and 562 transitions. [2022-07-23 06:01:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:01:22,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:01:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:22,334 INFO L225 Difference]: With dead ends: 511 [2022-07-23 06:01:22,334 INFO L226 Difference]: Without dead ends: 511 [2022-07-23 06:01:22,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:01:22,335 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 298 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:22,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 443 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-23 06:01:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-07-23 06:01:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 376. [2022-07-23 06:01:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 244 states have (on average 1.9836065573770492) internal successors, (484), 362 states have internal predecessors, (484), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-23 06:01:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 512 transitions. [2022-07-23 06:01:22,346 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 512 transitions. Word has length 11 [2022-07-23 06:01:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:22,346 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 512 transitions. [2022-07-23 06:01:22,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 512 transitions. [2022-07-23 06:01:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:01:22,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:22,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:22,376 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-23 06:01:22,547 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-23 06:01:22,548 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash 314804234, now seen corresponding path program 1 times [2022-07-23 06:01:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:22,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959278726] [2022-07-23 06:01:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:22,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:22,551 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-23 06:01:22,557 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-23 06:01:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:22,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:01:22,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:22,762 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-23 06:01:22,794 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-23 06:01:22,802 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-23 06:01:22,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:01:22,864 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 21 treesize of output 20 [2022-07-23 06:01:22,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:01:22,873 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 21 treesize of output 20 [2022-07-23 06:01:22,988 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:22,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-23 06:01:23,041 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-23 06:01:23,047 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-23 06:01:23,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-23 06:01:23,086 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-23 06:01:23,111 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-23 06:01:23,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:23,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:23,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959278726] [2022-07-23 06:01:23,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959278726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:23,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:23,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:01:23,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377146124] [2022-07-23 06:01:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:23,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:01:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:01:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:01:23,129 INFO L87 Difference]: Start difference. First operand 376 states and 512 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-23 06:01:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:24,433 INFO L93 Difference]: Finished difference Result 396 states and 535 transitions. [2022-07-23 06:01:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:01:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 20 [2022-07-23 06:01:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:24,435 INFO L225 Difference]: With dead ends: 396 [2022-07-23 06:01:24,435 INFO L226 Difference]: Without dead ends: 396 [2022-07-23 06:01:24,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:01:24,436 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:24,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1823 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-23 06:01:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-23 06:01:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 384. [2022-07-23 06:01:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 251 states have (on average 1.9601593625498008) internal successors, (492), 369 states have internal predecessors, (492), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-23 06:01:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 522 transitions. [2022-07-23 06:01:24,448 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 522 transitions. Word has length 20 [2022-07-23 06:01:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:24,449 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 522 transitions. [2022-07-23 06:01:24,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-23 06:01:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 522 transitions. [2022-07-23 06:01:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:01:24,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:24,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:24,460 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-23 06:01:24,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:24,659 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -54530483, now seen corresponding path program 1 times [2022-07-23 06:01:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002298538] [2022-07-23 06:01:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:24,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:24,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:24,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:24,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 06:01:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:24,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 06:01:24,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:24,775 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-23 06:01:24,784 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 13 treesize of output 9 [2022-07-23 06:01:24,789 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 13 treesize of output 9 [2022-07-23 06:01:24,862 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:24,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-23 06:01:24,896 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 16 treesize of output 18 [2022-07-23 06:01:24,902 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 16 treesize of output 18 [2022-07-23 06:01:24,957 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 19 treesize of output 7 [2022-07-23 06:01:24,960 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 19 treesize of output 7 [2022-07-23 06:01:24,986 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-23 06:01:24,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:24,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:24,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002298538] [2022-07-23 06:01:24,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002298538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:24,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:24,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:01:24,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756634082] [2022-07-23 06:01:24,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:24,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:01:24,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:24,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:01:24,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:01:24,987 INFO L87 Difference]: Start difference. First operand 384 states and 522 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-23 06:01:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:26,236 INFO L93 Difference]: Finished difference Result 524 states and 577 transitions. [2022-07-23 06:01:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:01:26,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2022-07-23 06:01:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:26,238 INFO L225 Difference]: With dead ends: 524 [2022-07-23 06:01:26,238 INFO L226 Difference]: Without dead ends: 524 [2022-07-23 06:01:26,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:01:26,239 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 249 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:26,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1334 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-23 06:01:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-23 06:01:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 387. [2022-07-23 06:01:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 254 states have (on average 1.9488188976377954) internal successors, (495), 372 states have internal predecessors, (495), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-23 06:01:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 525 transitions. [2022-07-23 06:01:26,267 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 525 transitions. Word has length 22 [2022-07-23 06:01:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:26,267 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 525 transitions. [2022-07-23 06:01:26,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-23 06:01:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 525 transitions. [2022-07-23 06:01:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:01:26,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:26,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:26,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:26,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:26,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 67877176, now seen corresponding path program 1 times [2022-07-23 06:01:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:26,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121710258] [2022-07-23 06:01:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:26,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:26,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:26,481 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-23 06:01:26,482 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-23 06:01:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:26,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:01:26,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:26,691 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 06:01:26,691 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-23 06:01:26,897 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 13 treesize of output 9 [2022-07-23 06:01:26,946 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:26,946 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 16 treesize of output 22 [2022-07-23 06:01:26,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:01:27,020 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:27,021 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 20 treesize of output 26 [2022-07-23 06:01:27,143 INFO L356 Elim1Store]: treesize reduction 128, result has 20.5 percent of original size [2022-07-23 06:01:27,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 101 [2022-07-23 06:01:27,155 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-23 06:01:27,156 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 1 case distinctions, treesize of input 45 treesize of output 20 [2022-07-23 06:01:27,318 INFO L356 Elim1Store]: treesize reduction 85, result has 36.6 percent of original size [2022-07-23 06:01:27,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 86 [2022-07-23 06:01:27,460 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 63 treesize of output 59 [2022-07-23 06:01:27,682 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 63 treesize of output 59 [2022-07-23 06:01:27,757 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 63 treesize of output 59 [2022-07-23 06:01:27,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 45 treesize of output 21 [2022-07-23 06:01:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:27,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:01:28,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_252) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset))) (_ bv1 1))) is different from false [2022-07-23 06:01:28,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_append_~node~0.base_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_21)))) (= (_ bv1 1) (select (store |c_#valid| v_append_~node~0.base_21 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_21 v_ArrVal_252) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|)))))) is different from false [2022-07-23 06:01:28,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_append_~node~0.base_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_21)))) (= (_ bv1 1) (select (store |c_#valid| v_append_~node~0.base_21 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_21 v_ArrVal_252) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2022-07-23 06:01:28,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:28,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 33 treesize of output 34 [2022-07-23 06:01:28,190 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 335 treesize of output 209 [2022-07-23 06:01:28,195 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 182 treesize of output 174 [2022-07-23 06:01:28,200 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 174 treesize of output 158 [2022-07-23 06:01:32,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:32,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121710258] [2022-07-23 06:01:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121710258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:01:32,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [18925185] [2022-07-23 06:01:32,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:32,362 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:01:32,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:01:32,365 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:01:32,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-23 06:01:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:33,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:01:33,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:33,251 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:01:33,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 06:01:33,662 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 13 treesize of output 9 [2022-07-23 06:01:33,683 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:33,683 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 16 treesize of output 22 [2022-07-23 06:01:33,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:01:33,719 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:33,720 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 20 treesize of output 26 [2022-07-23 06:01:33,830 INFO L356 Elim1Store]: treesize reduction 138, result has 14.3 percent of original size [2022-07-23 06:01:33,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 89 [2022-07-23 06:01:33,871 INFO L356 Elim1Store]: treesize reduction 71, result has 29.0 percent of original size [2022-07-23 06:01:33,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 44 [2022-07-23 06:01:34,238 INFO L356 Elim1Store]: treesize reduction 65, result has 40.9 percent of original size [2022-07-23 06:01:34,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 66 [2022-07-23 06:01:34,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-23 06:01:34,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-23 06:01:34,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-23 06:01:34,996 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 35 treesize of output 19 [2022-07-23 06:01:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:35,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:01:35,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_337) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset))) (_ bv1 1))) is different from false [2022-07-23 06:01:35,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_25 (_ BitVec 32)) (v_ArrVal_334 (_ BitVec 1)) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_25)))) (= (_ bv1 1) (select (store |c_#valid| v_append_~node~0.base_25 v_ArrVal_334) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_25 v_ArrVal_337) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|)))))) is different from false [2022-07-23 06:01:35,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_25 (_ BitVec 32)) (v_ArrVal_334 (_ BitVec 1)) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_25)))) (= (select (store |c_#valid| v_append_~node~0.base_25 v_ArrVal_334) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_25 v_ArrVal_337) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-23 06:01:35,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:35,290 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 33 treesize of output 34 [2022-07-23 06:01:35,293 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 172 treesize of output 112 [2022-07-23 06:01:35,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2022-07-23 06:01:35,306 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 82 treesize of output 74 [2022-07-23 06:01:39,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [18925185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:01:39,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:01:39,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2022-07-23 06:01:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127059720] [2022-07-23 06:01:39,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:01:39,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-23 06:01:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:39,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-23 06:01:39,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=577, Unknown=8, NotChecked=318, Total=992 [2022-07-23 06:01:39,535 INFO L87 Difference]: Start difference. First operand 387 states and 525 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:01:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:43,602 INFO L93 Difference]: Finished difference Result 472 states and 637 transitions. [2022-07-23 06:01:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:01:43,603 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-07-23 06:01:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:43,606 INFO L225 Difference]: With dead ends: 472 [2022-07-23 06:01:43,606 INFO L226 Difference]: Without dead ends: 472 [2022-07-23 06:01:43,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=219, Invalid=1519, Unknown=8, NotChecked=510, Total=2256 [2022-07-23 06:01:43,609 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 184 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 2748 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 811 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:43,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 2748 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1509 Invalid, 0 Unknown, 811 Unchecked, 3.0s Time] [2022-07-23 06:01:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-23 06:01:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 444. [2022-07-23 06:01:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 307 states have (on average 1.8241042345276872) internal successors, (560), 426 states have internal predecessors, (560), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-07-23 06:01:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 593 transitions. [2022-07-23 06:01:43,639 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 593 transitions. Word has length 36 [2022-07-23 06:01:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:43,639 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 593 transitions. [2022-07-23 06:01:43,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:01:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 593 transitions. [2022-07-23 06:01:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:01:43,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:43,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:43,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:43,882 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-23 06:01:44,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:44,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:01:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 67877177, now seen corresponding path program 1 times [2022-07-23 06:01:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:44,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309069527] [2022-07-23 06:01:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:44,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:44,051 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-23 06:01:44,057 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-23 06:01:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:44,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 06:01:44,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:44,423 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-23 06:01:44,449 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-23 06:01:44,622 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 13 treesize of output 9 [2022-07-23 06:01:44,629 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 13 treesize of output 9 [2022-07-23 06:01:44,674 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:44,675 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 16 treesize of output 22 [2022-07-23 06:01:44,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:01:44,725 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:44,726 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 16 treesize of output 22 [2022-07-23 06:01:44,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:01:44,795 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:44,795 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 20 treesize of output 26 [2022-07-23 06:01:44,813 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:01:44,814 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 20 treesize of output 26 [2022-07-23 06:01:44,962 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-23 06:01:44,962 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 53 treesize of output 51 [2022-07-23 06:01:45,115 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:45,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-23 06:01:45,147 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-23 06:01:45,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:01:45,254 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 28 treesize of output 28 [2022-07-23 06:01:45,270 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 16 treesize of output 18 [2022-07-23 06:01:45,359 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 16 treesize of output 18 [2022-07-23 06:01:45,376 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 28 treesize of output 28 [2022-07-23 06:01:45,425 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 16 treesize of output 18 [2022-07-23 06:01:45,444 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 28 treesize of output 28 [2022-07-23 06:01:45,551 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 31 treesize of output 13 [2022-07-23 06:01:45,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2022-07-23 06:01:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:45,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:01:45,777 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_append_~head.offset))) (bvule (bvadd (_ bv9 32) (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_428) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_429) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_428) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset)))) (bvule (bvadd (_ bv5 32) .cse1) (bvadd (_ bv9 32) .cse1))))) is different from false [2022-07-23 06:01:46,706 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_append_~node~0.base_29 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_29)))) (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_append_~node~0.base_29 v_ArrVal_428) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|)))) (bvule (bvadd (_ bv5 32) .cse0) (bvadd .cse0 (_ bv9 32))))))) (forall ((v_append_~node~0.base_29 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_29)))) (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_append_#in~head.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_append_~node~0.base_29 v_ArrVal_428) |c_append_#in~head.base|) .cse1) (_ bv9 32)) (select (store |c_#length| v_append_~node~0.base_29 (_ bv9 32)) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_29 v_ArrVal_429) |c_append_#in~head.base|) .cse1)))))))) is different from false [2022-07-23 06:01:46,801 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_append_~node~0.base_29 (_ BitVec 32))) (or (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_append_~node~0.base_29 v_ArrVal_428) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (_ bv9 32)) (select (store |c_#length| v_append_~node~0.base_29 (_ bv9 32)) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_29 v_ArrVal_429) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_29)))))) (forall ((v_append_~node~0.base_29 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_29)))) (forall ((v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_append_~node~0.base_29 v_ArrVal_428) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (bvule (bvadd .cse1 (_ bv5 32)) (bvadd .cse1 (_ bv9 32)))))))) is different from false [2022-07-23 06:01:47,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:47,091 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 125 treesize of output 126 [2022-07-23 06:01:47,102 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 302 treesize of output 288 [2022-07-23 06:01:47,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:47,124 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 288 treesize of output 238 [2022-07-23 06:01:47,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:47,216 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 246 treesize of output 264 [2022-07-23 06:01:47,256 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 643 treesize of output 445 [2022-07-23 06:01:47,301 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 802 treesize of output 748 [2022-07-23 06:01:47,340 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 688 treesize of output 656 [2022-07-23 06:01:47,364 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 656 treesize of output 624 [2022-07-23 06:01:47,374 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 624 treesize of output 576 [2022-07-23 06:01:47,385 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 576 treesize of output 552 [2022-07-23 06:01:47,408 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 552 treesize of output 520 [2022-07-23 06:01:51,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:51,181 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 51 treesize of output 42 [2022-07-23 06:01:51,372 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:51,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 193 [2022-07-23 06:01:51,423 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 87 treesize of output 71 [2022-07-23 06:01:51,464 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 158 treesize of output 126 [2022-07-23 06:01:52,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:52,365 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 54 treesize of output 55 [2022-07-23 06:01:52,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:52,401 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 44 treesize of output 45 [2022-07-23 06:01:52,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:01:52,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:52,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2022-07-23 06:01:52,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:01:52,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:52,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 105 [2022-07-23 06:01:52,609 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 46 treesize of output 38 [2022-07-23 06:01:52,623 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 78 treesize of output 70 [2022-07-23 06:02:56,156 WARN L233 SmtUtils]: Spent 54.01s on a formula simplification. DAG size of input: 152 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:02:57,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:02:57,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 256 [2022-07-23 06:03:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-23 06:03:06,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:06,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309069527] [2022-07-23 06:03:06,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309069527] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:03:06,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:03:06,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2022-07-23 06:03:06,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804895790] [2022-07-23 06:03:06,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:03:06,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 06:03:06,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:06,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 06:03:06,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=355, Unknown=6, NotChecked=120, Total=552 [2022-07-23 06:03:06,884 INFO L87 Difference]: Start difference. First operand 444 states and 593 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:03:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:53,113 INFO L93 Difference]: Finished difference Result 614 states and 676 transitions. [2022-07-23 06:03:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:03:53,113 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-07-23 06:03:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:53,116 INFO L225 Difference]: With dead ends: 614 [2022-07-23 06:03:53,116 INFO L226 Difference]: Without dead ends: 614 [2022-07-23 06:03:53,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 106.4s TimeCoverageRelationStatistics Valid=133, Invalid=672, Unknown=19, NotChecked=168, Total=992 [2022-07-23 06:03:53,117 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 322 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2151 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:53,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 2216 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1412 Invalid, 0 Unknown, 2151 Unchecked, 8.6s Time] [2022-07-23 06:03:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-07-23 06:03:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 466. [2022-07-23 06:03:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 328 states have (on average 1.7804878048780488) internal successors, (584), 447 states have internal predecessors, (584), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-07-23 06:03:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 617 transitions. [2022-07-23 06:03:53,125 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 617 transitions. Word has length 36 [2022-07-23 06:03:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:53,126 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 617 transitions. [2022-07-23 06:03:53,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 06:03:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 617 transitions. [2022-07-23 06:03:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:03:53,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:53,126 INFO L195 NwaCegarLoop]: trace histogram [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-23 06:03:53,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:53,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:53,327 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:03:53,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1478521555, now seen corresponding path program 1 times [2022-07-23 06:03:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:53,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091992275] [2022-07-23 06:03:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:53,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:53,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:53,333 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:53,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 06:03:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:53,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 06:03:53,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:53,551 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-23 06:03:54,085 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 13 treesize of output 9 [2022-07-23 06:03:54,243 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:03:54,243 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 16 treesize of output 22 [2022-07-23 06:03:54,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:03:54,437 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:03:54,437 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 20 treesize of output 26 [2022-07-23 06:03:54,693 INFO L356 Elim1Store]: treesize reduction 75, result has 15.7 percent of original size [2022-07-23 06:03:54,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 76 [2022-07-23 06:03:54,729 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-23 06:03:54,729 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 1 case distinctions, treesize of input 45 treesize of output 20 [2022-07-23 06:03:55,092 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-23 06:03:55,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 52 [2022-07-23 06:03:55,246 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 40 treesize of output 38 [2022-07-23 06:03:55,463 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 40 treesize of output 38 [2022-07-23 06:03:55,530 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 40 treesize of output 38 [2022-07-23 06:03:55,644 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 15 [2022-07-23 06:03:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:55,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:03:55,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_520) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset))) (_ bv1 1))) is different from false [2022-07-23 06:03:56,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (_ BitVec 1)) (v_append_~node~0.base_34 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_34)))) (= (select (store |c_#valid| v_append_~node~0.base_34 v_ArrVal_517) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_34 v_ArrVal_520) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|))) (_ bv1 1)))) is different from false [2022-07-23 06:03:56,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (_ BitVec 1)) (v_append_~node~0.base_34 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_34)))) (= (select (store |c_#valid| v_append_~node~0.base_34 v_ArrVal_517) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_34 v_ArrVal_520) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-23 06:03:56,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:03:56,483 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 33 treesize of output 34 [2022-07-23 06:03:56,491 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 335 treesize of output 209 [2022-07-23 06:03:56,502 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 91 treesize of output 83 [2022-07-23 06:03:56,512 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 174 treesize of output 158 [2022-07-23 06:04:00,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:04:00,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091992275] [2022-07-23 06:04:00,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091992275] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:04:00,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1045880779] [2022-07-23 06:04:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:04:00,896 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:04:00,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:04:00,898 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:04:00,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-07-23 06:04:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:04:01,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:04:01,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:04:01,598 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:04:01,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 06:04:02,212 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 13 treesize of output 9 [2022-07-23 06:04:02,322 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:04:02,322 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 16 treesize of output 22 [2022-07-23 06:04:02,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:04:02,430 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:04:02,430 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 20 treesize of output 26 [2022-07-23 06:04:02,774 INFO L356 Elim1Store]: treesize reduction 128, result has 20.5 percent of original size [2022-07-23 06:04:02,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 99 [2022-07-23 06:04:03,662 INFO L356 Elim1Store]: treesize reduction 77, result has 36.9 percent of original size [2022-07-23 06:04:03,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 64 treesize of output 95 [2022-07-23 06:04:03,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-23 06:04:04,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-23 06:04:04,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-23 06:04:04,909 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 35 treesize of output 19 [2022-07-23 06:04:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:04:05,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:04:05,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_605) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset))) (_ bv1 1))) is different from false [2022-07-23 06:04:05,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_38 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_602 (_ BitVec 1))) (or (not (= (bvneg (select |c_#valid| v_append_~node~0.base_38)) (_ bv0 1))) (= (_ bv1 1) (select (store |c_#valid| v_append_~node~0.base_38 v_ArrVal_602) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_38 v_ArrVal_605) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|)))))) is different from false [2022-07-23 06:04:05,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_38 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_602 (_ BitVec 1))) (or (not (= (bvneg (select |c_#valid| v_append_~node~0.base_38)) (_ bv0 1))) (= (select (store |c_#valid| v_append_~node~0.base_38 v_ArrVal_602) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_38 v_ArrVal_605) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-23 06:04:05,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:05,680 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 33 treesize of output 34 [2022-07-23 06:04:05,688 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 172 treesize of output 112 [2022-07-23 06:04:05,697 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 86 treesize of output 78 [2022-07-23 06:04:05,706 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 40 treesize of output 36 [2022-07-23 06:04:07,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1045880779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:04:07,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:04:07,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2022-07-23 06:04:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412374554] [2022-07-23 06:04:07,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:04:07,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 06:04:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:04:07,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 06:04:07,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=480, Unknown=7, NotChecked=294, Total=870 [2022-07-23 06:04:07,883 INFO L87 Difference]: Start difference. First operand 466 states and 617 transitions. Second operand has 21 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:04:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:04:21,584 INFO L93 Difference]: Finished difference Result 979 states and 1149 transitions. [2022-07-23 06:04:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:04:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-07-23 06:04:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:04:21,589 INFO L225 Difference]: With dead ends: 979 [2022-07-23 06:04:21,590 INFO L226 Difference]: Without dead ends: 979 [2022-07-23 06:04:21,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=240, Invalid=1259, Unknown=7, NotChecked=474, Total=1980 [2022-07-23 06:04:21,591 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 617 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:04:21,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 2453 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2403 Invalid, 0 Unknown, 377 Unchecked, 11.1s Time] [2022-07-23 06:04:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2022-07-23 06:04:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 593. [2022-07-23 06:04:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 421 states have (on average 1.665083135391924) internal successors, (701), 546 states have internal predecessors, (701), 43 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (84), 43 states have call predecessors, (84), 43 states have call successors, (84) [2022-07-23 06:04:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 828 transitions. [2022-07-23 06:04:21,611 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 828 transitions. Word has length 38 [2022-07-23 06:04:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:04:21,611 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 828 transitions. [2022-07-23 06:04:21,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 06:04:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 828 transitions. [2022-07-23 06:04:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:04:21,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:04:21,613 INFO L195 NwaCegarLoop]: trace histogram [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-23 06:04:21,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-07-23 06:04:21,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 06:04:22,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:04:22,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-23 06:04:22,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:04:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1478521554, now seen corresponding path program 1 times [2022-07-23 06:04:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:04:22,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086139701] [2022-07-23 06:04:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:04:22,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:04:22,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:04:22,021 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-23 06:04:22,022 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-23 06:04:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:04:22,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 06:04:22,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:04:22,277 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-23 06:04:22,403 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-23 06:04:22,867 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 13 treesize of output 9 [2022-07-23 06:04:22,883 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 13 treesize of output 9 [2022-07-23 06:04:23,037 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:04:23,037 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 16 treesize of output 22 [2022-07-23 06:04:23,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:04:23,128 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:04:23,129 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 16 treesize of output 22 [2022-07-23 06:04:23,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 06:04:23,353 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:04:23,353 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 20 treesize of output 26 [2022-07-23 06:04:23,421 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:04:23,422 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 20 treesize of output 26 [2022-07-23 06:04:23,776 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-23 06:04:23,776 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 53 treesize of output 51 [2022-07-23 06:04:24,106 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:04:24,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-23 06:04:24,173 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-23 06:04:24,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:04:24,320 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 28 treesize of output 28 [2022-07-23 06:04:24,348 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 16 treesize of output 18 [2022-07-23 06:04:24,610 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 28 treesize of output 28 [2022-07-23 06:04:24,638 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 16 treesize of output 18 [2022-07-23 06:04:24,713 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 28 treesize of output 28 [2022-07-23 06:04:24,723 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 16 treesize of output 18 [2022-07-23 06:04:24,901 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 31 treesize of output 13 [2022-07-23 06:04:24,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2022-07-23 06:04:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:04:25,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:04:25,381 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_append_~head.offset))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_697) c_append_~head.base) .cse0) (_ bv9 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_696) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_697) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset)))) (bvule (bvadd .cse1 (_ bv5 32)) (bvadd .cse1 (_ bv9 32)))))) is different from false [2022-07-23 06:04:35,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:35,110 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 125 treesize of output 126 [2022-07-23 06:04:35,121 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 303 treesize of output 289 [2022-07-23 06:04:35,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:35,155 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 289 treesize of output 239 [2022-07-23 06:04:35,271 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:35,271 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 248 treesize of output 266 [2022-07-23 06:04:35,328 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 645 treesize of output 447 [2022-07-23 06:04:35,378 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 1112 treesize of output 1034 [2022-07-23 06:04:35,411 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 941 treesize of output 893 [2022-07-23 06:04:35,427 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 893 treesize of output 829 [2022-07-23 06:04:35,448 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 829 treesize of output 805 [2022-07-23 06:04:35,462 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 805 treesize of output 757 [2022-07-23 06:04:35,476 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 757 treesize of output 725 [2022-07-23 06:04:39,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:39,200 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 54 treesize of output 55 [2022-07-23 06:04:39,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:39,229 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 44 treesize of output 45 [2022-07-23 06:04:39,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:39,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 149 [2022-07-23 06:04:39,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:39,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 440 treesize of output 425 [2022-07-23 06:04:39,450 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 406 treesize of output 390 [2022-07-23 06:04:39,470 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 390 treesize of output 358 [2022-07-23 06:04:39,487 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 358 treesize of output 326 [2022-07-23 06:04:39,514 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 170 treesize of output 154