./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 6c24879c 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-?-6c24879 [2022-07-12 18:43:48,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:43:48,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:43:48,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:43:48,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:43:48,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:43:48,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:43:48,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:43:48,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:43:48,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:43:48,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:43:48,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:43:48,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:43:48,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:43:48,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:43:48,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:43:48,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:43:48,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:43:48,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:43:48,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:43:48,398 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:43:48,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:43:48,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:43:48,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:43:48,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:43:48,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:43:48,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:43:48,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:43:48,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:43:48,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:43:48,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:43:48,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:43:48,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:43:48,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:43:48,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:43:48,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:43:48,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:43:48,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:43:48,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:43:48,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:43:48,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:43:48,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:43:48,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:43:48,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:43:48,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:43:48,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:43:48,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:43:48,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:43:48,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:43:48,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:43:48,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:43:48,442 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:43:48,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:43:48,443 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:43:48,443 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:43:48,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:43:48,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:43:48,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:43:48,443 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:43:48,443 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:43:48,443 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:43:48,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:43:48,444 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:43:48,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:43:48,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:43:48,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:43:48,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:43:48,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:43:48,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:43:48,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:43:48,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:43:48,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:43:48,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:43:48,446 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-12 18:43:48,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:43:48,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:43:48,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:43:48,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:43:48,663 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:43:48,664 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-12 18:43:48,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498e3155f/ca5fae36193841269b60c5a50c0c5acc/FLAGfb1ee52af [2022-07-12 18:43:49,110 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:43:49,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-12 18:43:49,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498e3155f/ca5fae36193841269b60c5a50c0c5acc/FLAGfb1ee52af [2022-07-12 18:43:49,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498e3155f/ca5fae36193841269b60c5a50c0c5acc [2022-07-12 18:43:49,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:43:49,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:43:49,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:43:49,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:43:49,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:43:49,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4356158e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49, skipping insertion in model container [2022-07-12 18:43:49,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:43:49,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:43:49,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:43:49,456 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:43:49,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:43:49,514 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:43:49,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49 WrapperNode [2022-07-12 18:43:49,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:43:49,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:43:49,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:43:49,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:43:49,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,568 INFO L137 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 304 [2022-07-12 18:43:49,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:43:49,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:43:49,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:43:49,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:43:49,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:43:49,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:43:49,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:43:49,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:43:49,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (1/1) ... [2022-07-12 18:43:49,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:43:49,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:43:49,640 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-12 18:43:49,642 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-12 18:43:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:43:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:43:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:43:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:43:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:43:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:43:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:43:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:43:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:43:49,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:43:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-12 18:43:49,665 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-12 18:43:49,812 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:43:49,813 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:43:50,362 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:43:50,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:43:50,369 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-12 18:43:50,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:43:50 BoogieIcfgContainer [2022-07-12 18:43:50,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:43:50,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:43:50,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:43:50,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:43:50,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:43:49" (1/3) ... [2022-07-12 18:43:50,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b40d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:43:50, skipping insertion in model container [2022-07-12 18:43:50,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:49" (2/3) ... [2022-07-12 18:43:50,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b40d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:43:50, skipping insertion in model container [2022-07-12 18:43:50,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:43:50" (3/3) ... [2022-07-12 18:43:50,377 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2022-07-12 18:43:50,387 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:43:50,387 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-12 18:43:50,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:43:50,442 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@3af9c3a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2141c13e [2022-07-12 18:43:50,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-12 18:43:50,447 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-12 18:43:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:43:50,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:50,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:43:50,457 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-12 18:43:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:43:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:50,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600523081] [2022-07-12 18:43:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:43:50,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:50,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600523081] [2022-07-12 18:43:50,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600523081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:50,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:50,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:43:50,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079904336] [2022-07-12 18:43:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:50,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:43:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:43:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:43:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:43:50,626 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-12 18:43:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:43:50,959 INFO L93 Difference]: Finished difference Result 548 states and 601 transitions. [2022-07-12 18:43:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:43:50,961 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-12 18:43:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:43:50,969 INFO L225 Difference]: With dead ends: 548 [2022-07-12 18:43:50,969 INFO L226 Difference]: Without dead ends: 546 [2022-07-12 18:43:50,970 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-12 18:43:50,972 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:43:50,972 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.2s Time] [2022-07-12 18:43:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-12 18:43:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 407. [2022-07-12 18:43:51,017 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-12 18:43:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2022-07-12 18:43:51,021 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 3 [2022-07-12 18:43:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:43:51,021 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2022-07-12 18:43:51,021 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-12 18:43:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2022-07-12 18:43:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:43:51,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:51,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:43:51,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:43:51,022 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-12 18:43:51,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:51,023 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:43:51,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:51,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953753844] [2022-07-12 18:43:51,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:51,057 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-12 18:43:51,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:51,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953753844] [2022-07-12 18:43:51,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953753844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:51,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:51,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:43:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683597280] [2022-07-12 18:43:51,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:51,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:43:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:43:51,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:43:51,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:43:51,061 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-12 18:43:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:43:51,212 INFO L93 Difference]: Finished difference Result 408 states and 547 transitions. [2022-07-12 18:43:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:43:51,212 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-12 18:43:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:43:51,214 INFO L225 Difference]: With dead ends: 408 [2022-07-12 18:43:51,214 INFO L226 Difference]: Without dead ends: 408 [2022-07-12 18:43:51,215 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-12 18:43:51,216 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-12 18:43:51,217 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-12 18:43:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-12 18:43:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2022-07-12 18:43:51,254 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-12 18:43:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 542 transitions. [2022-07-12 18:43:51,256 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 542 transitions. Word has length 3 [2022-07-12 18:43:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:43:51,256 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 542 transitions. [2022-07-12 18:43:51,256 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-12 18:43:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 542 transitions. [2022-07-12 18:43:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:43:51,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:51,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:43:51,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:43:51,258 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-12 18:43:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1117390162, now seen corresponding path program 1 times [2022-07-12 18:43:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:51,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122216077] [2022-07-12 18:43:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:51,293 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-12 18:43:51,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:51,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122216077] [2022-07-12 18:43:51,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122216077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:51,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:51,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:43:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097282756] [2022-07-12 18:43:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:43:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:43:51,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:43:51,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:43:51,296 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-12 18:43:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:43:51,428 INFO L93 Difference]: Finished difference Result 400 states and 537 transitions. [2022-07-12 18:43:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:43:51,429 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-12 18:43:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:43:51,431 INFO L225 Difference]: With dead ends: 400 [2022-07-12 18:43:51,431 INFO L226 Difference]: Without dead ends: 400 [2022-07-12 18:43:51,431 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-12 18:43:51,432 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-12 18:43:51,433 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-12 18:43:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-12 18:43:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2022-07-12 18:43:51,442 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-12 18:43:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 537 transitions. [2022-07-12 18:43:51,443 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 537 transitions. Word has length 10 [2022-07-12 18:43:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:43:51,444 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 537 transitions. [2022-07-12 18:43:51,444 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-12 18:43:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 537 transitions. [2022-07-12 18:43:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:43:51,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:51,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:43:51,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:43:51,445 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-12 18:43:51,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1117390163, now seen corresponding path program 1 times [2022-07-12 18:43:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:51,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188638622] [2022-07-12 18:43:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:51,491 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-12 18:43:51,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:51,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188638622] [2022-07-12 18:43:51,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188638622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:51,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:51,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:43:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525049259] [2022-07-12 18:43:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:51,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:43:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:43:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:43:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:43:51,494 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-12 18:43:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:43:51,628 INFO L93 Difference]: Finished difference Result 395 states and 532 transitions. [2022-07-12 18:43:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:43:51,629 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-12 18:43:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:43:51,630 INFO L225 Difference]: With dead ends: 395 [2022-07-12 18:43:51,630 INFO L226 Difference]: Without dead ends: 395 [2022-07-12 18:43:51,630 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-12 18:43:51,631 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-12 18:43:51,632 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-12 18:43:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-12 18:43:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-07-12 18:43:51,638 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-12 18:43:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 532 transitions. [2022-07-12 18:43:51,639 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 532 transitions. Word has length 10 [2022-07-12 18:43:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:43:51,639 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 532 transitions. [2022-07-12 18:43:51,640 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-12 18:43:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 532 transitions. [2022-07-12 18:43:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:43:51,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:51,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:43:51,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:43:51,641 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-12 18:43:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash 279357079, now seen corresponding path program 1 times [2022-07-12 18:43:51,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:51,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982420699] [2022-07-12 18:43:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:51,692 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-12 18:43:51,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982420699] [2022-07-12 18:43:51,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982420699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:51,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:51,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:43:51,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809111019] [2022-07-12 18:43:51,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:51,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:43:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:43:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:43:51,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:43:51,707 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-12 18:43:52,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:43:52,151 INFO L93 Difference]: Finished difference Result 523 states and 574 transitions. [2022-07-12 18:43:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:43:52,152 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-12 18:43:52,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:43:52,154 INFO L225 Difference]: With dead ends: 523 [2022-07-12 18:43:52,154 INFO L226 Difference]: Without dead ends: 523 [2022-07-12 18:43:52,154 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-12 18:43:52,156 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:43:52,156 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.4s Time] [2022-07-12 18:43:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-12 18:43:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 387. [2022-07-12 18:43:52,163 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-12 18:43:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 524 transitions. [2022-07-12 18:43:52,165 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 524 transitions. Word has length 11 [2022-07-12 18:43:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:43:52,165 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 524 transitions. [2022-07-12 18:43:52,165 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-12 18:43:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2022-07-12 18:43:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:43:52,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:52,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:43:52,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:43:52,167 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-12 18:43:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash 279357080, now seen corresponding path program 1 times [2022-07-12 18:43:52,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:52,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979894417] [2022-07-12 18:43:52,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:52,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:52,239 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-12 18:43:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:52,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979894417] [2022-07-12 18:43:52,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979894417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:52,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:52,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:43:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183709966] [2022-07-12 18:43:52,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:52,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:43:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:43:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:43:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:43:52,242 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-12 18:43:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:43:52,776 INFO L93 Difference]: Finished difference Result 513 states and 564 transitions. [2022-07-12 18:43:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:43:52,777 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-12 18:43:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:43:52,778 INFO L225 Difference]: With dead ends: 513 [2022-07-12 18:43:52,779 INFO L226 Difference]: Without dead ends: 513 [2022-07-12 18:43:52,779 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-12 18:43:52,779 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 804 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:43:52,780 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.5s Time] [2022-07-12 18:43:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-12 18:43:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 378. [2022-07-12 18:43:52,785 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-12 18:43:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2022-07-12 18:43:52,786 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 11 [2022-07-12 18:43:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:43:52,787 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2022-07-12 18:43:52,787 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-12 18:43:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2022-07-12 18:43:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:43:52,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:52,788 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-12 18:43:52,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:43:52,788 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-12 18:43:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash 693745101, now seen corresponding path program 1 times [2022-07-12 18:43:52,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:52,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758206334] [2022-07-12 18:43:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:52,873 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-12 18:43:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:52,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758206334] [2022-07-12 18:43:52,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758206334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:52,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:52,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:43:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368165752] [2022-07-12 18:43:52,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:52,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:43:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:43:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:43:52,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:43:52,876 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-12 18:43:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:43:53,128 INFO L93 Difference]: Finished difference Result 398 states and 537 transitions. [2022-07-12 18:43:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:43:53,128 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-12 18:43:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:43:53,130 INFO L225 Difference]: With dead ends: 398 [2022-07-12 18:43:53,130 INFO L226 Difference]: Without dead ends: 398 [2022-07-12 18:43:53,130 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-12 18:43:53,130 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-12 18:43:53,131 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-12 18:43:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-12 18:43:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 386. [2022-07-12 18:43:53,136 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-12 18:43:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2022-07-12 18:43:53,137 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 20 [2022-07-12 18:43:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:43:53,137 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2022-07-12 18:43:53,137 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-12 18:43:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2022-07-12 18:43:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:43:53,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:53,138 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-12 18:43:53,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:43:53,138 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-12 18:43:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash -964577360, now seen corresponding path program 1 times [2022-07-12 18:43:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:53,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005930545] [2022-07-12 18:43:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:53,298 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-12 18:43:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:53,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005930545] [2022-07-12 18:43:53,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005930545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:53,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:53,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:43:53,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160466374] [2022-07-12 18:43:53,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:53,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:43:53,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:43:53,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:43:53,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:43:53,300 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-12 18:43:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:43:53,847 INFO L93 Difference]: Finished difference Result 526 states and 579 transitions. [2022-07-12 18:43:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:43:53,848 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-12 18:43:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:43:53,850 INFO L225 Difference]: With dead ends: 526 [2022-07-12 18:43:53,850 INFO L226 Difference]: Without dead ends: 526 [2022-07-12 18:43:53,850 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-12 18:43:53,851 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-12 18:43:53,851 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-12 18:43:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-12 18:43:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 389. [2022-07-12 18:43:53,858 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-12 18:43:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2022-07-12 18:43:53,860 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 22 [2022-07-12 18:43:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:43:53,860 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2022-07-12 18:43:53,861 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-12 18:43:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2022-07-12 18:43:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 18:43:53,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:53,862 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-12 18:43:53,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:43:53,862 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-12 18:43:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash -339455757, now seen corresponding path program 1 times [2022-07-12 18:43:53,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:43:53,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751351474] [2022-07-12 18:43:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:53,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:43:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 18:43:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:54,225 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-12 18:43:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:43:54,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751351474] [2022-07-12 18:43:54,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751351474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:43:54,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694622236] [2022-07-12 18:43:54,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:54,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:43:54,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:43:54,228 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-12 18:43:54,239 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-12 18:43:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:54,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 18:43:54,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:43:54,416 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-12 18:43:54,586 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-12 18:43:54,636 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:43:54,636 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-12 18:43:54,656 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-12 18:43:54,722 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:43:54,722 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-12 18:43:54,727 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 18:43:54,752 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-12 18:43:54,951 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-12 18:43:54,951 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 18:43:54,954 INFO L158 Benchmark]: Toolchain (without parser) took 5820.35ms. Allocated memory was 121.6MB in the beginning and 190.8MB in the end (delta: 69.2MB). Free memory was 88.0MB in the beginning and 151.1MB in the end (delta: -63.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-07-12 18:43:54,954 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:43:54,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.23ms. Allocated memory is still 121.6MB. Free memory was 87.6MB in the beginning and 88.1MB in the end (delta: -584.0kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 18:43:54,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.09ms. Allocated memory is still 121.6MB. Free memory was 88.1MB in the beginning and 85.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:43:54,955 INFO L158 Benchmark]: Boogie Preprocessor took 44.95ms. Allocated memory is still 121.6MB. Free memory was 85.4MB in the beginning and 82.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:43:54,955 INFO L158 Benchmark]: RCFGBuilder took 755.36ms. Allocated memory is still 121.6MB. Free memory was 82.3MB in the beginning and 44.1MB in the end (delta: 38.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-12 18:43:54,955 INFO L158 Benchmark]: TraceAbstraction took 4581.55ms. Allocated memory was 121.6MB in the beginning and 190.8MB in the end (delta: 69.2MB). Free memory was 43.1MB in the beginning and 151.1MB in the end (delta: -107.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:43:54,956 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.16ms. Allocated memory is still 79.7MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.23ms. Allocated memory is still 121.6MB. Free memory was 87.6MB in the beginning and 88.1MB in the end (delta: -584.0kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.09ms. Allocated memory is still 121.6MB. Free memory was 88.1MB in the beginning and 85.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.95ms. Allocated memory is still 121.6MB. Free memory was 85.4MB in the beginning and 82.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 755.36ms. Allocated memory is still 121.6MB. Free memory was 82.3MB in the beginning and 44.1MB in the end (delta: 38.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4581.55ms. Allocated memory was 121.6MB in the beginning and 190.8MB in the end (delta: 69.2MB). Free memory was 43.1MB in the beginning and 151.1MB in the end (delta: -107.9MB). There was no memory consumed. 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-12 18:43:54,979 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-?-6c24879 [2022-07-12 18:43:56,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:43:56,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:43:56,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:43:56,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:43:56,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:43:56,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:43:56,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:43:56,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:43:56,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:43:56,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:43:56,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:43:56,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:43:56,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:43:56,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:43:56,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:43:56,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:43:56,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:43:56,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:43:56,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:43:56,742 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:43:56,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:43:56,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:43:56,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:43:56,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:43:56,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:43:56,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:43:56,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:43:56,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:43:56,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:43:56,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:43:56,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:43:56,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:43:56,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:43:56,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:43:56,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:43:56,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:43:56,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:43:56,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:43:56,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:43:56,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:43:56,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:43:56,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:43:56,788 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:43:56,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:43:56,789 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:43:56,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:43:56,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:43:56,790 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:43:56,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:43:56,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:43:56,790 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:43:56,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:43:56,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:43:56,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:43:56,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:43:56,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:43:56,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:43:56,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:43:56,792 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:43:56,792 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:43:56,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:43:56,793 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:43:56,793 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:43:56,793 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:43:56,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:43:56,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:43:56,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:43:56,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:43:56,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:43:56,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:43:56,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:43:56,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:43:56,795 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:43:56,795 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:43:56,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:43:56,795 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-12 18:43:57,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:43:57,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:43:57,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:43:57,065 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:43:57,065 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:43:57,067 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-12 18:43:57,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9266bb5/259cb478ae9e4ddab7b91d41151b44ba/FLAG26d5653a3 [2022-07-12 18:43:57,472 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:43:57,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-12 18:43:57,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9266bb5/259cb478ae9e4ddab7b91d41151b44ba/FLAG26d5653a3 [2022-07-12 18:43:57,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9266bb5/259cb478ae9e4ddab7b91d41151b44ba [2022-07-12 18:43:57,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:43:57,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:43:57,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:43:57,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:43:57,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:43:57,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:43:57" (1/1) ... [2022-07-12 18:43:57,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599a4129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:57, skipping insertion in model container [2022-07-12 18:43:57,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:43:57" (1/1) ... [2022-07-12 18:43:57,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:43:57,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:43:58,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:43:58,108 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:43:58,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:43:58,175 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:43:58,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58 WrapperNode [2022-07-12 18:43:58,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:43:58,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:43:58,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:43:58,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:43:58,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,211 INFO L137 Inliner]: procedures = 126, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 294 [2022-07-12 18:43:58,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:43:58,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:43:58,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:43:58,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:43:58,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:43:58,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:43:58,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:43:58,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:43:58,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (1/1) ... [2022-07-12 18:43:58,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:43:58,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:43:58,294 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-12 18:43:58,300 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-12 18:43:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-12 18:43:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:43:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:43:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:43:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:43:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-12 18:43:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:43:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 18:43:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:43:58,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:43:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-12 18:43:58,320 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-12 18:43:58,434 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:43:58,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:43:59,219 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:43:59,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:43:59,227 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-12 18:43:59,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:43:59 BoogieIcfgContainer [2022-07-12 18:43:59,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:43:59,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:43:59,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:43:59,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:43:59,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:43:57" (1/3) ... [2022-07-12 18:43:59,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6baad7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:43:59, skipping insertion in model container [2022-07-12 18:43:59,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:43:58" (2/3) ... [2022-07-12 18:43:59,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6baad7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:43:59, skipping insertion in model container [2022-07-12 18:43:59,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:43:59" (3/3) ... [2022-07-12 18:43:59,235 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2022-07-12 18:43:59,244 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:43:59,244 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-12 18:43:59,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:43:59,283 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@4b3a190c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c0fcfff [2022-07-12 18:43:59,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-12 18:43:59,290 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-12 18:43:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:43:59,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:43:59,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:43:59,296 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-12 18:43:59,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:43:59,300 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:43:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:43:59,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764735209] [2022-07-12 18:43:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:43:59,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:43:59,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:43:59,310 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-12 18:43:59,326 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-12 18:43:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:43:59,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:43:59,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:43:59,419 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-12 18:43:59,426 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-12 18:43:59,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:43:59,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:43:59,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764735209] [2022-07-12 18:43:59,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764735209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:43:59,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:43:59,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:43:59,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479431558] [2022-07-12 18:43:59,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:43:59,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:43:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:43:59,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:43:59,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:43:59,459 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-12 18:44:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:44:00,053 INFO L93 Difference]: Finished difference Result 545 states and 598 transitions. [2022-07-12 18:44:00,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:44:00,055 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-12 18:44:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:44:00,063 INFO L225 Difference]: With dead ends: 545 [2022-07-12 18:44:00,063 INFO L226 Difference]: Without dead ends: 543 [2022-07-12 18:44:00,065 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-12 18:44:00,067 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 246 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:44:00,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 430 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:44:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-12 18:44:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 404. [2022-07-12 18:44:00,109 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-12 18:44:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 541 transitions. [2022-07-12 18:44:00,124 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 541 transitions. Word has length 3 [2022-07-12 18:44:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:44:00,124 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 541 transitions. [2022-07-12 18:44:00,125 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-12 18:44:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 541 transitions. [2022-07-12 18:44:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:44:00,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:44:00,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:44:00,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:44:00,333 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-12 18:44:00,334 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-12 18:44:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:44:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:44:00,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:44:00,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280655365] [2022-07-12 18:44:00,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:00,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:44:00,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:44:00,337 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-12 18:44:00,338 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-12 18:44:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:00,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:44:00,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:00,387 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-12 18:44:00,395 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-12 18:44:00,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:44:00,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:44:00,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280655365] [2022-07-12 18:44:00,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280655365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:44:00,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:44:00,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:44:00,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306904278] [2022-07-12 18:44:00,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:44:00,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:44:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:44:00,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:44:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:44:00,398 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-12 18:44:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:44:00,786 INFO L93 Difference]: Finished difference Result 405 states and 544 transitions. [2022-07-12 18:44:00,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:44:00,787 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-12 18:44:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:44:00,789 INFO L225 Difference]: With dead ends: 405 [2022-07-12 18:44:00,789 INFO L226 Difference]: Without dead ends: 405 [2022-07-12 18:44:00,789 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-12 18:44:00,790 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:44:00,791 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.4s Time] [2022-07-12 18:44:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-12 18:44:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2022-07-12 18:44:00,808 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-12 18:44:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 539 transitions. [2022-07-12 18:44:00,811 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 539 transitions. Word has length 3 [2022-07-12 18:44:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:44:00,811 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 539 transitions. [2022-07-12 18:44:00,811 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-12 18:44:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 539 transitions. [2022-07-12 18:44:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:44:00,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:44:00,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:44:00,820 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-12 18:44:01,018 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-12 18:44:01,019 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-12 18:44:01,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:44:01,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1117387183, now seen corresponding path program 1 times [2022-07-12 18:44:01,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:44:01,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151947007] [2022-07-12 18:44:01,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:01,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:44:01,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:44:01,022 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-12 18:44:01,023 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-12 18:44:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:01,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:44:01,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:01,105 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-12 18:44:01,108 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-12 18:44:01,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:44:01,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:44:01,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151947007] [2022-07-12 18:44:01,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151947007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:44:01,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:44:01,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:44:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175793123] [2022-07-12 18:44:01,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:44:01,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:44:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:44:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:44:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:44:01,111 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-12 18:44:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:44:01,361 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2022-07-12 18:44:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:44:01,362 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-12 18:44:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:44:01,363 INFO L225 Difference]: With dead ends: 397 [2022-07-12 18:44:01,363 INFO L226 Difference]: Without dead ends: 397 [2022-07-12 18:44:01,364 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-12 18:44:01,364 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 43 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:44:01,365 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.2s Time] [2022-07-12 18:44:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-12 18:44:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-07-12 18:44:01,372 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-12 18:44:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2022-07-12 18:44:01,374 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 10 [2022-07-12 18:44:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:44:01,374 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2022-07-12 18:44:01,374 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-12 18:44:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2022-07-12 18:44:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:44:01,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:44:01,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:44:01,383 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-12 18:44:01,581 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-12 18:44:01,581 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-12 18:44:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:44:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1117387184, now seen corresponding path program 1 times [2022-07-12 18:44:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:44:01,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824247105] [2022-07-12 18:44:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:01,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:44:01,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:44:01,584 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-12 18:44:01,585 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-12 18:44:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:01,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:44:01,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:01,652 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-12 18:44:01,659 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-12 18:44:01,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:44:01,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:44:01,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824247105] [2022-07-12 18:44:01,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824247105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:44:01,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:44:01,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:44:01,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768315785] [2022-07-12 18:44:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:44:01,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:44:01,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:44:01,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:44:01,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:44:01,662 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-12 18:44:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:44:02,049 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2022-07-12 18:44:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:44:02,049 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-12 18:44:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:44:02,051 INFO L225 Difference]: With dead ends: 392 [2022-07-12 18:44:02,051 INFO L226 Difference]: Without dead ends: 392 [2022-07-12 18:44:02,052 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-12 18:44:02,052 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 38 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:44:02,052 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.4s Time] [2022-07-12 18:44:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-12 18:44:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-07-12 18:44:02,058 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-12 18:44:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2022-07-12 18:44:02,060 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 10 [2022-07-12 18:44:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:44:02,060 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2022-07-12 18:44:02,060 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-12 18:44:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2022-07-12 18:44:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:44:02,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:44:02,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:44:02,069 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-12 18:44:02,269 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-12 18:44:02,270 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-12 18:44:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:44:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash 279264727, now seen corresponding path program 1 times [2022-07-12 18:44:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:44:02,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682669085] [2022-07-12 18:44:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:02,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:44:02,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:44:02,272 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-12 18:44:02,274 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-12 18:44:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:02,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:44:02,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:02,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:44:02,374 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:44:02,374 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-12 18:44:02,398 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-12 18:44:02,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:44:02,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:44:02,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682669085] [2022-07-12 18:44:02,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682669085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:44:02,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:44:02,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:44:02,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507199339] [2022-07-12 18:44:02,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:44:02,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:44:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:44:02,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:44:02,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:44:02,400 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-12 18:44:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:44:03,029 INFO L93 Difference]: Finished difference Result 520 states and 571 transitions. [2022-07-12 18:44:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:44:03,030 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-12 18:44:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:44:03,031 INFO L225 Difference]: With dead ends: 520 [2022-07-12 18:44:03,031 INFO L226 Difference]: Without dead ends: 520 [2022-07-12 18:44:03,032 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-12 18:44:03,032 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 314 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:44:03,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 639 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:44:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-12 18:44:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 384. [2022-07-12 18:44:03,037 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-12 18:44:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 521 transitions. [2022-07-12 18:44:03,039 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 521 transitions. Word has length 11 [2022-07-12 18:44:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:44:03,039 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 521 transitions. [2022-07-12 18:44:03,039 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-12 18:44:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 521 transitions. [2022-07-12 18:44:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:44:03,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:44:03,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:44:03,059 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-12 18:44:03,248 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-12 18:44:03,248 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-12 18:44:03,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:44:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash 279264728, now seen corresponding path program 1 times [2022-07-12 18:44:03,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:44:03,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271852922] [2022-07-12 18:44:03,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:03,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:44:03,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:44:03,250 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-12 18:44:03,250 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-12 18:44:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:03,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 18:44:03,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:03,337 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-12 18:44:03,341 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-12 18:44:03,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:44:03,440 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-12 18:44:03,447 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:44:03,447 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-12 18:44:03,463 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-12 18:44:03,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:44:03,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:44:03,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271852922] [2022-07-12 18:44:03,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271852922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:44:03,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:44:03,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:44:03,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214607519] [2022-07-12 18:44:03,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:44:03,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:44:03,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:44:03,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:44:03,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:44:03,465 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-12 18:44:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:44:04,477 INFO L93 Difference]: Finished difference Result 511 states and 562 transitions. [2022-07-12 18:44:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:44:04,478 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-12 18:44:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:44:04,479 INFO L225 Difference]: With dead ends: 511 [2022-07-12 18:44:04,479 INFO L226 Difference]: Without dead ends: 511 [2022-07-12 18:44:04,479 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-12 18:44:04,480 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 298 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:44:04,480 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.0s Time] [2022-07-12 18:44:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-07-12 18:44:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 376. [2022-07-12 18:44:04,485 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-12 18:44:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 512 transitions. [2022-07-12 18:44:04,486 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 512 transitions. Word has length 11 [2022-07-12 18:44:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:44:04,486 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 512 transitions. [2022-07-12 18:44:04,486 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-12 18:44:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 512 transitions. [2022-07-12 18:44:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:44:04,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:44:04,487 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-12 18:44:04,495 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-12 18:44:04,693 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-12 18:44:04,694 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-12 18:44:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:44:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 314804234, now seen corresponding path program 1 times [2022-07-12 18:44:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:44:04,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653519905] [2022-07-12 18:44:04,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:04,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:44:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:44:04,696 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-12 18:44:04,698 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-12 18:44:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:04,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:44:04,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:04,798 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-12 18:44:04,826 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-12 18:44:04,831 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-12 18:44:04,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:44:04,852 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-12 18:44:04,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:44:04,858 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-12 18:44:04,915 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:44:04,915 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-12 18:44:04,949 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-12 18:44:04,955 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-12 18:44:04,972 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-12 18:44:04,974 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-12 18:44:04,995 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-12 18:44:04,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:44:04,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:44:04,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653519905] [2022-07-12 18:44:04,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653519905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:44:04,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:44:04,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:44:04,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723299167] [2022-07-12 18:44:04,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:44:04,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:44:04,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:44:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:44:04,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:44:04,997 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-12 18:44:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:44:05,608 INFO L93 Difference]: Finished difference Result 396 states and 535 transitions. [2022-07-12 18:44:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:44:05,608 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-12 18:44:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:44:05,610 INFO L225 Difference]: With dead ends: 396 [2022-07-12 18:44:05,610 INFO L226 Difference]: Without dead ends: 396 [2022-07-12 18:44:05,610 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-12 18:44:05,611 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:44:05,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1823 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:44:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-12 18:44:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 384. [2022-07-12 18:44:05,620 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-12 18:44:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 522 transitions. [2022-07-12 18:44:05,622 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 522 transitions. Word has length 20 [2022-07-12 18:44:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:44:05,622 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 522 transitions. [2022-07-12 18:44:05,622 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-12 18:44:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 522 transitions. [2022-07-12 18:44:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:44:05,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:44:05,622 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-12 18:44:05,633 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-12 18:44:05,823 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-12 18:44:05,823 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-12 18:44:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:44:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash -54530483, now seen corresponding path program 1 times [2022-07-12 18:44:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:44:05,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574622671] [2022-07-12 18:44:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:05,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:44:05,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:44:05,825 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-12 18:44:05,827 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-12 18:44:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:05,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 18:44:05,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:05,932 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-12 18:44:05,941 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-12 18:44:05,946 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-12 18:44:06,033 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:44:06,033 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-12 18:44:06,073 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-12 18:44:06,078 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-12 18:44:06,110 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-12 18:44:06,114 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-12 18:44:06,136 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-12 18:44:06,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:44:06,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:44:06,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574622671] [2022-07-12 18:44:06,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574622671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:44:06,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:44:06,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:44:06,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895765109] [2022-07-12 18:44:06,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:44:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:44:06,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:44:06,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:44:06,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:44:06,138 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-12 18:44:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:44:07,224 INFO L93 Difference]: Finished difference Result 524 states and 577 transitions. [2022-07-12 18:44:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:44:07,225 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-12 18:44:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:44:07,226 INFO L225 Difference]: With dead ends: 524 [2022-07-12 18:44:07,226 INFO L226 Difference]: Without dead ends: 524 [2022-07-12 18:44:07,227 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-12 18:44:07,227 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 249 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:44:07,227 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.0s Time] [2022-07-12 18:44:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-12 18:44:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 387. [2022-07-12 18:44:07,239 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-12 18:44:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 525 transitions. [2022-07-12 18:44:07,241 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 525 transitions. Word has length 22 [2022-07-12 18:44:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:44:07,241 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 525 transitions. [2022-07-12 18:44:07,241 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-12 18:44:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 525 transitions. [2022-07-12 18:44:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:44:07,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:44:07,243 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-12 18:44:07,262 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-12 18:44:07,451 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-12 18:44:07,452 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-12 18:44:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:44:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 67877176, now seen corresponding path program 1 times [2022-07-12 18:44:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:44:07,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872461284] [2022-07-12 18:44:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:07,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:44:07,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:44:07,453 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-12 18:44:07,454 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-12 18:44:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:07,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 18:44:07,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:07,642 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 18:44:07,643 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-12 18:44:07,803 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-12 18:44:07,856 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:44:07,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, 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-12 18:44:07,869 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-12 18:44:07,921 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:44:07,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-12 18:44:08,033 INFO L356 Elim1Store]: treesize reduction 128, result has 20.5 percent of original size [2022-07-12 18:44:08,033 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-12 18:44:08,232 INFO L356 Elim1Store]: treesize reduction 99, result has 33.1 percent of original size [2022-07-12 18:44:08,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 87 treesize of output 120 [2022-07-12 18:44:08,370 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-12 18:44:08,590 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-12 18:44:08,658 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-12 18:44:08,798 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-12 18:44:08,847 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-12 18:44:08,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:44:08,905 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-12 18:44:08,974 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-12 18:44:08,984 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-12 18:44:09,107 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:44:09,108 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-12 18:44:09,113 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-12 18:44:09,122 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-12 18:44:09,125 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-12 18:44:13,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:44:13,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872461284] [2022-07-12 18:44:13,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872461284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:44:13,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2062662292] [2022-07-12 18:44:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:44:13,266 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:44:13,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:44:13,267 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-12 18:44:13,267 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-12 18:44:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:44:13,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 18:44:13,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:44:13,627 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:44:13,627 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-12 18:44:13,752 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-12 18:44:13,770 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:44:13,770 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-12 18:44:13,778 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-12 18:44:13,817 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:44:13,818 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-12 18:44:13,874 INFO L356 Elim1Store]: treesize reduction 138, result has 14.3 percent of original size [2022-07-12 18:44:13,874 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-12 18:44:14,067 INFO L356 Elim1Store]: treesize reduction 89, result has 33.6 percent of original size [2022-07-12 18:44:14,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 107 treesize of output 138 [2022-07-12 18:44:14,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-12 18:44:14,435 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 43 treesize of output 39 [2022-07-12 18:44:14,488 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 43 treesize of output 39 [2022-07-12 18:44:14,559 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 36 treesize of output 20 [2022-07-12 18:44:14,628 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-12 18:44:14,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:44:14,638 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-12 18:44:14,672 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-12 18:44:14,683 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-12 18:44:14,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:44:14,793 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-12 18:44:14,796 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-12 18:44:14,801 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-12 18:44:14,804 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-12 18:44:14,820 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 18:44:14,839 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-12 18:44:15,033 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-12 18:44:15,224 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-12 18:44:15,225 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Quantifier not flattened at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForLocalEliminatees.pushLocalEliminateesOverCorrespondingFiniteJunction(QuantifierPushUtilsForLocalEliminatees.java:97) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) 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-12 18:44:15,228 INFO L158 Benchmark]: Toolchain (without parser) took 17370.68ms. Allocated memory was 56.6MB in the beginning and 86.0MB in the end (delta: 29.4MB). Free memory was 40.0MB in the beginning and 26.1MB in the end (delta: 13.9MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-07-12 18:44:15,228 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 28.1MB in the beginning and 28.1MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:44:15,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.14ms. Allocated memory is still 56.6MB. Free memory was 39.8MB in the beginning and 30.6MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:44:15,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.24ms. Allocated memory is still 56.6MB. Free memory was 30.6MB in the beginning and 27.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 18:44:15,228 INFO L158 Benchmark]: Boogie Preprocessor took 52.49ms. Allocated memory is still 56.6MB. Free memory was 27.6MB in the beginning and 37.9MB in the end (delta: -10.4MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-07-12 18:44:15,228 INFO L158 Benchmark]: RCFGBuilder took 956.52ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 37.9MB in the beginning and 35.1MB in the end (delta: 2.9MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-07-12 18:44:15,228 INFO L158 Benchmark]: TraceAbstraction took 15997.35ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 34.7MB in the beginning and 26.1MB in the end (delta: 8.6MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2022-07-12 18:44:15,229 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 28.1MB in the beginning and 28.1MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.14ms. Allocated memory is still 56.6MB. Free memory was 39.8MB in the beginning and 30.6MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.24ms. Allocated memory is still 56.6MB. Free memory was 30.6MB in the beginning and 27.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.49ms. Allocated memory is still 56.6MB. Free memory was 27.6MB in the beginning and 37.9MB in the end (delta: -10.4MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * RCFGBuilder took 956.52ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 37.9MB in the beginning and 35.1MB in the end (delta: 2.9MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15997.35ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 34.7MB in the beginning and 26.1MB in the end (delta: 8.6MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Quantifier not flattened de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Quantifier not flattened: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:180) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 18:44:15,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Quantifier not flattened