./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 35987657 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/forester-heap/sll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503a3e49b44041609ec1bba765b53912c88abb90ff278e61e68e863904faf4bb --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 16:41:45,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 16:41:45,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 16:41:45,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 16:41:45,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 16:41:45,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 16:41:45,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 16:41:45,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 16:41:45,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 16:41:45,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 16:41:45,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 16:41:45,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 16:41:45,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 16:41:45,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 16:41:45,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 16:41:45,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 16:41:45,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 16:41:45,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 16:41:45,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 16:41:45,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 16:41:45,490 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 16:41:45,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 16:41:45,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 16:41:45,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 16:41:45,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 16:41:45,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 16:41:45,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 16:41:45,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 16:41:45,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 16:41:45,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 16:41:45,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 16:41:45,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 16:41:45,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 16:41:45,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 16:41:45,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 16:41:45,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 16:41:45,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 16:41:45,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 16:41:45,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 16:41:45,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 16:41:45,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 16:41:45,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 16:41:45,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-21 16:41:45,527 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 16:41:45,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 16:41:45,530 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 16:41:45,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 16:41:45,531 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 16:41:45,531 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 16:41:45,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 16:41:45,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 16:41:45,532 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 16:41:45,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 16:41:45,533 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 16:41:45,533 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 16:41:45,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 16:41:45,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 16:41:45,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 16:41:45,534 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 16:41:45,534 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 16:41:45,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 16:41:45,534 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 16:41:45,534 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 16:41:45,535 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 16:41:45,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 16:41:45,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 16:41:45,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 16:41:45,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:41:45,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 16:41:45,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 16:41:45,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 16:41:45,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 16:41:45,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 503a3e49b44041609ec1bba765b53912c88abb90ff278e61e68e863904faf4bb [2022-07-21 16:41:45,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 16:41:45,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 16:41:45,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 16:41:45,800 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 16:41:45,800 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 16:41:45,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2022-07-21 16:41:45,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07fd34ec8/6a49ab72e9e44119ad6eebb2463b401a/FLAGa3ef1e3a6 [2022-07-21 16:41:46,283 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 16:41:46,285 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2022-07-21 16:41:46,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07fd34ec8/6a49ab72e9e44119ad6eebb2463b401a/FLAGa3ef1e3a6 [2022-07-21 16:41:46,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07fd34ec8/6a49ab72e9e44119ad6eebb2463b401a [2022-07-21 16:41:46,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 16:41:46,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 16:41:46,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 16:41:46,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 16:41:46,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 16:41:46,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96b792a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46, skipping insertion in model container [2022-07-21 16:41:46,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 16:41:46,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 16:41:46,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2022-07-21 16:41:46,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22606,22619] [2022-07-21 16:41:46,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2022-07-21 16:41:46,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22820,22833] [2022-07-21 16:41:46,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:41:46,627 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 16:41:46,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2022-07-21 16:41:46,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22606,22619] [2022-07-21 16:41:46,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2022-07-21 16:41:46,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22820,22833] [2022-07-21 16:41:46,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:41:46,678 INFO L208 MainTranslator]: Completed translation [2022-07-21 16:41:46,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46 WrapperNode [2022-07-21 16:41:46,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 16:41:46,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 16:41:46,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 16:41:46,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 16:41:46,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,714 INFO L137 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2022-07-21 16:41:46,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 16:41:46,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 16:41:46,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 16:41:46,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 16:41:46,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 16:41:46,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 16:41:46,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 16:41:46,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 16:41:46,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (1/1) ... [2022-07-21 16:41:46,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:41:46,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:46,767 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-21 16:41:46,775 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-21 16:41:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 16:41:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 16:41:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 16:41:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 16:41:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 16:41:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 16:41:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 16:41:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 16:41:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 16:41:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 16:41:46,876 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 16:41:46,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 16:41:47,183 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 16:41:47,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 16:41:47,188 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-21 16:41:47,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:41:47 BoogieIcfgContainer [2022-07-21 16:41:47,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 16:41:47,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 16:41:47,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 16:41:47,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 16:41:47,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:41:46" (1/3) ... [2022-07-21 16:41:47,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467e52f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:41:47, skipping insertion in model container [2022-07-21 16:41:47,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:41:46" (2/3) ... [2022-07-21 16:41:47,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467e52f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:41:47, skipping insertion in model container [2022-07-21 16:41:47,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:41:47" (3/3) ... [2022-07-21 16:41:47,195 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2022-07-21 16:41:47,210 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 16:41:47,211 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-07-21 16:41:47,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 16:41:47,262 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@17690f0e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e5afd78 [2022-07-21 16:41:47,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-07-21 16:41:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 132 states have internal predecessors, (153), 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-21 16:41:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 16:41:47,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:47,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 16:41:47,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 16:41:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:47,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188160520] [2022-07-21 16:41:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:47,411 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-21 16:41:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:47,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188160520] [2022-07-21 16:41:47,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188160520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:47,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:47,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219625279] [2022-07-21 16:41:47,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:47,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:47,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:47,442 INFO L87 Difference]: Start difference. First operand has 133 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 132 states have internal predecessors, (153), 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) 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-21 16:41:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:47,592 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2022-07-21 16:41:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:47,608 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-21 16:41:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:47,624 INFO L225 Difference]: With dead ends: 161 [2022-07-21 16:41:47,625 INFO L226 Difference]: Without dead ends: 159 [2022-07-21 16:41:47,626 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-21 16:41:47,628 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:47,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 100 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-21 16:41:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2022-07-21 16:41:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 132 states have internal predecessors, (141), 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-21 16:41:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2022-07-21 16:41:47,656 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 3 [2022-07-21 16:41:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:47,656 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2022-07-21 16:41:47,657 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-21 16:41:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2022-07-21 16:41:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 16:41:47,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:47,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 16:41:47,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 16:41:47,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 16:41:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950858507] [2022-07-21 16:41:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:47,704 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-21 16:41:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:47,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950858507] [2022-07-21 16:41:47,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950858507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:47,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:47,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970200812] [2022-07-21 16:41:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:47,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:47,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:47,707 INFO L87 Difference]: Start difference. First operand 133 states and 141 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-21 16:41:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:47,764 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-07-21 16:41:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:47,764 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-21 16:41:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:47,766 INFO L225 Difference]: With dead ends: 130 [2022-07-21 16:41:47,766 INFO L226 Difference]: Without dead ends: 130 [2022-07-21 16:41:47,766 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-21 16:41:47,767 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:47,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 73 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-21 16:41:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-21 16:41:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 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-21 16:41:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2022-07-21 16:41:47,774 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 3 [2022-07-21 16:41:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:47,775 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2022-07-21 16:41:47,775 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-21 16:41:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-07-21 16:41:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 16:41:47,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:47,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 16:41:47,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 16:41:47,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2022-07-21 16:41:47,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:47,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737567476] [2022-07-21 16:41:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:47,820 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-21 16:41:47,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:47,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737567476] [2022-07-21 16:41:47,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737567476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:47,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:47,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184473468] [2022-07-21 16:41:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:47,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:47,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:47,822 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:41:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:47,890 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2022-07-21 16:41:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-21 16:41:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:47,891 INFO L225 Difference]: With dead ends: 127 [2022-07-21 16:41:47,891 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 16:41:47,892 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-21 16:41:47,892 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 102 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:47,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 82 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 16:41:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-21 16:41:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 124 states have internal predecessors, (133), 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-21 16:41:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-07-21 16:41:47,898 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2022-07-21 16:41:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:47,899 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-07-21 16:41:47,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:41:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-07-21 16:41:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 16:41:47,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:47,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 16:41:47,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 16:41:47,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-07-21 16:41:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:47,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146568600] [2022-07-21 16:41:47,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:47,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:47,933 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-21 16:41:47,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:47,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146568600] [2022-07-21 16:41:47,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146568600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:47,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:47,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:47,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882806949] [2022-07-21 16:41:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:47,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:47,935 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:41:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:48,004 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2022-07-21 16:41:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-21 16:41:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:48,006 INFO L225 Difference]: With dead ends: 143 [2022-07-21 16:41:48,006 INFO L226 Difference]: Without dead ends: 143 [2022-07-21 16:41:48,006 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-21 16:41:48,007 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:48,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 91 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-21 16:41:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2022-07-21 16:41:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 129 states have internal predecessors, (138), 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-21 16:41:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2022-07-21 16:41:48,013 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 6 [2022-07-21 16:41:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:48,013 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2022-07-21 16:41:48,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:41:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2022-07-21 16:41:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:41:48,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:48,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:48,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 16:41:48,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash 171980525, now seen corresponding path program 1 times [2022-07-21 16:41:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:48,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827864122] [2022-07-21 16:41:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:48,063 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-21 16:41:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:48,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827864122] [2022-07-21 16:41:48,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827864122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:48,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:48,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:41:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524400648] [2022-07-21 16:41:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:48,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:41:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:48,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:41:48,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:41:48,065 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-21 16:41:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:48,168 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-07-21 16:41:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:41:48,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-07-21 16:41:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:48,169 INFO L225 Difference]: With dead ends: 134 [2022-07-21 16:41:48,169 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 16:41:48,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:41:48,170 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 161 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:48,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 16:41:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2022-07-21 16:41:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 120 states have internal predecessors, (131), 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-21 16:41:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-07-21 16:41:48,175 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 11 [2022-07-21 16:41:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:48,176 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-07-21 16:41:48,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-21 16:41:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-07-21 16:41:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:41:48,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:48,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:48,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 16:41:48,177 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:48,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 171980526, now seen corresponding path program 1 times [2022-07-21 16:41:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:48,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728749571] [2022-07-21 16:41:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:48,241 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-21 16:41:48,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:48,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728749571] [2022-07-21 16:41:48,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728749571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:48,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:48,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:41:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811015119] [2022-07-21 16:41:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:48,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:41:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:41:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:41:48,243 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-21 16:41:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:48,370 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2022-07-21 16:41:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:41:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-07-21 16:41:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:48,383 INFO L225 Difference]: With dead ends: 158 [2022-07-21 16:41:48,383 INFO L226 Difference]: Without dead ends: 158 [2022-07-21 16:41:48,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:41:48,389 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 149 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:48,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 102 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-21 16:41:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2022-07-21 16:41:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 127 states have internal predecessors, (139), 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-21 16:41:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-07-21 16:41:48,406 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 11 [2022-07-21 16:41:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:48,408 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-07-21 16:41:48,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-21 16:41:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-07-21 16:41:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 16:41:48,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:48,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:48,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 16:41:48,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:48,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:48,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2064509497, now seen corresponding path program 1 times [2022-07-21 16:41:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:48,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425660283] [2022-07-21 16:41:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:48,489 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-21 16:41:48,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:48,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425660283] [2022-07-21 16:41:48,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425660283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:48,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:48,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:48,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511633968] [2022-07-21 16:41:48,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:48,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:41:48,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:41:48,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:41:48,491 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-21 16:41:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:48,597 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-07-21 16:41:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:41:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-07-21 16:41:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:48,600 INFO L225 Difference]: With dead ends: 167 [2022-07-21 16:41:48,600 INFO L226 Difference]: Without dead ends: 167 [2022-07-21 16:41:48,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:41:48,601 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 230 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:48,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 129 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-21 16:41:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 129. [2022-07-21 16:41:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 128 states have internal predecessors, (140), 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-21 16:41:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-07-21 16:41:48,616 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 13 [2022-07-21 16:41:48,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:48,616 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-07-21 16:41:48,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-21 16:41:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-07-21 16:41:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:41:48,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:48,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:48,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 16:41:48,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash -264176465, now seen corresponding path program 1 times [2022-07-21 16:41:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:48,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361005223] [2022-07-21 16:41:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:48,696 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-21 16:41:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:48,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361005223] [2022-07-21 16:41:48,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361005223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:48,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:48,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:48,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679124467] [2022-07-21 16:41:48,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:48,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:41:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:48,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:41:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:41:48,699 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-21 16:41:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:48,859 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-07-21 16:41:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:41:48,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-07-21 16:41:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:48,861 INFO L225 Difference]: With dead ends: 129 [2022-07-21 16:41:48,861 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 16:41:48,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:41:48,861 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:48,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 264 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 16:41:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-21 16:41:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 127 states have internal predecessors, (139), 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-21 16:41:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-07-21 16:41:48,864 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 15 [2022-07-21 16:41:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:48,864 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-07-21 16:41:48,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-21 16:41:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-07-21 16:41:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:41:48,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:48,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:48,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 16:41:48,865 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash -264176464, now seen corresponding path program 1 times [2022-07-21 16:41:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:48,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522856690] [2022-07-21 16:41:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:48,959 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-21 16:41:48,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:48,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522856690] [2022-07-21 16:41:48,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522856690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:48,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:48,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:48,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417408227] [2022-07-21 16:41:48,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:48,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:41:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:48,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:41:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:41:48,962 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-21 16:41:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:49,122 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-07-21 16:41:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 16:41:49,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-07-21 16:41:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:49,124 INFO L225 Difference]: With dead ends: 130 [2022-07-21 16:41:49,124 INFO L226 Difference]: Without dead ends: 130 [2022-07-21 16:41:49,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:41:49,126 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:49,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 307 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-21 16:41:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2022-07-21 16:41:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.425531914893617) internal successors, (134), 122 states have internal predecessors, (134), 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-21 16:41:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-07-21 16:41:49,129 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 15 [2022-07-21 16:41:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:49,130 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-07-21 16:41:49,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-21 16:41:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-07-21 16:41:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 16:41:49,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:49,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:49,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 16:41:49,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:49,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -125261441, now seen corresponding path program 1 times [2022-07-21 16:41:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:49,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672541226] [2022-07-21 16:41:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:49,257 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-21 16:41:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:49,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672541226] [2022-07-21 16:41:49,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672541226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:49,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:49,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 16:41:49,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263228295] [2022-07-21 16:41:49,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:49,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:41:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:49,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:41:49,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:41:49,259 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-21 16:41:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:49,398 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2022-07-21 16:41:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:41:49,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2022-07-21 16:41:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:49,400 INFO L225 Difference]: With dead ends: 184 [2022-07-21 16:41:49,400 INFO L226 Difference]: Without dead ends: 184 [2022-07-21 16:41:49,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-07-21 16:41:49,401 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 256 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:49,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 229 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-21 16:41:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 130. [2022-07-21 16:41:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 129 states have internal predecessors, (142), 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-21 16:41:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-07-21 16:41:49,404 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 16 [2022-07-21 16:41:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:49,405 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-07-21 16:41:49,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-21 16:41:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-07-21 16:41:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 16:41:49,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:49,406 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:49,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 16:41:49,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash -926362969, now seen corresponding path program 1 times [2022-07-21 16:41:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:49,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500355162] [2022-07-21 16:41:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:49,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500355162] [2022-07-21 16:41:49,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500355162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:41:49,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216318114] [2022-07-21 16:41:49,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:49,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:49,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:49,485 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-21 16:41:49,486 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-21 16:41:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:49,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 16:41:49,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:41:49,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:41:49,674 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-21 16:41:49,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:41:49,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-21 16:41:49,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:41:49,742 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-21 16:41:49,844 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-21 16:41:49,847 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-21 16:41:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:49,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:41:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:49,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216318114] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:41:49,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:41:49,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-07-21 16:41:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920849003] [2022-07-21 16:41:49,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:41:49,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 16:41:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 16:41:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:41:49,962 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 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-21 16:41:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:50,274 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2022-07-21 16:41:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 16:41:50,275 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 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 23 [2022-07-21 16:41:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:50,275 INFO L225 Difference]: With dead ends: 181 [2022-07-21 16:41:50,275 INFO L226 Difference]: Without dead ends: 181 [2022-07-21 16:41:50,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-21 16:41:50,276 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 313 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:50,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 260 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:41:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-21 16:41:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 137. [2022-07-21 16:41:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 136 states have internal predecessors, (150), 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-21 16:41:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2022-07-21 16:41:50,279 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 23 [2022-07-21 16:41:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:50,279 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2022-07-21 16:41:50,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 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-21 16:41:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2022-07-21 16:41:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 16:41:50,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:50,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:50,300 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-21 16:41:50,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 16:41:50,481 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash -968381222, now seen corresponding path program 1 times [2022-07-21 16:41:50,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:50,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807281224] [2022-07-21 16:41:50,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:50,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:50,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:50,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807281224] [2022-07-21 16:41:50,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807281224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:50,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:50,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:50,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680084640] [2022-07-21 16:41:50,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:50,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:41:50,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:50,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:41:50,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:41:50,561 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-21 16:41:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:50,655 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2022-07-21 16:41:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:41:50,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-07-21 16:41:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:50,657 INFO L225 Difference]: With dead ends: 141 [2022-07-21 16:41:50,658 INFO L226 Difference]: Without dead ends: 141 [2022-07-21 16:41:50,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-21 16:41:50,658 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:50,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 296 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-21 16:41:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2022-07-21 16:41:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 135 states have internal predecessors, (147), 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-21 16:41:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-07-21 16:41:50,664 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 23 [2022-07-21 16:41:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:50,665 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-07-21 16:41:50,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-21 16:41:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-07-21 16:41:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 16:41:50,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:50,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:50,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 16:41:50,668 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1747136957, now seen corresponding path program 1 times [2022-07-21 16:41:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:50,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623199307] [2022-07-21 16:41:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:50,722 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-21 16:41:50,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:50,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623199307] [2022-07-21 16:41:50,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623199307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:50,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:50,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922589718] [2022-07-21 16:41:50,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:50,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:41:50,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:41:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:41:50,725 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-21 16:41:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:50,836 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-21 16:41:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:41:50,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-07-21 16:41:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:50,837 INFO L225 Difference]: With dead ends: 136 [2022-07-21 16:41:50,837 INFO L226 Difference]: Without dead ends: 136 [2022-07-21 16:41:50,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:41:50,839 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 41 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:50,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 261 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-21 16:41:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-07-21 16:41:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 134 states have internal predecessors, (146), 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-21 16:41:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-07-21 16:41:50,842 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 24 [2022-07-21 16:41:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:50,842 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-07-21 16:41:50,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-21 16:41:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-07-21 16:41:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 16:41:50,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:50,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:50,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 16:41:50,846 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:50,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1747136958, now seen corresponding path program 1 times [2022-07-21 16:41:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:50,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284291347] [2022-07-21 16:41:50,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:50,928 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-21 16:41:50,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:50,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284291347] [2022-07-21 16:41:50,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284291347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:50,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:50,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:41:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857604325] [2022-07-21 16:41:50,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:50,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:41:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:41:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:41:50,930 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-21 16:41:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:51,046 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-07-21 16:41:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:41:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-07-21 16:41:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:51,047 INFO L225 Difference]: With dead ends: 133 [2022-07-21 16:41:51,047 INFO L226 Difference]: Without dead ends: 133 [2022-07-21 16:41:51,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:41:51,048 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 9 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:51,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 315 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:41:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-21 16:41:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2022-07-21 16:41:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 125 states have internal predecessors, (136), 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-21 16:41:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-07-21 16:41:51,050 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 24 [2022-07-21 16:41:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:51,050 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-07-21 16:41:51,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-21 16:41:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-07-21 16:41:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 16:41:51,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:51,051 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:51,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 16:41:51,051 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash 59031534, now seen corresponding path program 1 times [2022-07-21 16:41:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:51,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112804796] [2022-07-21 16:41:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:51,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:51,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112804796] [2022-07-21 16:41:51,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112804796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:41:51,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498439155] [2022-07-21 16:41:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:51,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:51,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:51,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:41:51,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 16:41:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:51,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 16:41:51,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:41:51,388 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-21 16:41:51,399 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-21 16:41:51,439 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:41:51,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:41:51,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:41:51,471 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-21 16:41:51,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:41:51,501 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 16 treesize of output 8 [2022-07-21 16:41:51,544 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-21 16:41:51,558 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-21 16:41:51,588 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-21 16:41:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:51,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:41:51,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-07-21 16:41:51,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2022-07-21 16:41:51,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-07-21 16:41:51,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_528)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-07-21 16:41:51,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_56| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int) (v_ArrVal_533 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56| v_ArrVal_528)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0)))) is different from false [2022-07-21 16:41:51,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:51,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:51,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-21 16:41:51,695 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 24 [2022-07-21 16:41:51,699 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-21 16:41:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:51,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498439155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:41:51,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:41:51,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-07-21 16:41:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336934098] [2022-07-21 16:41:51,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:41:51,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 16:41:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:51,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 16:41:51,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=541, Unknown=5, NotChecked=260, Total=930 [2022-07-21 16:41:51,714 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 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-21 16:41:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:52,472 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2022-07-21 16:41:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 16:41:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 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 26 [2022-07-21 16:41:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:52,474 INFO L225 Difference]: With dead ends: 348 [2022-07-21 16:41:52,474 INFO L226 Difference]: Without dead ends: 348 [2022-07-21 16:41:52,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=296, Invalid=1051, Unknown=5, NotChecked=370, Total=1722 [2022-07-21 16:41:52,475 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 564 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 910 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:52,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 743 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 956 Invalid, 0 Unknown, 910 Unchecked, 0.4s Time] [2022-07-21 16:41:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-21 16:41:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 151. [2022-07-21 16:41:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 150 states have internal predecessors, (165), 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-21 16:41:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-07-21 16:41:52,478 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 26 [2022-07-21 16:41:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:52,478 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-07-21 16:41:52,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 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-21 16:41:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-07-21 16:41:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 16:41:52,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:52,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:52,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 16:41:52,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-21 16:41:52,697 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 500584872, now seen corresponding path program 1 times [2022-07-21 16:41:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:52,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391816876] [2022-07-21 16:41:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:41:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:52,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391816876] [2022-07-21 16:41:52,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391816876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:52,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:52,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216345010] [2022-07-21 16:41:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:52,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:52,743 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-21 16:41:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:52,777 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-07-21 16:41:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-07-21 16:41:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:52,778 INFO L225 Difference]: With dead ends: 152 [2022-07-21 16:41:52,778 INFO L226 Difference]: Without dead ends: 152 [2022-07-21 16:41:52,778 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-21 16:41:52,779 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:52,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 101 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:41:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-21 16:41:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-21 16:41:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 128 states have (on average 1.2890625) internal successors, (165), 151 states have internal predecessors, (165), 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-21 16:41:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-07-21 16:41:52,782 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 29 [2022-07-21 16:41:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:52,783 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-07-21 16:41:52,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-21 16:41:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-07-21 16:41:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 16:41:52,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:52,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:52,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 16:41:52,785 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1324652277, now seen corresponding path program 1 times [2022-07-21 16:41:52,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:52,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487489697] [2022-07-21 16:41:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:41:52,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487489697] [2022-07-21 16:41:52,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487489697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:52,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:52,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:41:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940286956] [2022-07-21 16:41:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:52,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:41:52,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:52,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:41:52,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:41:52,848 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-21 16:41:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:52,892 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-07-21 16:41:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:41:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2022-07-21 16:41:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:52,893 INFO L225 Difference]: With dead ends: 160 [2022-07-21 16:41:52,893 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 16:41:52,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:41:52,894 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:52,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:41:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 16:41:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2022-07-21 16:41:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.282442748091603) internal successors, (168), 154 states have internal predecessors, (168), 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-21 16:41:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2022-07-21 16:41:52,897 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 31 [2022-07-21 16:41:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:52,898 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2022-07-21 16:41:52,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-21 16:41:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2022-07-21 16:41:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 16:41:52,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:52,899 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:52,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 16:41:52,899 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash 797716084, now seen corresponding path program 1 times [2022-07-21 16:41:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:52,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934830668] [2022-07-21 16:41:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:53,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934830668] [2022-07-21 16:41:53,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934830668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:41:53,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915104447] [2022-07-21 16:41:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:53,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:53,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:41:53,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 16:41:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:53,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 16:41:53,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:41:53,118 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-21 16:41:53,121 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-21 16:41:53,142 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 16:41:53,142 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 21 treesize of output 20 [2022-07-21 16:41:53,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:41:53,147 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-21 16:41:53,214 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-21 16:41:53,216 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-21 16:41:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:41:53,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:41:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:41:53,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915104447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:41:53,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:41:53,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2022-07-21 16:41:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608088698] [2022-07-21 16:41:53,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:41:53,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 16:41:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:53,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 16:41:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-21 16:41:53,331 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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-21 16:41:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:53,712 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2022-07-21 16:41:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 16:41:53,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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 32 [2022-07-21 16:41:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:53,713 INFO L225 Difference]: With dead ends: 209 [2022-07-21 16:41:53,713 INFO L226 Difference]: Without dead ends: 209 [2022-07-21 16:41:53,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-07-21 16:41:53,714 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 249 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:53,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 405 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:41:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-21 16:41:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 166. [2022-07-21 16:41:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 165 states have internal predecessors, (181), 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-21 16:41:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2022-07-21 16:41:53,717 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 32 [2022-07-21 16:41:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:53,717 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2022-07-21 16:41:53,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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-21 16:41:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2022-07-21 16:41:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 16:41:53,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:53,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:53,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 16:41:53,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 16:41:53,927 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1040605566, now seen corresponding path program 1 times [2022-07-21 16:41:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788533880] [2022-07-21 16:41:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 16:41:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:53,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788533880] [2022-07-21 16:41:53,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788533880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:41:53,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:41:53,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:41:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796385847] [2022-07-21 16:41:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:41:53,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:41:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:41:53,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:41:53,951 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-21 16:41:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:53,969 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-07-21 16:41:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:41:53,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2022-07-21 16:41:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:53,970 INFO L225 Difference]: With dead ends: 165 [2022-07-21 16:41:53,970 INFO L226 Difference]: Without dead ends: 165 [2022-07-21 16:41:53,971 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-21 16:41:53,971 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:53,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 73 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:41:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-21 16:41:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-07-21 16:41:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 164 states have internal predecessors, (179), 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-21 16:41:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 179 transitions. [2022-07-21 16:41:53,974 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 179 transitions. Word has length 33 [2022-07-21 16:41:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:53,974 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 179 transitions. [2022-07-21 16:41:53,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-21 16:41:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-07-21 16:41:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 16:41:53,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:53,974 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:53,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 16:41:53,975 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash 248148312, now seen corresponding path program 1 times [2022-07-21 16:41:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:53,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811304643] [2022-07-21 16:41:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:54,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:54,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811304643] [2022-07-21 16:41:54,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811304643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:41:54,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267201414] [2022-07-21 16:41:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:54,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:54,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:54,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:41:54,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 16:41:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:54,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 16:41:54,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:41:54,222 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-21 16:41:54,269 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 16:41:54,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 16:41:54,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:41:54,380 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:41:54,380 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 29 [2022-07-21 16:41:54,408 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:41:54,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-21 16:41:54,490 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 25 treesize of output 13 [2022-07-21 16:41:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:54,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:41:54,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-07-21 16:41:54,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_787) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-07-21 16:41:54,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:54,612 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 20 treesize of output 21 [2022-07-21 16:41:54,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:54,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-21 16:41:54,621 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 11 treesize of output 9 [2022-07-21 16:41:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:56,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267201414] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:41:56,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:41:56,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-21 16:41:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819829904] [2022-07-21 16:41:56,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:41:56,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 16:41:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:56,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 16:41:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=582, Unknown=7, NotChecked=102, Total=812 [2022-07-21 16:41:56,893 INFO L87 Difference]: Start difference. First operand 165 states and 179 transitions. Second operand has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 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-21 16:41:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:57,463 INFO L93 Difference]: Finished difference Result 238 states and 257 transitions. [2022-07-21 16:41:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 16:41:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 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 33 [2022-07-21 16:41:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:57,464 INFO L225 Difference]: With dead ends: 238 [2022-07-21 16:41:57,464 INFO L226 Difference]: Without dead ends: 238 [2022-07-21 16:41:57,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=201, Invalid=792, Unknown=7, NotChecked=122, Total=1122 [2022-07-21 16:41:57,465 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 218 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 779 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:57,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 646 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1014 Invalid, 0 Unknown, 779 Unchecked, 0.4s Time] [2022-07-21 16:41:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-21 16:41:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 178. [2022-07-21 16:41:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 177 states have internal predecessors, (194), 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-21 16:41:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 194 transitions. [2022-07-21 16:41:57,468 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 194 transitions. Word has length 33 [2022-07-21 16:41:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:57,468 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 194 transitions. [2022-07-21 16:41:57,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 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-21 16:41:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2022-07-21 16:41:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 16:41:57,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:57,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:57,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 16:41:57,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:57,679 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:57,680 INFO L85 PathProgramCache]: Analyzing trace with hash 248148313, now seen corresponding path program 1 times [2022-07-21 16:41:57,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:57,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716568149] [2022-07-21 16:41:57,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:57,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:57,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:41:57,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716568149] [2022-07-21 16:41:57,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716568149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:41:57,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399900733] [2022-07-21 16:41:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:57,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:57,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:41:57,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:41:57,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 16:41:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:41:57,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-21 16:41:57,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:41:57,930 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-21 16:41:57,967 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-21 16:41:57,977 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:41:57,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:41:58,001 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-21 16:41:58,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:41:58,108 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:41:58,109 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 14 treesize of output 20 [2022-07-21 16:41:58,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:41:58,124 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:41:58,125 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 29 [2022-07-21 16:41:58,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:41:58,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-21 16:41:58,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:41:58,275 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-21 16:41:58,277 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 25 treesize of output 13 [2022-07-21 16:41:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:58,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:41:58,440 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-21 16:41:58,459 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4)))) is different from false [2022-07-21 16:41:58,465 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4)))) is different from false [2022-07-21 16:41:58,475 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:58,475 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 20 treesize of output 21 [2022-07-21 16:41:58,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:58,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-21 16:41:58,483 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 11 treesize of output 9 [2022-07-21 16:41:58,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:58,499 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 37 treesize of output 38 [2022-07-21 16:41:58,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:41:58,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-21 16:41:58,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:58,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-21 16:41:58,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:41:58,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-21 16:41:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:41:58,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399900733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:41:58,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:41:58,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-07-21 16:41:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439523622] [2022-07-21 16:41:58,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:41:58,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 16:41:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:41:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 16:41:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=720, Unknown=3, NotChecked=168, Total=992 [2022-07-21 16:41:58,607 INFO L87 Difference]: Start difference. First operand 178 states and 194 transitions. Second operand has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 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-21 16:41:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:41:59,680 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2022-07-21 16:41:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 16:41:59,680 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 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 33 [2022-07-21 16:41:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:41:59,681 INFO L225 Difference]: With dead ends: 239 [2022-07-21 16:41:59,681 INFO L226 Difference]: Without dead ends: 239 [2022-07-21 16:41:59,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1643, Unknown=3, NotChecked=264, Total=2256 [2022-07-21 16:41:59,682 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 550 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:41:59,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 629 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1137 Invalid, 0 Unknown, 466 Unchecked, 0.5s Time] [2022-07-21 16:41:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-21 16:41:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 181. [2022-07-21 16:41:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 180 states have internal predecessors, (197), 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-21 16:41:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2022-07-21 16:41:59,694 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 33 [2022-07-21 16:41:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:41:59,694 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2022-07-21 16:41:59,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 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-21 16:41:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2022-07-21 16:41:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 16:41:59,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:41:59,695 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:41:59,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 16:41:59,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:41:59,902 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:41:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:41:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1639111831, now seen corresponding path program 1 times [2022-07-21 16:41:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:41:59,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286360317] [2022-07-21 16:41:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:41:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:41:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:42:00,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286360317] [2022-07-21 16:42:00,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286360317] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:42:00,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347985741] [2022-07-21 16:42:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:00,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:00,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:42:00,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:42:00,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 16:42:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:00,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-21 16:42:00,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:00,456 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-21 16:42:00,466 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-21 16:42:00,503 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:42:00,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:42:00,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:42:00,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:42:00,539 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 21 treesize of output 20 [2022-07-21 16:42:00,576 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 16 treesize of output 8 [2022-07-21 16:42:00,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:42:00,632 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-21 16:42:00,642 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:42:00,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:42:00,665 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-21 16:42:00,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:42:00,691 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 16 treesize of output 8 [2022-07-21 16:42:00,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-21 16:42:00,730 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-21 16:42:00,751 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-21 16:42:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:00,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:42:00,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-07-21 16:42:00,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-07-21 16:42:00,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-07-21 16:42:00,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-07-21 16:42:00,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) 0)))) is different from false [2022-07-21 16:42:00,878 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:42:00,879 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 13 treesize of output 12 [2022-07-21 16:42:00,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_6| |c_ULTIMATE.start_main_~end~0#1.base|) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1036)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))))) is different from false [2022-07-21 16:42:00,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_72| Int) (v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int) (v_ArrVal_1040 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_72| |c_ULTIMATE.start_main_~list~0#1.offset|)) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_72| v_ArrVal_1036)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_6| |c_ULTIMATE.start_main_~list~0#1.base|))) is different from false [2022-07-21 16:42:00,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:42:00,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:42:00,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-21 16:42:00,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:42:00,963 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 36 treesize of output 24 [2022-07-21 16:42:00,966 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-21 16:42:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:00,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347985741] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:42:00,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:42:00,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 17] total 43 [2022-07-21 16:42:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125189785] [2022-07-21 16:42:00,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:42:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-21 16:42:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:42:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-21 16:42:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1063, Unknown=17, NotChecked=518, Total=1806 [2022-07-21 16:42:00,986 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 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-21 16:42:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:01,863 INFO L93 Difference]: Finished difference Result 444 states and 482 transitions. [2022-07-21 16:42:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 16:42:01,865 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 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 33 [2022-07-21 16:42:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:01,866 INFO L225 Difference]: With dead ends: 444 [2022-07-21 16:42:01,866 INFO L226 Difference]: Without dead ends: 444 [2022-07-21 16:42:01,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=428, Invalid=2033, Unknown=17, NotChecked=714, Total=3192 [2022-07-21 16:42:01,867 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 823 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1986 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:01,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 798 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 979 Invalid, 0 Unknown, 1986 Unchecked, 0.5s Time] [2022-07-21 16:42:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-21 16:42:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 189. [2022-07-21 16:42:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 188 states have internal predecessors, (205), 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-21 16:42:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2022-07-21 16:42:01,870 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 33 [2022-07-21 16:42:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:01,870 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2022-07-21 16:42:01,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 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-21 16:42:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-07-21 16:42:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 16:42:01,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:01,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:01,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:02,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:02,083 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:02,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 705439333, now seen corresponding path program 1 times [2022-07-21 16:42:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:42:02,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340245192] [2022-07-21 16:42:02,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:42:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:42:02,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:42:02,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340245192] [2022-07-21 16:42:02,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340245192] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:42:02,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65924885] [2022-07-21 16:42:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:02,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:42:02,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:42:02,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 16:42:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:02,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 16:42:02,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:02,335 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:42:02,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-07-21 16:42:02,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 34 [2022-07-21 16:42:02,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 30 treesize of output 37 [2022-07-21 16:42:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:42:02,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:42:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:42:02,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65924885] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:42:02,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:42:02,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-07-21 16:42:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062409441] [2022-07-21 16:42:02,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:42:02,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 16:42:02,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:42:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 16:42:02,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-21 16:42:02,767 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 14 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-21 16:42:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:02,974 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2022-07-21 16:42:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 16:42:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 35 [2022-07-21 16:42:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:02,975 INFO L225 Difference]: With dead ends: 199 [2022-07-21 16:42:02,975 INFO L226 Difference]: Without dead ends: 174 [2022-07-21 16:42:02,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-21 16:42:02,976 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 64 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:02,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 424 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 286 Invalid, 0 Unknown, 159 Unchecked, 0.1s Time] [2022-07-21 16:42:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-21 16:42:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-07-21 16:42:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 173 states have internal predecessors, (189), 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-21 16:42:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2022-07-21 16:42:02,978 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 35 [2022-07-21 16:42:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:02,978 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2022-07-21 16:42:02,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-21 16:42:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2022-07-21 16:42:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 16:42:02,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:02,979 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:03,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:03,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:03,191 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash 283994547, now seen corresponding path program 2 times [2022-07-21 16:42:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:42:03,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765677099] [2022-07-21 16:42:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:42:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:42:03,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765677099] [2022-07-21 16:42:03,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765677099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:42:03,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292178023] [2022-07-21 16:42:03,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:42:03,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:42:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:42:03,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:42:03,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 16:42:03,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:42:03,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:42:03,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-21 16:42:03,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:03,643 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-21 16:42:03,703 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:42:03,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:42:03,733 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-21 16:42:03,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:42:03,859 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 16:42:03,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-21 16:42:03,865 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 26 treesize of output 21 [2022-07-21 16:42:03,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:42:03,919 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 16:42:03,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2022-07-21 16:42:03,926 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-21 16:42:03,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-07-21 16:42:04,179 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-21 16:42:04,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-07-21 16:42:04,186 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:42:04,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-21 16:42:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:04,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:42:25,059 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 16:42:25,079 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 1388 treesize of output 1380 [2022-07-21 16:42:25,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:42:26,284 INFO L356 Elim1Store]: treesize reduction 591, result has 51.0 percent of original size [2022-07-21 16:42:26,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 92 case distinctions, treesize of input 75612 treesize of output 73622 [2022-07-21 16:42:32,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:42:32,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58728 treesize of output 58792 [2022-07-21 16:42:32,634 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 16:42:32,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:32,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-21 16:42:32,852 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) 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-21 16:42:32,854 INFO L158 Benchmark]: Toolchain (without parser) took 46527.18ms. Allocated memory was 56.6MB in the beginning and 333.4MB in the end (delta: 276.8MB). Free memory was 34.8MB in the beginning and 192.1MB in the end (delta: -157.3MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. [2022-07-21 16:42:32,854 INFO L158 Benchmark]: CDTParser took 1.35ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 43.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 16:42:32,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.99ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 32.3MB in the end (delta: 2.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 16:42:32,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.04ms. Allocated memory is still 56.6MB. Free memory was 32.3MB in the beginning and 30.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 16:42:32,855 INFO L158 Benchmark]: Boogie Preprocessor took 21.54ms. Allocated memory is still 56.6MB. Free memory was 30.0MB in the beginning and 28.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 16:42:32,855 INFO L158 Benchmark]: RCFGBuilder took 453.25ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 28.3MB in the beginning and 36.3MB in the end (delta: -8.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-07-21 16:42:32,860 INFO L158 Benchmark]: TraceAbstraction took 45662.99ms. Allocated memory was 71.3MB in the beginning and 333.4MB in the end (delta: 262.1MB). Free memory was 35.8MB in the beginning and 192.1MB in the end (delta: -156.3MB). Peak memory consumption was 188.4MB. Max. memory is 16.1GB. [2022-07-21 16:42:32,861 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 43.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.99ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 32.3MB in the end (delta: 2.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.04ms. Allocated memory is still 56.6MB. Free memory was 32.3MB in the beginning and 30.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.54ms. Allocated memory is still 56.6MB. Free memory was 30.0MB in the beginning and 28.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 453.25ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 28.3MB in the beginning and 36.3MB in the end (delta: -8.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * TraceAbstraction took 45662.99ms. Allocated memory was 71.3MB in the beginning and 333.4MB in the end (delta: 262.1MB). Free memory was 35.8MB in the beginning and 192.1MB in the end (delta: -156.3MB). Peak memory consumption was 188.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 16:42:32,904 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/forester-heap/sll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503a3e49b44041609ec1bba765b53912c88abb90ff278e61e68e863904faf4bb --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 16:42:34,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 16:42:34,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 16:42:34,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 16:42:34,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 16:42:34,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 16:42:34,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 16:42:34,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 16:42:34,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 16:42:34,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 16:42:34,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 16:42:34,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 16:42:34,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 16:42:34,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 16:42:34,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 16:42:34,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 16:42:34,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 16:42:34,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 16:42:34,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 16:42:34,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 16:42:34,605 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 16:42:34,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 16:42:34,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 16:42:34,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 16:42:34,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 16:42:34,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 16:42:34,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 16:42:34,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 16:42:34,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 16:42:34,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 16:42:34,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 16:42:34,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 16:42:34,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 16:42:34,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 16:42:34,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 16:42:34,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 16:42:34,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 16:42:34,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 16:42:34,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 16:42:34,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 16:42:34,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 16:42:34,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 16:42:34,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-07-21 16:42:34,652 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 16:42:34,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 16:42:34,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 16:42:34,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 16:42:34,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 16:42:34,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 16:42:34,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 16:42:34,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 16:42:34,654 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 16:42:34,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 16:42:34,655 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 16:42:34,655 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 16:42:34,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 16:42:34,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 16:42:34,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 16:42:34,656 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 16:42:34,656 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 16:42:34,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 16:42:34,656 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 16:42:34,656 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 16:42:34,656 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 16:42:34,656 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 16:42:34,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 16:42:34,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 16:42:34,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 16:42:34,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 16:42:34,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:42:34,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 16:42:34,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 16:42:34,658 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 16:42:34,658 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 16:42:34,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 16:42:34,658 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 503a3e49b44041609ec1bba765b53912c88abb90ff278e61e68e863904faf4bb [2022-07-21 16:42:34,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 16:42:34,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 16:42:34,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 16:42:34,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 16:42:34,936 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 16:42:34,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2022-07-21 16:42:34,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885a2f31d/884610b7671748d19335f7080f872973/FLAGae5279e65 [2022-07-21 16:42:35,369 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 16:42:35,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2022-07-21 16:42:35,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885a2f31d/884610b7671748d19335f7080f872973/FLAGae5279e65 [2022-07-21 16:42:35,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885a2f31d/884610b7671748d19335f7080f872973 [2022-07-21 16:42:35,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 16:42:35,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 16:42:35,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 16:42:35,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 16:42:35,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 16:42:35,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:42:35" (1/1) ... [2022-07-21 16:42:35,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ce7779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:35, skipping insertion in model container [2022-07-21 16:42:35,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:42:35" (1/1) ... [2022-07-21 16:42:35,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 16:42:35,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 16:42:35,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2022-07-21 16:42:35,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22606,22619] [2022-07-21 16:42:35,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2022-07-21 16:42:35,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22820,22833] [2022-07-21 16:42:35,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:42:36,001 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 16:42:36,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2022-07-21 16:42:36,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22606,22619] [2022-07-21 16:42:36,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2022-07-21 16:42:36,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22820,22833] [2022-07-21 16:42:36,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:42:36,051 INFO L208 MainTranslator]: Completed translation [2022-07-21 16:42:36,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36 WrapperNode [2022-07-21 16:42:36,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 16:42:36,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 16:42:36,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 16:42:36,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 16:42:36,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,088 INFO L137 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2022-07-21 16:42:36,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 16:42:36,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 16:42:36,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 16:42:36,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 16:42:36,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 16:42:36,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 16:42:36,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 16:42:36,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 16:42:36,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (1/1) ... [2022-07-21 16:42:36,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:42:36,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:42:36,159 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-21 16:42:36,164 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-21 16:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 16:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 16:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 16:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 16:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 16:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 16:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 16:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 16:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 16:42:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 16:42:36,250 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 16:42:36,251 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 16:42:36,620 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 16:42:36,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 16:42:36,625 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-21 16:42:36,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:42:36 BoogieIcfgContainer [2022-07-21 16:42:36,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 16:42:36,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 16:42:36,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 16:42:36,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 16:42:36,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:42:35" (1/3) ... [2022-07-21 16:42:36,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4622e525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:42:36, skipping insertion in model container [2022-07-21 16:42:36,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:42:36" (2/3) ... [2022-07-21 16:42:36,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4622e525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:42:36, skipping insertion in model container [2022-07-21 16:42:36,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:42:36" (3/3) ... [2022-07-21 16:42:36,632 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2022-07-21 16:42:36,642 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 16:42:36,642 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-07-21 16:42:36,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 16:42:36,678 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@1f31e0da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26ac3d7e [2022-07-21 16:42:36,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-07-21 16:42:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 69 states have (on average 2.1884057971014492) internal successors, (151), 130 states have internal predecessors, (151), 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-21 16:42:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 16:42:36,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:36,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 16:42:36,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 16:42:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:36,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51176424] [2022-07-21 16:42:36,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:36,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:36,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:36,711 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-21 16:42:36,746 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-21 16:42:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:36,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 16:42:36,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:36,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 16:42:36,856 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-21 16:42:36,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:36,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:36,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51176424] [2022-07-21 16:42:36,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51176424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:36,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:36,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:42:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332469497] [2022-07-21 16:42:36,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:36,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:42:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:36,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:42:36,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:42:36,893 INFO L87 Difference]: Start difference. First operand has 131 states, 69 states have (on average 2.1884057971014492) internal successors, (151), 130 states have internal predecessors, (151), 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) 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-21 16:42:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:37,061 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2022-07-21 16:42:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:42:37,063 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-21 16:42:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:37,069 INFO L225 Difference]: With dead ends: 159 [2022-07-21 16:42:37,070 INFO L226 Difference]: Without dead ends: 157 [2022-07-21 16:42:37,072 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-21 16:42:37,078 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:37,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:42:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-21 16:42:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2022-07-21 16:42:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 130 states have internal predecessors, (139), 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-21 16:42:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2022-07-21 16:42:37,125 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 3 [2022-07-21 16:42:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:37,126 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2022-07-21 16:42:37,126 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-21 16:42:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2022-07-21 16:42:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 16:42:37,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:37,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 16:42:37,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 16:42:37,358 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-21 16:42:37,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 16:42:37,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:37,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911460489] [2022-07-21 16:42:37,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:37,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:37,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:37,373 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-21 16:42:37,380 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-21 16:42:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:37,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 16:42:37,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:37,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-21 16:42:37,423 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-21 16:42:37,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:37,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:37,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911460489] [2022-07-21 16:42:37,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911460489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:37,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:37,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:42:37,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621230417] [2022-07-21 16:42:37,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:37,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:42:37,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:37,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:42:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:42:37,425 INFO L87 Difference]: Start difference. First operand 131 states and 139 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-21 16:42:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:37,575 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2022-07-21 16:42:37,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:42:37,576 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-21 16:42:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:37,577 INFO L225 Difference]: With dead ends: 128 [2022-07-21 16:42:37,577 INFO L226 Difference]: Without dead ends: 128 [2022-07-21 16:42:37,577 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-21 16:42:37,578 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:37,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 71 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:42:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-21 16:42:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-21 16:42:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 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-21 16:42:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2022-07-21 16:42:37,582 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 3 [2022-07-21 16:42:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:37,582 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2022-07-21 16:42:37,583 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-21 16:42:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2022-07-21 16:42:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 16:42:37,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:37,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 16:42:37,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-21 16:42:37,789 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-21 16:42:37,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2022-07-21 16:42:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:37,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013659193] [2022-07-21 16:42:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:37,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:37,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:37,792 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-21 16:42:37,795 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-21 16:42:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:37,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 16:42:37,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:37,840 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-21 16:42:37,843 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-21 16:42:37,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:37,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:37,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013659193] [2022-07-21 16:42:37,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013659193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:37,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:37,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:42:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920008509] [2022-07-21 16:42:37,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:37,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:42:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:37,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:42:37,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:42:37,845 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:42:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:37,965 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2022-07-21 16:42:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:42:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-21 16:42:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:37,966 INFO L225 Difference]: With dead ends: 125 [2022-07-21 16:42:37,966 INFO L226 Difference]: Without dead ends: 125 [2022-07-21 16:42:37,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:42:37,967 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 100 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:37,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 80 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:42:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-21 16:42:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-07-21 16:42:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 122 states have internal predecessors, (131), 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-21 16:42:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2022-07-21 16:42:37,972 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 6 [2022-07-21 16:42:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:37,972 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2022-07-21 16:42:37,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:42:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2022-07-21 16:42:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 16:42:37,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:37,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 16:42:37,991 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-21 16:42:38,178 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-21 16:42:38,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:38,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-07-21 16:42:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:38,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766461383] [2022-07-21 16:42:38,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:38,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:38,182 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-21 16:42:38,184 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-21 16:42:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:38,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 16:42:38,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:38,278 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-21 16:42:38,285 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-21 16:42:38,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:38,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766461383] [2022-07-21 16:42:38,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766461383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:38,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:38,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:42:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279044398] [2022-07-21 16:42:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:38,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:42:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:38,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:42:38,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:42:38,289 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:42:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:38,453 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-07-21 16:42:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:42:38,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-21 16:42:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:38,454 INFO L225 Difference]: With dead ends: 141 [2022-07-21 16:42:38,454 INFO L226 Difference]: Without dead ends: 141 [2022-07-21 16:42:38,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:42:38,455 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 99 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:38,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 89 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:42:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-21 16:42:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2022-07-21 16:42:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.7) internal successors, (136), 127 states have internal predecessors, (136), 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-21 16:42:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-07-21 16:42:38,460 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 6 [2022-07-21 16:42:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:38,460 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-07-21 16:42:38,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:42:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-07-21 16:42:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 16:42:38,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:38,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:38,491 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-21 16:42:38,691 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-21 16:42:38,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1113926540, now seen corresponding path program 1 times [2022-07-21 16:42:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:38,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851963187] [2022-07-21 16:42:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:38,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:38,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:38,695 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-21 16:42:38,696 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-21 16:42:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:38,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 16:42:38,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:38,766 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-21 16:42:38,793 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 16:42:38,793 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-21 16:42:38,805 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-21 16:42:38,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:38,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:38,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851963187] [2022-07-21 16:42:38,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851963187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:38,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:38,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:42:38,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009171369] [2022-07-21 16:42:38,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:38,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:42:38,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:38,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:42:38,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:42:38,807 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-21 16:42:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:39,019 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-21 16:42:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:42:39,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-07-21 16:42:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:39,020 INFO L225 Difference]: With dead ends: 132 [2022-07-21 16:42:39,020 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 16:42:39,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:42:39,020 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 158 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:39,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 72 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:42:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 16:42:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2022-07-21 16:42:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 118 states have internal predecessors, (129), 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-21 16:42:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-07-21 16:42:39,024 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 10 [2022-07-21 16:42:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:39,024 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-07-21 16:42:39,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-21 16:42:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-07-21 16:42:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 16:42:39,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:39,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:39,048 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-21 16:42:39,231 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-21 16:42:39,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:39,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1113926541, now seen corresponding path program 1 times [2022-07-21 16:42:39,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:39,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789237607] [2022-07-21 16:42:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:39,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:39,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:39,239 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-21 16:42:39,240 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-21 16:42:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:39,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 16:42:39,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:39,344 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-21 16:42:39,391 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:42:39,392 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 14 [2022-07-21 16:42:39,401 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-21 16:42:39,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:39,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:39,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789237607] [2022-07-21 16:42:39,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789237607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:39,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:39,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:42:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280573383] [2022-07-21 16:42:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:39,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:42:39,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:39,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:42:39,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:42:39,404 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-21 16:42:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:39,647 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-21 16:42:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:42:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-07-21 16:42:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:39,648 INFO L225 Difference]: With dead ends: 155 [2022-07-21 16:42:39,648 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 16:42:39,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:42:39,649 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 146 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:39,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 98 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:42:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 16:42:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 125. [2022-07-21 16:42:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 124 states have internal predecessors, (136), 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-21 16:42:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-07-21 16:42:39,658 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 10 [2022-07-21 16:42:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:39,658 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-07-21 16:42:39,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-21 16:42:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-07-21 16:42:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 16:42:39,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:39,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:39,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 16:42:39,866 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-21 16:42:39,866 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1036529431, now seen corresponding path program 1 times [2022-07-21 16:42:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:39,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558717222] [2022-07-21 16:42:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:39,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:39,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:39,868 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-21 16:42:39,869 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-21 16:42:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:39,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 16:42:39,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:39,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-21 16:42:39,959 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:42:39,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:42:39,979 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-21 16:42:39,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:39,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:39,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558717222] [2022-07-21 16:42:39,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558717222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:39,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:39,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:42:39,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435540121] [2022-07-21 16:42:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:39,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:42:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:39,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:42:39,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:42:39,981 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-21 16:42:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:40,237 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-07-21 16:42:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:42:40,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-07-21 16:42:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:40,239 INFO L225 Difference]: With dead ends: 164 [2022-07-21 16:42:40,239 INFO L226 Difference]: Without dead ends: 164 [2022-07-21 16:42:40,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:42:40,239 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 225 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:40,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 125 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:42:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-21 16:42:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2022-07-21 16:42:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 125 states have internal predecessors, (137), 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-21 16:42:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2022-07-21 16:42:40,243 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 12 [2022-07-21 16:42:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:40,243 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2022-07-21 16:42:40,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-21 16:42:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-07-21 16:42:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:42:40,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:40,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:40,266 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-21 16:42:40,450 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-21 16:42:40,451 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash -309587570, now seen corresponding path program 1 times [2022-07-21 16:42:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:40,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927608657] [2022-07-21 16:42:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:40,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:40,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:40,454 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-21 16:42:40,455 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-21 16:42:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:40,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 16:42:40,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:40,537 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-21 16:42:40,551 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-21 16:42:40,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 16:42:40,585 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-21 16:42:40,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:40,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:40,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927608657] [2022-07-21 16:42:40,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927608657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:40,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:40,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:42:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167773413] [2022-07-21 16:42:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:40,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:42:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:40,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:42:40,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:42:40,586 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-21 16:42:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:40,912 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-21 16:42:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:42:40,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-07-21 16:42:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:40,913 INFO L225 Difference]: With dead ends: 126 [2022-07-21 16:42:40,913 INFO L226 Difference]: Without dead ends: 126 [2022-07-21 16:42:40,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:42:40,914 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:40,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 251 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:42:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-21 16:42:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-07-21 16:42:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 124 states have internal predecessors, (136), 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-21 16:42:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-07-21 16:42:40,917 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 14 [2022-07-21 16:42:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:40,917 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-07-21 16:42:40,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-21 16:42:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-07-21 16:42:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:42:40,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:40,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:40,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-21 16:42:41,122 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-21 16:42:41,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:41,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash -309587569, now seen corresponding path program 1 times [2022-07-21 16:42:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:41,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539223412] [2022-07-21 16:42:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:41,125 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-21 16:42:41,127 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-21 16:42:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:41,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 16:42:41,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:41,220 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-21 16:42:41,234 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-21 16:42:41,238 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-21 16:42:41,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 16:42:41,259 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-21 16:42:41,287 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-21 16:42:41,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:41,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:41,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539223412] [2022-07-21 16:42:41,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539223412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:41,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:41,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:42:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635656657] [2022-07-21 16:42:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:41,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:42:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:42:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:42:41,290 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-21 16:42:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:41,703 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-07-21 16:42:41,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 16:42:41,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-07-21 16:42:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:41,705 INFO L225 Difference]: With dead ends: 126 [2022-07-21 16:42:41,705 INFO L226 Difference]: Without dead ends: 126 [2022-07-21 16:42:41,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:42:41,705 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 16 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:41,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 294 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:42:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-21 16:42:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2022-07-21 16:42:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 119 states have internal predecessors, (131), 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-21 16:42:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2022-07-21 16:42:41,707 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 14 [2022-07-21 16:42:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:41,708 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2022-07-21 16:42:41,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-21 16:42:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-07-21 16:42:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:42:41,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:41,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:41,724 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-21 16:42:41,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:41,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1562589153, now seen corresponding path program 1 times [2022-07-21 16:42:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:41,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616860065] [2022-07-21 16:42:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:41,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:41,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 16:42:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:42,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 16:42:42,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:42,019 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-21 16:42:42,079 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-21 16:42:42,085 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-21 16:42:42,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:42,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:42,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616860065] [2022-07-21 16:42:42,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616860065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:42,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:42,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:42:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594508458] [2022-07-21 16:42:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:42,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:42:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:42:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:42:42,087 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-21 16:42:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:42,349 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2022-07-21 16:42:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:42:42,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-07-21 16:42:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:42,350 INFO L225 Difference]: With dead ends: 180 [2022-07-21 16:42:42,350 INFO L226 Difference]: Without dead ends: 180 [2022-07-21 16:42:42,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:42:42,351 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 144 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:42,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 268 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:42:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-21 16:42:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 126. [2022-07-21 16:42:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 97 states have (on average 1.422680412371134) internal successors, (138), 125 states have internal predecessors, (138), 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-21 16:42:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-07-21 16:42:42,353 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 15 [2022-07-21 16:42:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:42,353 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-07-21 16:42:42,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-21 16:42:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-07-21 16:42:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 16:42:42,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:42,354 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:42,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-21 16:42:42,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:42,563 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:42,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2057287877, now seen corresponding path program 1 times [2022-07-21 16:42:42,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:42,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387518786] [2022-07-21 16:42:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:42,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:42,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:42,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:42,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 16:42:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:42,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 16:42:42,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:42,669 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-21 16:42:42,675 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-21 16:42:42,707 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 16:42:42,707 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 21 treesize of output 20 [2022-07-21 16:42:42,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:42:42,717 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-21 16:42:42,793 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-21 16:42:42,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 15 treesize of output 7 [2022-07-21 16:42:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:42,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:42:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:42,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:42,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387518786] [2022-07-21 16:42:42,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387518786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:42:42,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:42:42,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-07-21 16:42:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868979816] [2022-07-21 16:42:42,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:42:42,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 16:42:42,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:42,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 16:42:42,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 16:42:42,955 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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-21 16:42:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:43,494 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2022-07-21 16:42:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 16:42:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 22 [2022-07-21 16:42:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:43,495 INFO L225 Difference]: With dead ends: 177 [2022-07-21 16:42:43,495 INFO L226 Difference]: Without dead ends: 177 [2022-07-21 16:42:43,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-21 16:42:43,496 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 308 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:43,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 289 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 16:42:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-21 16:42:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 133. [2022-07-21 16:42:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 132 states have internal predecessors, (146), 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-21 16:42:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2022-07-21 16:42:43,498 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 22 [2022-07-21 16:42:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:43,499 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2022-07-21 16:42:43,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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-21 16:42:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-07-21 16:42:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 16:42:43,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:43,500 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-21 16:42:43,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:43,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:43,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:43,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2015269624, now seen corresponding path program 1 times [2022-07-21 16:42:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:43,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198091779] [2022-07-21 16:42:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:43,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:43,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:43,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:43,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 16:42:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:43,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 16:42:43,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:43,779 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-21 16:42:43,825 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-21 16:42:43,832 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-21 16:42:43,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:43,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:43,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198091779] [2022-07-21 16:42:43,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198091779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:43,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:43,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:42:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194842440] [2022-07-21 16:42:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:43,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:42:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:42:43,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:42:43,834 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-21 16:42:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:44,093 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2022-07-21 16:42:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:42:44,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-07-21 16:42:44,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:44,094 INFO L225 Difference]: With dead ends: 157 [2022-07-21 16:42:44,094 INFO L226 Difference]: Without dead ends: 157 [2022-07-21 16:42:44,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:42:44,094 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 112 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:44,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 272 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:42:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-21 16:42:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2022-07-21 16:42:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 132 states have internal predecessors, (145), 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-21 16:42:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-21 16:42:44,097 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2022-07-21 16:42:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:44,097 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-21 16:42:44,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-21 16:42:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-21 16:42:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 16:42:44,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:44,098 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-21 16:42:44,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:44,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:44,298 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1383851026, now seen corresponding path program 1 times [2022-07-21 16:42:44,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:44,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916900682] [2022-07-21 16:42:44,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:44,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:44,300 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 16:42:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:44,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 16:42:44,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:44,414 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-21 16:42:44,423 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-21 16:42:44,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 16:42:44,446 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-21 16:42:44,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:44,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:44,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916900682] [2022-07-21 16:42:44,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916900682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:44,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:44,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:42:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815529612] [2022-07-21 16:42:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:44,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:42:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:44,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:42:44,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:42:44,448 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-21 16:42:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:44,729 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-07-21 16:42:44,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:42:44,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-07-21 16:42:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:44,730 INFO L225 Difference]: With dead ends: 133 [2022-07-21 16:42:44,730 INFO L226 Difference]: Without dead ends: 133 [2022-07-21 16:42:44,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:42:44,731 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 39 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:44,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 248 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:42:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-21 16:42:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2022-07-21 16:42:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 131 states have internal predecessors, (144), 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-21 16:42:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-07-21 16:42:44,733 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 22 [2022-07-21 16:42:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:44,733 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-07-21 16:42:44,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-21 16:42:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-07-21 16:42:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 16:42:44,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:44,733 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-21 16:42:44,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:44,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:44,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1383851027, now seen corresponding path program 1 times [2022-07-21 16:42:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:44,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354490907] [2022-07-21 16:42:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:44,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:44,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:44,942 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:44,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 16:42:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:45,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 16:42:45,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:45,038 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-21 16:42:45,051 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-21 16:42:45,062 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-21 16:42:45,080 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-21 16:42:45,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 16:42:45,106 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-21 16:42:45,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:45,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:45,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354490907] [2022-07-21 16:42:45,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354490907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:45,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:45,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:42:45,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210411045] [2022-07-21 16:42:45,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:45,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:42:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:45,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:42:45,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:42:45,109 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-21 16:42:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:45,395 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-07-21 16:42:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:42:45,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-07-21 16:42:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:45,396 INFO L225 Difference]: With dead ends: 130 [2022-07-21 16:42:45,396 INFO L226 Difference]: Without dead ends: 130 [2022-07-21 16:42:45,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:42:45,397 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 8 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:45,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 301 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:42:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-21 16:42:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2022-07-21 16:42:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.35) internal successors, (135), 123 states have internal predecessors, (135), 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-21 16:42:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2022-07-21 16:42:45,399 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 22 [2022-07-21 16:42:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:45,399 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2022-07-21 16:42:45,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-21 16:42:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2022-07-21 16:42:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 16:42:45,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:45,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:45,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:45,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:45,600 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:45,601 INFO L85 PathProgramCache]: Analyzing trace with hash 99452763, now seen corresponding path program 1 times [2022-07-21 16:42:45,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:45,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678045237] [2022-07-21 16:42:45,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:45,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:45,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:45,603 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:45,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 16:42:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:45,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 16:42:45,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:45,739 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-21 16:42:45,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 16:42:45,800 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:42:45,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:42:45,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:42:45,834 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-21 16:42:45,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:42:45,891 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 16 treesize of output 8 [2022-07-21 16:42:45,933 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-21 16:42:45,948 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-21 16:42:45,992 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-21 16:42:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:46,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:42:46,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_486) |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-21 16:42:46,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_486) |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-21 16:42:46,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_486) |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-21 16:42:46,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_484)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_486) |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-21 16:42:46,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_6| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|))) (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_484)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_486) |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-21 16:42:46,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| (_ BitVec 32)) (v_ArrVal_484 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_484)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_486) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|))))) is different from false [2022-07-21 16:42:46,182 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-21 16:42:46,183 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 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-21 16:42:46,187 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 24 [2022-07-21 16:42:46,190 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-21 16:42:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 16:42:46,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:46,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678045237] [2022-07-21 16:42:46,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678045237] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:42:46,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:42:46,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-07-21 16:42:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312807207] [2022-07-21 16:42:46,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:42:46,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 16:42:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:46,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 16:42:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=163, Unknown=6, NotChecked=186, Total=420 [2022-07-21 16:42:46,208 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 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-21 16:42:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:46,905 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2022-07-21 16:42:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 16:42:46,906 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 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 23 [2022-07-21 16:42:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:46,906 INFO L225 Difference]: With dead ends: 200 [2022-07-21 16:42:46,907 INFO L226 Difference]: Without dead ends: 200 [2022-07-21 16:42:46,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=312, Unknown=6, NotChecked=258, Total=702 [2022-07-21 16:42:46,907 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 188 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 717 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:46,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 444 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 440 Invalid, 0 Unknown, 717 Unchecked, 0.5s Time] [2022-07-21 16:42:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-21 16:42:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 137. [2022-07-21 16:42:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 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-21 16:42:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2022-07-21 16:42:46,910 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 23 [2022-07-21 16:42:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:46,910 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2022-07-21 16:42:46,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 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-21 16:42:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2022-07-21 16:42:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 16:42:46,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:46,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:46,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:47,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:47,123 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1633911312, now seen corresponding path program 1 times [2022-07-21 16:42:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:47,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956878931] [2022-07-21 16:42:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:47,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:47,125 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:47,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 16:42:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:47,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 16:42:47,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:47,228 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-21 16:42:47,261 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-21 16:42:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:42:47,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:47,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:47,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956878931] [2022-07-21 16:42:47,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956878931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:47,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:47,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:42:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984306842] [2022-07-21 16:42:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:47,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:42:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:47,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:42:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:42:47,271 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-21 16:42:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:47,391 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-07-21 16:42:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:42:47,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-07-21 16:42:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:47,392 INFO L225 Difference]: With dead ends: 146 [2022-07-21 16:42:47,392 INFO L226 Difference]: Without dead ends: 146 [2022-07-21 16:42:47,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:42:47,392 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:47,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 221 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:42:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-21 16:42:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2022-07-21 16:42:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 139 states have internal predecessors, (153), 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-21 16:42:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-07-21 16:42:47,395 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 28 [2022-07-21 16:42:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:47,395 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-07-21 16:42:47,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-21 16:42:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2022-07-21 16:42:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 16:42:47,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:47,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:42:47,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:47,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:47,596 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:47,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1612916602, now seen corresponding path program 1 times [2022-07-21 16:42:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:47,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001768666] [2022-07-21 16:42:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:47,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:47,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:47,599 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:47,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 16:42:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:47,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 16:42:47,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:42:47,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:42:47,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:42:47,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001768666] [2022-07-21 16:42:47,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001768666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:42:47,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:42:47,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:42:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471867890] [2022-07-21 16:42:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:42:47,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:42:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:42:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:42:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:42:47,716 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-21 16:42:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:42:47,767 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-07-21 16:42:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:42:47,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-07-21 16:42:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:42:47,768 INFO L225 Difference]: With dead ends: 141 [2022-07-21 16:42:47,768 INFO L226 Difference]: Without dead ends: 141 [2022-07-21 16:42:47,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-21 16:42:47,769 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:42:47,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 104 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:42:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-21 16:42:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-21 16:42:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 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-21 16:42:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2022-07-21 16:42:47,771 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 28 [2022-07-21 16:42:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:42:47,771 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2022-07-21 16:42:47,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-21 16:42:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-07-21 16:42:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 16:42:47,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:42:47,772 INFO L195 NwaCegarLoop]: trace histogram [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-21 16:42:47,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 16:42:47,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:42:47,980 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:42:47,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:42:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash -556753399, now seen corresponding path program 1 times [2022-07-21 16:42:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:42:47,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495305406] [2022-07-21 16:42:47,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:42:47,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:42:47,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:42:47,982 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:42:47,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 16:42:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:42:48,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 16:42:48,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:42:48,114 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-21 16:42:48,147 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 16:42:48,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 16:42:48,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:42:48,261 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:42:48,262 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 29 [2022-07-21 16:42:48,298 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:42:48,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-21 16:42:48,368 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 25 treesize of output 13 [2022-07-21 16:42:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:42:48,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:42:48,484 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 16:42:48,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-21 16:42:48,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_598) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 16:42:48,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:42:48,510 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 20 treesize of output 21 [2022-07-21 16:42:48,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:42:48,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-21 16:42:48,528 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 11 treesize of output 9 [2022-07-21 16:43:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:05,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:43:05,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495305406] [2022-07-21 16:43:05,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495305406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:43:05,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:43:05,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-21 16:43:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159601105] [2022-07-21 16:43:05,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:43:05,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 16:43:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:43:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 16:43:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=265, Unknown=8, NotChecked=108, Total=462 [2022-07-21 16:43:05,414 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 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-21 16:43:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:43:06,098 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2022-07-21 16:43:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 16:43:06,099 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 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 30 [2022-07-21 16:43:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:43:06,099 INFO L225 Difference]: With dead ends: 177 [2022-07-21 16:43:06,099 INFO L226 Difference]: Without dead ends: 177 [2022-07-21 16:43:06,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=127, Invalid=383, Unknown=8, NotChecked=132, Total=650 [2022-07-21 16:43:06,100 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 94 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:43:06,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 540 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 367 Invalid, 0 Unknown, 682 Unchecked, 0.5s Time] [2022-07-21 16:43:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-21 16:43:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 149. [2022-07-21 16:43:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 125 states have (on average 1.312) internal successors, (164), 148 states have internal predecessors, (164), 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-21 16:43:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-07-21 16:43:06,103 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 30 [2022-07-21 16:43:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:43:06,103 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-07-21 16:43:06,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 22 states have internal predecessors, (56), 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-21 16:43:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-07-21 16:43:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 16:43:06,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:43:06,104 INFO L195 NwaCegarLoop]: trace histogram [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-21 16:43:06,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-21 16:43:06,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:43:06,317 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:43:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:43:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash -556753398, now seen corresponding path program 1 times [2022-07-21 16:43:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:43:06,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425433599] [2022-07-21 16:43:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:43:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:43:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:43:06,332 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:43:06,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 16:43:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:43:06,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 16:43:06,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:43:06,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 16:43:06,503 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-21 16:43:06,514 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:43:06,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:43:06,537 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-21 16:43:06,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:43:06,631 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:43:06,631 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 29 [2022-07-21 16:43:06,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:43:06,641 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-21 16:43:06,662 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 16:43:06,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-21 16:43:06,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:43:06,754 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 25 treesize of output 13 [2022-07-21 16:43:06,758 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 15 treesize of output 7 [2022-07-21 16:43:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:06,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:43:07,092 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_655) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-21 16:43:07,132 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_655) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-21 16:43:07,157 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_656) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_656) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_655) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2022-07-21 16:43:07,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:43:07,176 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 37 treesize of output 30 [2022-07-21 16:43:07,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:43:07,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-21 16:43:07,190 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 15 treesize of output 11 [2022-07-21 16:43:07,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:43:07,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-21 16:43:07,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:43:07,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-21 16:43:07,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:43:07,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-21 16:43:07,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:43:07,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-21 16:43:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:07,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:43:07,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425433599] [2022-07-21 16:43:07,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425433599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:43:07,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:43:07,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-21 16:43:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282202962] [2022-07-21 16:43:07,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:43:07,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 16:43:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:43:07,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 16:43:07,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=260, Unknown=3, NotChecked=102, Total=420 [2022-07-21 16:43:07,387 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 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-21 16:43:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:43:09,747 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2022-07-21 16:43:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 16:43:09,748 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 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 30 [2022-07-21 16:43:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:43:09,749 INFO L225 Difference]: With dead ends: 214 [2022-07-21 16:43:09,749 INFO L226 Difference]: Without dead ends: 214 [2022-07-21 16:43:09,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=659, Unknown=3, NotChecked=168, Total=992 [2022-07-21 16:43:09,750 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 223 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 504 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:43:09,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 644 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1012 Invalid, 0 Unknown, 504 Unchecked, 1.7s Time] [2022-07-21 16:43:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-21 16:43:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 148. [2022-07-21 16:43:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 147 states have internal predecessors, (162), 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-21 16:43:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-07-21 16:43:09,752 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 30 [2022-07-21 16:43:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:43:09,752 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-07-21 16:43:09,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 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-21 16:43:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-07-21 16:43:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 16:43:09,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:43:09,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:43:09,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 16:43:09,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:43:09,953 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:43:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:43:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash -598771652, now seen corresponding path program 1 times [2022-07-21 16:43:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:43:09,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704622735] [2022-07-21 16:43:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:43:09,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:43:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:43:09,955 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:43:09,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 16:43:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:43:10,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 16:43:10,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:43:10,097 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-21 16:43:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:43:10,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:43:10,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:43:10,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704622735] [2022-07-21 16:43:10,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704622735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:43:10,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:43:10,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:43:10,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62975467] [2022-07-21 16:43:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:43:10,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:43:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:43:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:43:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:43:10,107 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-21 16:43:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:43:10,299 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-07-21 16:43:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:43:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2022-07-21 16:43:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:43:10,300 INFO L225 Difference]: With dead ends: 152 [2022-07-21 16:43:10,300 INFO L226 Difference]: Without dead ends: 152 [2022-07-21 16:43:10,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-21 16:43:10,301 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:43:10,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 279 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:43:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-21 16:43:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2022-07-21 16:43:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 149 states have internal predecessors, (163), 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-21 16:43:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2022-07-21 16:43:10,303 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 30 [2022-07-21 16:43:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:43:10,303 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2022-07-21 16:43:10,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-21 16:43:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2022-07-21 16:43:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 16:43:10,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:43:10,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:43:10,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 16:43:10,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:43:10,509 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:43:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:43:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash 51447198, now seen corresponding path program 1 times [2022-07-21 16:43:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:43:10,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404178676] [2022-07-21 16:43:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:43:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:43:10,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:43:10,511 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:43:10,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 16:43:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:43:10,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 16:43:10,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:43:10,699 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-21 16:43:10,715 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-21 16:43:10,756 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:43:10,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:43:10,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:43:10,781 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-21 16:43:10,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:43:10,820 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 16 treesize of output 8 [2022-07-21 16:43:10,868 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-21 16:43:10,886 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-21 16:43:10,898 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:43:10,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:43:10,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:43:10,944 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 16 treesize of output 18 [2022-07-21 16:43:10,975 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 16 treesize of output 8 [2022-07-21 16:43:11,020 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-21 16:43:11,029 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-21 16:43:11,077 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-21 16:43:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:11,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:43:11,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_786) |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-21 16:43:11,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_786) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) ~unnamed1~0~BLACK)) is different from false [2022-07-21 16:43:11,165 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_786) |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-21 16:43:11,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_786) |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-21 16:43:11,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_783) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_786) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) (_ bv0 1))))) is different from false [2022-07-21 16:43:11,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_783) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_786) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) (_ bv0 1))))) is different from false [2022-07-21 16:43:11,357 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:43:11,357 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 13 treesize of output 12 [2022-07-21 16:43:11,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_783) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_786) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) is different from false [2022-07-21 16:43:11,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32)) (v_ArrVal_777 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_777)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_783) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_786) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) is different from false [2022-07-21 16:43:11,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_12| (_ BitVec 32))) (or (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32)) (v_ArrVal_777 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_777)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_783) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_786) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) (_ bv0 1))))) is different from false [2022-07-21 16:43:11,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_786 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| (_ BitVec 32)) (v_ArrVal_777 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_777)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_783) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_786) |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-21 16:43:11,443 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-21 16:43:11,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-21 16:43:11,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:43:11,449 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 36 treesize of output 24 [2022-07-21 16:43:11,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 16:43:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 16:43:11,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:43:11,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404178676] [2022-07-21 16:43:11,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404178676] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:43:11,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:43:11,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-07-21 16:43:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685438789] [2022-07-21 16:43:11,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:43:11,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 16:43:11,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:43:11,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 16:43:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=307, Unknown=11, NotChecked=450, Total=870 [2022-07-21 16:43:11,480 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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-21 16:43:16,870 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 36 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 16:43:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:43:17,746 INFO L93 Difference]: Finished difference Result 298 states and 322 transitions. [2022-07-21 16:43:17,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:43:17,747 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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 30 [2022-07-21 16:43:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:43:17,747 INFO L225 Difference]: With dead ends: 298 [2022-07-21 16:43:17,747 INFO L226 Difference]: Without dead ends: 298 [2022-07-21 16:43:17,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=233, Invalid=788, Unknown=11, NotChecked=690, Total=1722 [2022-07-21 16:43:17,748 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 426 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2193 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:43:17,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 566 Invalid, 2827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 530 Invalid, 0 Unknown, 2193 Unchecked, 0.6s Time] [2022-07-21 16:43:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-21 16:43:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 164. [2022-07-21 16:43:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 140 states have (on average 1.2714285714285714) internal successors, (178), 163 states have internal predecessors, (178), 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-21 16:43:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2022-07-21 16:43:17,751 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 30 [2022-07-21 16:43:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:43:17,751 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2022-07-21 16:43:17,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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-21 16:43:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2022-07-21 16:43:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 16:43:17,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:43:17,752 INFO L195 NwaCegarLoop]: trace histogram [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-21 16:43:17,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-21 16:43:17,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:43:17,960 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:43:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:43:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1695861524, now seen corresponding path program 1 times [2022-07-21 16:43:17,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:43:17,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25041446] [2022-07-21 16:43:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:43:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:43:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:43:17,964 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:43:17,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-21 16:43:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:43:18,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 16:43:18,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:43:18,170 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-21 16:43:18,172 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-21 16:43:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:18,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:43:18,366 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 16:43:18,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:43:18,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 16:43:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:18,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:43:18,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25041446] [2022-07-21 16:43:18,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25041446] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:43:18,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:43:18,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2022-07-21 16:43:18,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755223727] [2022-07-21 16:43:18,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:43:18,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 16:43:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:43:18,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 16:43:18,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-07-21 16:43:18,416 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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-21 16:43:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:43:19,500 INFO L93 Difference]: Finished difference Result 213 states and 231 transitions. [2022-07-21 16:43:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 16:43:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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 31 [2022-07-21 16:43:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:43:19,501 INFO L225 Difference]: With dead ends: 213 [2022-07-21 16:43:19,501 INFO L226 Difference]: Without dead ends: 213 [2022-07-21 16:43:19,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-07-21 16:43:19,502 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 212 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 16:43:19,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 520 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 16:43:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-21 16:43:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 176. [2022-07-21 16:43:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 152 states have (on average 1.263157894736842) internal successors, (192), 175 states have internal predecessors, (192), 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-21 16:43:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2022-07-21 16:43:19,505 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 31 [2022-07-21 16:43:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:43:19,505 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2022-07-21 16:43:19,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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-21 16:43:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2022-07-21 16:43:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 16:43:19,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:43:19,506 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:43:19,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 16:43:19,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:43:19,712 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:43:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:43:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash 668551831, now seen corresponding path program 2 times [2022-07-21 16:43:19,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:43:19,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441064116] [2022-07-21 16:43:19,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:43:19,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:43:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:43:19,714 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:43:19,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-21 16:43:19,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:43:19,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:43:19,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 16:43:19,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:43:19,906 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-21 16:43:19,918 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-21 16:43:19,951 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:43:19,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:43:20,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:43:20,002 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-21 16:43:20,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:43:20,038 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 16 treesize of output 8 [2022-07-21 16:43:20,080 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-21 16:43:20,094 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-21 16:43:20,103 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:43:20,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:43:20,128 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-21 16:43:20,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:43:20,161 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 16 treesize of output 8 [2022-07-21 16:43:20,198 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-21 16:43:20,216 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-21 16:43:20,261 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-21 16:43:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:20,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:43:20,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_897) |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-21 16:43:20,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_897) |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-21 16:43:20,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_897) |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-21 16:43:20,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) ~unnamed1~0~BLACK)) is different from false [2022-07-21 16:43:20,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_14| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_14|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_895) |v_ULTIMATE.start_main_#t~malloc4#1.base_14| v_ArrVal_897) |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-21 16:43:20,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_14| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_895) |v_ULTIMATE.start_main_#t~malloc4#1.base_14| v_ArrVal_897) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_14|) (_ bv0 1))))) is different from false [2022-07-21 16:43:20,436 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 16:43:20,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 16:43:20,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_14| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_895) |v_ULTIMATE.start_main_#t~malloc4#1.base_14| v_ArrVal_897) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) ~unnamed1~0~BLACK) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc4#1.base_14|))) is different from false [2022-07-21 16:43:20,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_14| (_ BitVec 32)) (v_ArrVal_888 (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc4#1.base_14|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_888)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_895) |v_ULTIMATE.start_main_#t~malloc4#1.base_14| v_ArrVal_897) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) ~unnamed1~0~BLACK))) is different from false [2022-07-21 16:43:20,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_16| (_ BitVec 32)) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_14| (_ BitVec 32)) (v_ArrVal_888 (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_16|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc4#1.base_14|) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_888)) |v_ULTIMATE.start_main_#t~malloc4#1.base_16| v_ArrVal_895) |v_ULTIMATE.start_main_#t~malloc4#1.base_14| v_ArrVal_897) |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-21 16:43:20,577 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-21 16:43:20,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-21 16:43:20,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:43:20,583 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 36 treesize of output 24 [2022-07-21 16:43:20,586 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-21 16:43:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-21 16:43:20,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:43:20,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441064116] [2022-07-21 16:43:20,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441064116] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:43:20,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:43:20,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-07-21 16:43:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553804385] [2022-07-21 16:43:20,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:43:20,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 16:43:20,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:43:20,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 16:43:20,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=338, Unknown=14, NotChecked=414, Total=870 [2022-07-21 16:43:20,613 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 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-21 16:43:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:43:21,792 INFO L93 Difference]: Finished difference Result 277 states and 302 transitions. [2022-07-21 16:43:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 16:43:21,793 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 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 31 [2022-07-21 16:43:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:43:21,794 INFO L225 Difference]: With dead ends: 277 [2022-07-21 16:43:21,794 INFO L226 Difference]: Without dead ends: 277 [2022-07-21 16:43:21,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=782, Unknown=14, NotChecked=612, Total=1640 [2022-07-21 16:43:21,794 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 211 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1507 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:43:21,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 738 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 596 Invalid, 0 Unknown, 1507 Unchecked, 0.8s Time] [2022-07-21 16:43:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-21 16:43:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 183. [2022-07-21 16:43:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 182 states have internal predecessors, (200), 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-21 16:43:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2022-07-21 16:43:21,797 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 200 transitions. Word has length 31 [2022-07-21 16:43:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:43:21,797 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 200 transitions. [2022-07-21 16:43:21,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 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-21 16:43:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 200 transitions. [2022-07-21 16:43:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 16:43:21,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:43:21,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:43:21,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-21 16:43:21,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:43:21,998 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:43:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:43:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1032099296, now seen corresponding path program 1 times [2022-07-21 16:43:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:43:21,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272011444] [2022-07-21 16:43:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:43:21,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:43:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:43:22,000 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:43:22,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-21 16:43:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:43:22,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 16:43:22,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:43:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 16:43:22,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 16:43:22,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:43:22,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272011444] [2022-07-21 16:43:22,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272011444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:43:22,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:43:22,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:43:22,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666325173] [2022-07-21 16:43:22,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:43:22,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:43:22,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:43:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:43:22,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:43:22,137 INFO L87 Difference]: Start difference. First operand 183 states and 200 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-21 16:43:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:43:22,185 INFO L93 Difference]: Finished difference Result 182 states and 198 transitions. [2022-07-21 16:43:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:43:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2022-07-21 16:43:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:43:22,186 INFO L225 Difference]: With dead ends: 182 [2022-07-21 16:43:22,186 INFO L226 Difference]: Without dead ends: 182 [2022-07-21 16:43:22,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-21 16:43:22,187 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:43:22,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:43:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-21 16:43:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-07-21 16:43:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 159 states have (on average 1.2452830188679245) internal successors, (198), 181 states have internal predecessors, (198), 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-21 16:43:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2022-07-21 16:43:22,189 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 32 [2022-07-21 16:43:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:43:22,189 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2022-07-21 16:43:22,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-21 16:43:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2022-07-21 16:43:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 16:43:22,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:43:22,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:43:22,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-21 16:43:22,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:43:22,398 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:43:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:43:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -290013693, now seen corresponding path program 1 times [2022-07-21 16:43:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:43:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989981545] [2022-07-21 16:43:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:43:22,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:43:22,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:43:22,400 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:43:22,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-21 16:43:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:43:22,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 16:43:22,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:43:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:33,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:43:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:44,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 16:43:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989981545] [2022-07-21 16:43:44,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989981545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:43:44,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 16:43:44,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-07-21 16:43:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55602340] [2022-07-21 16:43:44,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 16:43:44,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 16:43:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 16:43:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 16:43:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=130, Unknown=10, NotChecked=0, Total=182 [2022-07-21 16:43:44,437 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 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-21 16:43:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:43:44,681 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2022-07-21 16:43:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 16:43:44,681 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 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 34 [2022-07-21 16:43:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:43:44,682 INFO L225 Difference]: With dead ends: 192 [2022-07-21 16:43:44,682 INFO L226 Difference]: Without dead ends: 167 [2022-07-21 16:43:44,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=42, Invalid=130, Unknown=10, NotChecked=0, Total=182 [2022-07-21 16:43:44,682 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 16 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:43:44,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 373 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2022-07-21 16:43:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-21 16:43:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-21 16:43:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 166 states have internal predecessors, (182), 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-21 16:43:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2022-07-21 16:43:44,685 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 34 [2022-07-21 16:43:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:43:44,685 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2022-07-21 16:43:44,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 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-21 16:43:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2022-07-21 16:43:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 16:43:44,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:43:44,691 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:43:44,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-21 16:43:44,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 16:43:44,898 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-07-21 16:43:44,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:43:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1748016096, now seen corresponding path program 2 times [2022-07-21 16:43:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 16:43:44,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660503555] [2022-07-21 16:43:44,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:43:44,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 16:43:44,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 16:43:44,900 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 16:43:44,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-21 16:43:45,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:43:45,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:43:45,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-21 16:43:45,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:43:45,076 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-21 16:43:45,115 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 16:43:45,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 16:43:45,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:43:45,221 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 16:43:45,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-21 16:43:45,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:43:45,231 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 19 treesize of output 18 [2022-07-21 16:43:45,304 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-21 16:43:45,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2022-07-21 16:43:45,318 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-21 16:43:45,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-21 16:43:45,658 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-21 16:43:45,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-21 16:43:45,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-21 16:43:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:43:45,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:43:50,085 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (_ BitVec 32)) (v_ArrVal_1016 (_ BitVec 32)) (|ULTIMATE.start_main_~null~0#1.base| (_ BitVec 32))) (= (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~null~0#1.base|) .cse1 v_ArrVal_1016)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~null~0#1.offset|) .cse1 v_ArrVal_1017)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) |ULTIMATE.start_main_~null~0#1.base|)) (forall ((v_ArrVal_1017 (_ BitVec 32)) (v_ArrVal_1016 (_ BitVec 32)) (|ULTIMATE.start_main_~null~0#1.base| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~null~0#1.offset|) .cse3 v_ArrVal_1017)))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~null~0#1.base|) .cse3 v_ArrVal_1016)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) is different from false [2022-07-21 16:43:52,108 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (_ BitVec 32)) (v_ArrVal_1016 (_ BitVec 32)) (|ULTIMATE.start_main_~null~0#1.base| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem5#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| |c_ULTIMATE.start_main_~null~0#1.offset|) .cse1 v_ArrVal_1017)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| |ULTIMATE.start_main_~null~0#1.base|) .cse1 v_ArrVal_1016)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (forall ((v_ArrVal_1017 (_ BitVec 32)) (v_ArrVal_1016 (_ BitVec 32)) (|ULTIMATE.start_main_~null~0#1.base| (_ BitVec 32))) (= |ULTIMATE.start_main_~null~0#1.base| (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem5#1.offset|))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| |ULTIMATE.start_main_~null~0#1.base|) .cse3 v_ArrVal_1016)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| |c_ULTIMATE.start_main_~null~0#1.offset|) .cse3 v_ArrVal_1017)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2022-07-21 16:43:52,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:43:52,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 810 treesize of output 629 [2022-07-21 16:44:27,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:44:27,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2809 treesize of output 1959