./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:18:09,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:18:09,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:18:09,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:18:09,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:18:09,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:18:09,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:18:09,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:18:09,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:18:09,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:18:09,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:18:09,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:18:09,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:18:09,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:18:09,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:18:09,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:18:09,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:18:09,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:18:09,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:18:09,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:18:09,685 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:18:09,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:18:09,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:18:09,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:18:09,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:18:09,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:18:09,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:18:09,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:18:09,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:18:09,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:18:09,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:18:09,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:18:09,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:18:09,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:18:09,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:18:09,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:18:09,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:18:09,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:18:09,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:18:09,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:18:09,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:18:09,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:18:09,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:18:09,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:18:09,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:18:09,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:18:09,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:18:09,738 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:18:09,739 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:18:09,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:18:09,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:18:09,740 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:18:09,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:18:09,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:18:09,741 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:18:09,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:18:09,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:18:09,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:18:09,742 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:18:09,742 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:18:09,742 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:18:09,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:18:09,744 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:18:09,744 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:18:09,744 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:18:09,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:18:09,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:18:09,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:18:09,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:18:09,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:18:09,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:18:09,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:18:09,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:18:09,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-07-20 06:18:09,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:18:09,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:18:09,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:18:09,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:18:09,999 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:18:10,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-20 06:18:10,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b26c0754/d46a1d335fab439396ed06867b7e47cc/FLAG3ef41cf0c [2022-07-20 06:18:10,574 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:18:10,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-20 06:18:10,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b26c0754/d46a1d335fab439396ed06867b7e47cc/FLAG3ef41cf0c [2022-07-20 06:18:10,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b26c0754/d46a1d335fab439396ed06867b7e47cc [2022-07-20 06:18:10,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:18:10,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:18:10,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:18:10,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:18:10,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:18:10,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:18:10" (1/1) ... [2022-07-20 06:18:10,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76dbbe7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:10, skipping insertion in model container [2022-07-20 06:18:10,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:18:10" (1/1) ... [2022-07-20 06:18:10,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:18:10,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:18:11,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-07-20 06:18:11,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:18:11,240 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:18:11,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-07-20 06:18:11,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:18:11,310 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:18:11,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11 WrapperNode [2022-07-20 06:18:11,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:18:11,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:18:11,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:18:11,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:18:11,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,380 INFO L137 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2022-07-20 06:18:11,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:18:11,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:18:11,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:18:11,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:18:11,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:18:11,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:18:11,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:18:11,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:18:11,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (1/1) ... [2022-07-20 06:18:11,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:18:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:11,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:18:11,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:18:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:18:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:18:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-20 06:18:11,497 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-20 06:18:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:18:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:18:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:18:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:18:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:18:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:18:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 06:18:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:18:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:18:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:18:11,587 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:18:11,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:18:11,929 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:18:11,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:18:11,951 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-20 06:18:11,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:18:11 BoogieIcfgContainer [2022-07-20 06:18:11,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:18:11,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:18:11,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:18:11,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:18:11,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:18:10" (1/3) ... [2022-07-20 06:18:11,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2135dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:18:11, skipping insertion in model container [2022-07-20 06:18:11,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:18:11" (2/3) ... [2022-07-20 06:18:11,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2135dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:18:11, skipping insertion in model container [2022-07-20 06:18:11,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:18:11" (3/3) ... [2022-07-20 06:18:11,963 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-07-20 06:18:11,976 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:18:11,976 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-07-20 06:18:12,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:18:12,036 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@7192ca8e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a125046 [2022-07-20 06:18:12,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-07-20 06:18:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:18:12,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:12,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:12,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348631, now seen corresponding path program 1 times [2022-07-20 06:18:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:12,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261411385] [2022-07-20 06:18:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:12,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:12,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:12,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261411385] [2022-07-20 06:18:12,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261411385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:12,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:12,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:18:12,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582699773] [2022-07-20 06:18:12,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:12,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:18:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:12,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:18:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:18:12,312 INFO L87 Difference]: Start difference. First operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:18:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:12,453 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-07-20 06:18:12,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:18:12,456 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:18:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:12,466 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:18:12,466 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:18:12,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:18:12,472 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:12,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:18:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-20 06:18:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.88) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-07-20 06:18:12,508 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 7 [2022-07-20 06:18:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:12,509 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-07-20 06:18:12,509 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:18:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-07-20 06:18:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:18:12,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:12,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:12,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:18:12,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348632, now seen corresponding path program 1 times [2022-07-20 06:18:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:12,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084647236] [2022-07-20 06:18:12,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:12,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:12,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084647236] [2022-07-20 06:18:12,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084647236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:12,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:12,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:18:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251184918] [2022-07-20 06:18:12,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:12,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:18:12,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:12,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:18:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:18:12,585 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:18:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:12,657 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-20 06:18:12,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:18:12,657 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:18:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:12,659 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:18:12,659 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:18:12,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:18:12,661 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:12,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:18:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 06:18:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.82) internal successors, (91), 84 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-07-20 06:18:12,674 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 7 [2022-07-20 06:18:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:12,676 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-07-20 06:18:12,677 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:18:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-07-20 06:18:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:18:12,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:12,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:12,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:18:12,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 927333361, now seen corresponding path program 1 times [2022-07-20 06:18:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:12,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49055710] [2022-07-20 06:18:12,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:12,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49055710] [2022-07-20 06:18:12,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49055710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:12,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:12,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:18:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064471969] [2022-07-20 06:18:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:18:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:18:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:18:12,864 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:18:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:13,085 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-07-20 06:18:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:18:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-20 06:18:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:13,093 INFO L225 Difference]: With dead ends: 91 [2022-07-20 06:18:13,093 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:18:13,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:18:13,100 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 22 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:13,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 364 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:18:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:18:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-07-20 06:18:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.78) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-07-20 06:18:13,131 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 14 [2022-07-20 06:18:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:13,132 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-07-20 06:18:13,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:18:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-07-20 06:18:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:18:13,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:13,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:13,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:18:13,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 927333360, now seen corresponding path program 1 times [2022-07-20 06:18:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:13,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874838970] [2022-07-20 06:18:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:13,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874838970] [2022-07-20 06:18:13,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874838970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:13,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:13,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:18:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901141034] [2022-07-20 06:18:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:13,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:18:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:13,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:18:13,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:18:13,240 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:18:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:13,424 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-07-20 06:18:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:18:13,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-20 06:18:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:13,426 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:18:13,426 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:18:13,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:18:13,434 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 15 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:13,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 316 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:18:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:18:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-07-20 06:18:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.74) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-20 06:18:13,452 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2022-07-20 06:18:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:13,453 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-20 06:18:13,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:18:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-20 06:18:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:18:13,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:13,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:13,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:18:13,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:13,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1763306156, now seen corresponding path program 1 times [2022-07-20 06:18:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:13,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321905971] [2022-07-20 06:18:13,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 06:18:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:13,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321905971] [2022-07-20 06:18:13,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321905971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:13,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:13,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:18:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869335242] [2022-07-20 06:18:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:13,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:18:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:18:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:18:13,537 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:18:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:13,610 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-07-20 06:18:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:18:13,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-20 06:18:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:13,614 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:18:13,614 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 06:18:13,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:18:13,615 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:13,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 211 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 06:18:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-20 06:18:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-07-20 06:18:13,620 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2022-07-20 06:18:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:13,621 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-07-20 06:18:13,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:18:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-07-20 06:18:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:18:13,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:13,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:13,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:18:13,622 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:13,623 INFO L85 PathProgramCache]: Analyzing trace with hash 958467140, now seen corresponding path program 1 times [2022-07-20 06:18:13,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:13,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131374682] [2022-07-20 06:18:13,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:13,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,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-20 06:18:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:13,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131374682] [2022-07-20 06:18:13,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131374682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:13,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:13,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:18:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124686147] [2022-07-20 06:18:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:13,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:18:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:18:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:18:13,725 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:18:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:13,791 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-07-20 06:18:13,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:18:13,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-20 06:18:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:13,793 INFO L225 Difference]: With dead ends: 91 [2022-07-20 06:18:13,793 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:18:13,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:18:13,794 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:13,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:18:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-07-20 06:18:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-07-20 06:18:13,799 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 17 [2022-07-20 06:18:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:13,799 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-07-20 06:18:13,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:18:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-07-20 06:18:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:18:13,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:13,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:13,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:18:13,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash 239866037, now seen corresponding path program 1 times [2022-07-20 06:18:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:13,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795376960] [2022-07-20 06:18:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 06:18:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:18:13,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:13,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795376960] [2022-07-20 06:18:13,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795376960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:13,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641648753] [2022-07-20 06:18:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:13,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:13,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:13,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:13,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 06:18:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:14,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:18:14,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:14,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:18:14,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641648753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:18:14,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:18:14,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-20 06:18:14,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951960598] [2022-07-20 06:18:14,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:14,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:18:14,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:14,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:18:14,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:18:14,186 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:18:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:14,269 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-07-20 06:18:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:18:14,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-07-20 06:18:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:14,270 INFO L225 Difference]: With dead ends: 92 [2022-07-20 06:18:14,270 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 06:18:14,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:18:14,271 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 14 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:14,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 06:18:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-20 06:18:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-20 06:18:14,275 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 31 [2022-07-20 06:18:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:14,276 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-20 06:18:14,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:18:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-20 06:18:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:18:14,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:14,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:14,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 06:18:14,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:14,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704317, now seen corresponding path program 1 times [2022-07-20 06:18:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:14,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394249775] [2022-07-20 06:18:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:14,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:18:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394249775] [2022-07-20 06:18:14,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394249775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801274599] [2022-07-20 06:18:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:14,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:14,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:14,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 06:18:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:14,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:18:14,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:14,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:15,054 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:18:15,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:18:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:15,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:15,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801274599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:15,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:15,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-07-20 06:18:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460330465] [2022-07-20 06:18:15,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:15,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:18:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:15,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:18:15,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:18:15,115 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:18:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:15,376 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-07-20 06:18:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:18:15,377 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-07-20 06:18:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:15,377 INFO L225 Difference]: With dead ends: 103 [2022-07-20 06:18:15,377 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 06:18:15,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:18:15,378 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 146 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:15,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 317 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2022-07-20 06:18:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 06:18:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2022-07-20 06:18:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.631578947368421) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-07-20 06:18:15,383 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 32 [2022-07-20 06:18:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:15,383 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-07-20 06:18:15,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:18:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-07-20 06:18:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:18:15,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:15,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:15,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:15,585 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,SelfDestructingSolverStorable7 [2022-07-20 06:18:15,585 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704316, now seen corresponding path program 1 times [2022-07-20 06:18:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:15,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535303505] [2022-07-20 06:18:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:15,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:15,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:15,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:18:15,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535303505] [2022-07-20 06:18:15,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535303505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742561901] [2022-07-20 06:18:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:15,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:15,815 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:15,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:18:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:15,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:18:15,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:15,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:16,167 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-20 06:18:16,167 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 14 treesize of output 13 [2022-07-20 06:18:16,183 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:18:16,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:18:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:16,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:16,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742561901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:16,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:16,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-07-20 06:18:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996036487] [2022-07-20 06:18:16,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:16,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 06:18:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 06:18:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:18:16,358 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:18:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:16,855 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-07-20 06:18:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:18:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-07-20 06:18:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:16,856 INFO L225 Difference]: With dead ends: 91 [2022-07-20 06:18:16,856 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:18:16,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-07-20 06:18:16,857 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:16,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 515 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:18:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:18:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-07-20 06:18:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-07-20 06:18:16,862 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 32 [2022-07-20 06:18:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:16,862 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-07-20 06:18:16,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:18:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-07-20 06:18:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:18:16,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:16,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:16,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:17,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:17,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:17,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1122646220, now seen corresponding path program 2 times [2022-07-20 06:18:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:17,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008878441] [2022-07-20 06:18:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 06:18:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:18:17,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:17,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008878441] [2022-07-20 06:18:17,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008878441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:17,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461320915] [2022-07-20 06:18:17,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:18:17,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:17,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:17,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:17,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:18:17,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:18:17,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:18:17,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:18:17,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:18:17,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:18:17,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461320915] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:18:17,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:18:17,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-07-20 06:18:17,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836014541] [2022-07-20 06:18:17,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:17,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:18:17,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:17,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:18:17,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:18:17,430 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:18:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:17,553 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-20 06:18:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:18:17,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-07-20 06:18:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:17,554 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:18:17,554 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:18:17,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:18:17,555 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 144 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:17,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:18:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-20 06:18:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-07-20 06:18:17,558 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 46 [2022-07-20 06:18:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:17,559 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-07-20 06:18:17,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:18:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-07-20 06:18:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:18:17,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:17,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:17,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:17,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:17,775 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash 186649324, now seen corresponding path program 1 times [2022-07-20 06:18:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:17,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339026684] [2022-07-20 06:18:17,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:17,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:18:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:17,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339026684] [2022-07-20 06:18:17,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339026684] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:17,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339068605] [2022-07-20 06:18:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:17,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:17,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:17,989 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:17,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:18:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:18,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 06:18:18,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:18,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:18,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:18:18,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:18,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2022-07-20 06:18:18,340 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:18,340 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-20 06:18:18,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:18,479 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-20 06:18:18,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2022-07-20 06:18:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:18:18,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:18,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339068605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:18,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:18,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2022-07-20 06:18:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268791330] [2022-07-20 06:18:18,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:18,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 06:18:18,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 06:18:18,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-07-20 06:18:18,677 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:18,998 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-07-20 06:18:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:18:18,999 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-07-20 06:18:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:18,999 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:18:19,000 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:18:19,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2022-07-20 06:18:19,001 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 91 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:19,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 420 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 300 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2022-07-20 06:18:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:18:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2022-07-20 06:18:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-07-20 06:18:19,004 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 47 [2022-07-20 06:18:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:19,005 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-07-20 06:18:19,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-07-20 06:18:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:18:19,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:19,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:19,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:19,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-20 06:18:19,216 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash 186649325, now seen corresponding path program 1 times [2022-07-20 06:18:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776106076] [2022-07-20 06:18:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:19,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 06:18:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:19,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776106076] [2022-07-20 06:18:19,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776106076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:19,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544171455] [2022-07-20 06:18:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:19,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:19,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:19,402 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-20 06:18:19,407 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-20 06:18:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:19,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 06:18:19,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:19,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:19,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:18:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:21,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:18:21,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:18:21,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:18:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 14 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:18:21,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:22,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544171455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:22,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:22,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2022-07-20 06:18:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848437930] [2022-07-20 06:18:22,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:22,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 06:18:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:22,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 06:18:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=187, Unknown=1, NotChecked=0, Total=240 [2022-07-20 06:18:22,071 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 14 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:18:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:22,271 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-07-20 06:18:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:18:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2022-07-20 06:18:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:22,272 INFO L225 Difference]: With dead ends: 95 [2022-07-20 06:18:22,272 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 06:18:22,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=74, Invalid=231, Unknown=1, NotChecked=0, Total=306 [2022-07-20 06:18:22,273 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 272 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:22,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 109 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 166 Invalid, 0 Unknown, 3 Unchecked, 0.2s Time] [2022-07-20 06:18:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 06:18:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-07-20 06:18:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-07-20 06:18:22,275 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 47 [2022-07-20 06:18:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:22,276 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-07-20 06:18:22,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:18:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-07-20 06:18:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:18:22,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:22,276 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:22,303 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-20 06:18:22,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:22,480 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1018625491, now seen corresponding path program 1 times [2022-07-20 06:18:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:22,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092597371] [2022-07-20 06:18:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:22,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:22,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:22,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 06:18:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:22,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092597371] [2022-07-20 06:18:22,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092597371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:22,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:22,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:18:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073879350] [2022-07-20 06:18:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:22,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:18:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:22,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:18:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:18:22,560 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:22,620 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-07-20 06:18:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:18:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-20 06:18:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:22,622 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:18:22,622 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:18:22,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:18:22,623 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:22,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 117 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:18:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-07-20 06:18:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 76 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-07-20 06:18:22,626 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 49 [2022-07-20 06:18:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:22,626 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-07-20 06:18:22,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-07-20 06:18:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:18:22,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:22,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:22,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:18:22,627 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash 353447346, now seen corresponding path program 1 times [2022-07-20 06:18:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:22,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924732387] [2022-07-20 06:18:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:22,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:18:23,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:23,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924732387] [2022-07-20 06:18:23,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924732387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:23,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815782331] [2022-07-20 06:18:23,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:23,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:23,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:23,023 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-20 06:18:23,023 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-20 06:18:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:23,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:18:23,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:23,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:23,441 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 9 treesize of output 5 [2022-07-20 06:18:23,554 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1824 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1824) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 06:18:23,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:23,582 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-20 06:18:23,597 INFO L356 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-07-20 06:18:23,597 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 23 treesize of output 24 [2022-07-20 06:18:23,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 06:18:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-07-20 06:18:23,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:23,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1832 (Array Int Int)) (|v_node_create_~temp~0#1.base_48| Int) (v_ArrVal_1831 Int)) (or (not (< |v_node_create_~temp~0#1.base_48| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_48| v_ArrVal_1831) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_48| v_ArrVal_1832) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) 1) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_48|) 0)))) is different from false [2022-07-20 06:18:23,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815782331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:23,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:23,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2022-07-20 06:18:23,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907539830] [2022-07-20 06:18:23,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:23,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 06:18:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 06:18:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=527, Unknown=2, NotChecked=94, Total=702 [2022-07-20 06:18:23,701 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:24,206 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-07-20 06:18:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:18:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-20 06:18:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:24,208 INFO L225 Difference]: With dead ends: 111 [2022-07-20 06:18:24,208 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 06:18:24,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=919, Unknown=2, NotChecked=126, Total=1190 [2022-07-20 06:18:24,209 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 87 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:24,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 543 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 535 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2022-07-20 06:18:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 06:18:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2022-07-20 06:18:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-07-20 06:18:24,212 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 51 [2022-07-20 06:18:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:24,212 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-07-20 06:18:24,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-07-20 06:18:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:18:24,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:24,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:24,240 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-20 06:18:24,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:24,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 353447347, now seen corresponding path program 1 times [2022-07-20 06:18:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:24,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486806019] [2022-07-20 06:18:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:24,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:18:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:25,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486806019] [2022-07-20 06:18:25,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486806019] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:25,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122209711] [2022-07-20 06:18:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:25,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:25,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:25,106 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-20 06:18:25,116 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-20 06:18:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:25,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-20 06:18:25,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:25,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:25,670 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 17 [2022-07-20 06:18:25,674 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 11 [2022-07-20 06:18:25,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:25,950 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 31 treesize of output 31 [2022-07-20 06:18:25,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:25,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 06:18:25,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:25,968 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 29 treesize of output 29 [2022-07-20 06:18:25,976 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 06:18:25,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-20 06:18:26,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-20 06:18:26,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-20 06:18:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:26,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:26,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_51| Int) (v_ArrVal_2095 Int) (v_ArrVal_2097 (Array Int Int)) (v_ArrVal_2096 (Array Int Int))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_51|) 0)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_51| v_ArrVal_2096) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (<= (+ .cse0 8) (select (store |c_#length| |v_node_create_~temp~0#1.base_51| v_ArrVal_2095) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_51| v_ArrVal_2097) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (<= 0 (+ .cse0 4)))) (not (< |v_node_create_~temp~0#1.base_51| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:18:26,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122209711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:26,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:26,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-07-20 06:18:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943879435] [2022-07-20 06:18:26,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:26,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:18:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:18:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1224, Unknown=3, NotChecked=70, Total=1406 [2022-07-20 06:18:26,298 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:27,833 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-07-20 06:18:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:18:27,833 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-20 06:18:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:27,834 INFO L225 Difference]: With dead ends: 119 [2022-07-20 06:18:27,834 INFO L226 Difference]: Without dead ends: 119 [2022-07-20 06:18:27,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=221, Invalid=2128, Unknown=7, NotChecked=94, Total=2450 [2022-07-20 06:18:27,836 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 177 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:27,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1290 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 958 Invalid, 0 Unknown, 98 Unchecked, 0.6s Time] [2022-07-20 06:18:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-20 06:18:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2022-07-20 06:18:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-07-20 06:18:27,839 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 51 [2022-07-20 06:18:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:27,840 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-07-20 06:18:27,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-07-20 06:18:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:18:27,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:27,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:27,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-20 06:18:28,066 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,SelfDestructingSolverStorable14 [2022-07-20 06:18:28,066 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:28,067 INFO L85 PathProgramCache]: Analyzing trace with hash 353294446, now seen corresponding path program 1 times [2022-07-20 06:18:28,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:28,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104868430] [2022-07-20 06:18:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 06:18:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:28,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104868430] [2022-07-20 06:18:28,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104868430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:28,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:28,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:18:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899010387] [2022-07-20 06:18:28,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:28,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:18:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:28,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:18:28,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:18:28,176 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:28,246 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-07-20 06:18:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:18:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-20 06:18:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:28,248 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:18:28,248 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 06:18:28,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:18:28,249 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:28,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 158 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 06:18:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2022-07-20 06:18:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-07-20 06:18:28,253 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 51 [2022-07-20 06:18:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:28,264 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-07-20 06:18:28,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-07-20 06:18:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:18:28,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:28,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:28,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:18:28,266 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:28,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:28,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893007, now seen corresponding path program 1 times [2022-07-20 06:18:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:28,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779023645] [2022-07-20 06:18:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-20 06:18:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779023645] [2022-07-20 06:18:28,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779023645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:28,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:28,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:18:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840193185] [2022-07-20 06:18:28,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:28,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:18:28,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:28,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:18:28,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:18:28,357 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:28,467 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-07-20 06:18:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:18:28,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-20 06:18:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:28,468 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:18:28,468 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:18:28,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:18:28,469 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 44 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:28,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 219 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:18:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-07-20 06:18:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.360655737704918) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-07-20 06:18:28,473 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 54 [2022-07-20 06:18:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:28,473 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-07-20 06:18:28,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-07-20 06:18:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:18:28,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:28,474 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:28,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:18:28,475 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893006, now seen corresponding path program 1 times [2022-07-20 06:18:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:28,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203762435] [2022-07-20 06:18:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:18:28,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:28,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203762435] [2022-07-20 06:18:28,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203762435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:28,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:28,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:18:28,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833888572] [2022-07-20 06:18:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:28,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:18:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:18:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:18:28,590 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:28,707 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-07-20 06:18:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:18:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-20 06:18:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:28,708 INFO L225 Difference]: With dead ends: 80 [2022-07-20 06:18:28,708 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 06:18:28,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:18:28,709 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:28,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 218 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 06:18:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-20 06:18:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-07-20 06:18:28,712 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 54 [2022-07-20 06:18:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:28,712 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-07-20 06:18:28,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-07-20 06:18:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:18:28,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:28,713 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:28,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:18:28,713 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948792, now seen corresponding path program 1 times [2022-07-20 06:18:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:28,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132749966] [2022-07-20 06:18:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-20 06:18:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:28,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132749966] [2022-07-20 06:18:28,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132749966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:28,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:28,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:18:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614606675] [2022-07-20 06:18:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:28,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:18:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:18:28,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:18:28,856 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:29,074 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-07-20 06:18:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:18:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-20 06:18:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:29,075 INFO L225 Difference]: With dead ends: 141 [2022-07-20 06:18:29,076 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 06:18:29,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:18:29,076 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 163 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:29,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 333 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:18:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 06:18:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2022-07-20 06:18:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-07-20 06:18:29,080 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 54 [2022-07-20 06:18:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:29,080 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-07-20 06:18:29,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-07-20 06:18:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:18:29,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:29,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:29,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:18:29,081 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948791, now seen corresponding path program 1 times [2022-07-20 06:18:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:29,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551727684] [2022-07-20 06:18:29,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:29,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:29,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:29,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:18:29,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:29,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551727684] [2022-07-20 06:18:29,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551727684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:29,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:29,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:18:29,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944255350] [2022-07-20 06:18:29,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:29,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:18:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:18:29,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:18:29,241 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:29,481 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2022-07-20 06:18:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:18:29,481 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-20 06:18:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:29,482 INFO L225 Difference]: With dead ends: 131 [2022-07-20 06:18:29,482 INFO L226 Difference]: Without dead ends: 131 [2022-07-20 06:18:29,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:18:29,483 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 150 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:29,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 336 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:18:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-20 06:18:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2022-07-20 06:18:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-07-20 06:18:29,485 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 54 [2022-07-20 06:18:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:29,486 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-07-20 06:18:29,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-07-20 06:18:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:18:29,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:29,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:29,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:18:29,487 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1467023000, now seen corresponding path program 1 times [2022-07-20 06:18:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700659183] [2022-07-20 06:18:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:29,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:29,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:29,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:30,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:30,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700659183] [2022-07-20 06:18:30,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700659183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:30,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767618626] [2022-07-20 06:18:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:30,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:30,597 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:18:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:30,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-20 06:18:30,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:30,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:31,127 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:18:31,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:18:31,272 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 13 treesize of output 9 [2022-07-20 06:18:31,343 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:31,344 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 34 treesize of output 35 [2022-07-20 06:18:31,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:31,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:31,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2022-07-20 06:18:31,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:18:31,798 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3142 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_3143 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3143)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3142)))) is different from true [2022-07-20 06:18:31,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:31,846 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:18:31,847 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 2 case distinctions, treesize of input 57 treesize of output 55 [2022-07-20 06:18:31,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:31,853 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 62 treesize of output 58 [2022-07-20 06:18:31,881 INFO L356 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2022-07-20 06:18:31,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2022-07-20 06:18:31,977 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 63 treesize of output 43 [2022-07-20 06:18:32,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:32,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:32,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 21 [2022-07-20 06:18:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-20 06:18:32,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:32,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3155 (Array Int Int)) (v_ArrVal_3156 (Array Int Int)) (|v_node_create_~temp~0#1.base_54| Int) (v_ArrVal_3154 Int)) (or (not (< |v_node_create_~temp~0#1.base_54| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_54|) 0)) (= 1 (select (store |c_#valid| |v_node_create_~temp~0#1.base_54| v_ArrVal_3154) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_54| v_ArrVal_3156))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_54| v_ArrVal_3155) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))))) is different from false [2022-07-20 06:18:32,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767618626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:32,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:32,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2022-07-20 06:18:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442709413] [2022-07-20 06:18:32,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:32,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-20 06:18:32,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:32,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-20 06:18:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2351, Unknown=2, NotChecked=198, Total=2756 [2022-07-20 06:18:32,402 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:18:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:33,236 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2022-07-20 06:18:33,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:18:33,237 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-07-20 06:18:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:33,237 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:18:33,237 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:18:33,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=315, Invalid=3231, Unknown=2, NotChecked=234, Total=3782 [2022-07-20 06:18:33,239 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 65 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:33,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 832 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 801 Invalid, 0 Unknown, 111 Unchecked, 0.5s Time] [2022-07-20 06:18:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:18:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-20 06:18:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-07-20 06:18:33,242 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 55 [2022-07-20 06:18:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:33,243 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-07-20 06:18:33,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:18:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-07-20 06:18:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:18:33,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:33,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:33,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-20 06:18:33,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:33,459 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1467022999, now seen corresponding path program 1 times [2022-07-20 06:18:33,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:33,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491291412] [2022-07-20 06:18:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:33,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:33,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:34,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:34,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491291412] [2022-07-20 06:18:34,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491291412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:34,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124899199] [2022-07-20 06:18:34,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:34,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:34,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:34,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:18:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:35,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-20 06:18:35,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:35,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:35,402 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:18:35,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:18:35,539 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 13 treesize of output 9 [2022-07-20 06:18:35,554 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 13 treesize of output 9 [2022-07-20 06:18:35,646 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:35,646 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 65 treesize of output 62 [2022-07-20 06:18:35,651 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 41 treesize of output 41 [2022-07-20 06:18:35,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:35,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 36 [2022-07-20 06:18:35,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:35,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-07-20 06:18:36,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:36,355 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:18:36,355 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 2 case distinctions, treesize of input 79 treesize of output 67 [2022-07-20 06:18:36,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:36,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:36,374 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:18:36,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2022-07-20 06:18:36,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:36,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 06:18:36,396 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:18:36,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-20 06:18:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:36,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:36,643 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:36,643 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 3 case distinctions, treesize of input 85 treesize of output 45 [2022-07-20 06:18:36,650 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-20 06:18:36,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 25 [2022-07-20 06:18:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:18:36,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:36,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3426 Int) (|v_node_create_~temp~0#1.base_57| Int) (v_ArrVal_3427 (Array Int Int)) (v_ArrVal_3428 (Array Int Int))) (or (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_57| v_ArrVal_3428)) (.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_57| v_ArrVal_3427))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select (store |c_#length| |v_node_create_~temp~0#1.base_57| v_ArrVal_3426) (select (select .cse1 .cse2) .cse3))))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_57|) 0)) (not (< |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:18:36,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124899199] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:36,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:36,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-07-20 06:18:36,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980123001] [2022-07-20 06:18:36,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:36,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-20 06:18:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-20 06:18:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2992, Unknown=8, NotChecked=110, Total=3306 [2022-07-20 06:18:36,997 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:18:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:39,450 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2022-07-20 06:18:39,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:18:39,452 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-07-20 06:18:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:39,453 INFO L225 Difference]: With dead ends: 167 [2022-07-20 06:18:39,453 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 06:18:39,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=450, Invalid=4948, Unknown=8, NotChecked=144, Total=5550 [2022-07-20 06:18:39,455 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 320 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:39,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1811 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2365 Invalid, 0 Unknown, 65 Unchecked, 1.1s Time] [2022-07-20 06:18:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 06:18:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 90. [2022-07-20 06:18:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 85 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-07-20 06:18:39,459 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 55 [2022-07-20 06:18:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:39,459 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-07-20 06:18:39,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:18:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-07-20 06:18:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:18:39,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:39,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:39,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:39,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-20 06:18:39,680 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash -938871693, now seen corresponding path program 1 times [2022-07-20 06:18:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:39,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210270911] [2022-07-20 06:18:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:18:39,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:39,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210270911] [2022-07-20 06:18:39,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210270911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:39,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:39,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:18:39,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019368489] [2022-07-20 06:18:39,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:39,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:18:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:39,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:18:39,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:18:39,814 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:39,979 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-07-20 06:18:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:18:39,979 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-07-20 06:18:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:39,980 INFO L225 Difference]: With dead ends: 118 [2022-07-20 06:18:39,980 INFO L226 Difference]: Without dead ends: 118 [2022-07-20 06:18:39,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:18:39,981 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:39,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 547 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-20 06:18:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2022-07-20 06:18:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-07-20 06:18:39,984 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 55 [2022-07-20 06:18:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:39,985 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-07-20 06:18:39,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-07-20 06:18:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 06:18:39,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:39,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:39,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 06:18:39,986 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:39,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash 959790642, now seen corresponding path program 1 times [2022-07-20 06:18:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:39,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460670045] [2022-07-20 06:18:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:40,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:18:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:40,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460670045] [2022-07-20 06:18:40,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460670045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:40,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25986085] [2022-07-20 06:18:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:40,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:40,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:40,316 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:40,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:18:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:40,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-20 06:18:40,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:40,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:18:40,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:18:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:40,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 18 treesize of output 20 [2022-07-20 06:18:40,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:18:40,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-20 06:18:40,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:18:40,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:18:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:18:41,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:18:41,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25986085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:41,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:18:41,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2022-07-20 06:18:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302227009] [2022-07-20 06:18:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:41,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 06:18:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:41,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 06:18:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-07-20 06:18:41,002 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:41,413 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-07-20 06:18:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:18:41,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-07-20 06:18:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:41,414 INFO L225 Difference]: With dead ends: 116 [2022-07-20 06:18:41,414 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 06:18:41,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 06:18:41,416 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 187 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:41,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 566 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:18:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 06:18:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2022-07-20 06:18:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-20 06:18:41,419 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 56 [2022-07-20 06:18:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:41,419 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-20 06:18:41,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-20 06:18:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:18:41,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:41,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:41,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-20 06:18:41,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 06:18:41,632 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:41,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash -588248546, now seen corresponding path program 2 times [2022-07-20 06:18:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:41,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64246459] [2022-07-20 06:18:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:41,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:42,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:42,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:43,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64246459] [2022-07-20 06:18:43,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64246459] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:43,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368523129] [2022-07-20 06:18:43,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:18:43,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:43,251 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:43,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 06:18:43,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:18:43,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:18:43,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 139 conjunts are in the unsatisfiable core [2022-07-20 06:18:43,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:43,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:43,712 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-20 06:18:43,720 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-20 06:18:44,095 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:18:44,096 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-20 06:18:44,124 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:18:44,126 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-20 06:18:44,141 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:18:44,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:18:44,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:18:44,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:18:44,328 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-20 06:18:44,338 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-20 06:18:44,432 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-07-20 06:18:44,433 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 2 case distinctions, treesize of input 94 treesize of output 57 [2022-07-20 06:18:44,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-20 06:18:44,726 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-20 06:18:44,726 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 44 [2022-07-20 06:18:44,737 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:18:44,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 06:18:44,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:18:44,885 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4120 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_4119 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4119)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_4120)))) is different from true [2022-07-20 06:18:44,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:44,930 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:18:44,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 106 [2022-07-20 06:18:44,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:44,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:44,944 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-20 06:18:44,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 110 [2022-07-20 06:18:44,956 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-07-20 06:18:44,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:18:45,368 INFO L356 Elim1Store]: treesize reduction 72, result has 4.0 percent of original size [2022-07-20 06:18:45,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 74 [2022-07-20 06:18:45,382 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-20 06:18:45,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 32 [2022-07-20 06:18:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-07-20 06:18:45,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:45,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4130 (Array Int Int)) (|v_node_create_~temp~0#1.base_60| Int) (v_ArrVal_4129 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_60| v_ArrVal_4129)) (.cse3 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_60| v_ArrVal_4130))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse3 .cse4) .cse5)) (.cse2 (+ (select (select .cse0 .cse4) .cse5) 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= 0 (select (select .cse3 .cse1) .cse2)))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_60|) 0)) (not (< |v_node_create_~temp~0#1.base_60| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:18:45,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368523129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:45,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 54 [2022-07-20 06:18:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186144719] [2022-07-20 06:18:45,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:45,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-20 06:18:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-20 06:18:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3146, Unknown=4, NotChecked=226, Total=3540 [2022-07-20 06:18:45,798 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 48 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:18:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:47,634 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-07-20 06:18:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:18:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 48 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-07-20 06:18:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:47,636 INFO L225 Difference]: With dead ends: 114 [2022-07-20 06:18:47,636 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 06:18:47,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=296, Invalid=5110, Unknown=4, NotChecked=290, Total=5700 [2022-07-20 06:18:47,638 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:47,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1495 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1400 Invalid, 0 Unknown, 314 Unchecked, 0.7s Time] [2022-07-20 06:18:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 06:18:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2022-07-20 06:18:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 105 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:18:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-07-20 06:18:47,642 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 59 [2022-07-20 06:18:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:47,642 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-07-20 06:18:47,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 48 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:18:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-07-20 06:18:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:18:47,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:47,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:47,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:47,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-20 06:18:47,855 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094492, now seen corresponding path program 1 times [2022-07-20 06:18:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:47,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119066481] [2022-07-20 06:18:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:48,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:48,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:18:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:48,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119066481] [2022-07-20 06:18:48,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119066481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:48,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:48,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-20 06:18:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213638510] [2022-07-20 06:18:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:48,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 06:18:48,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:48,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 06:18:48,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-07-20 06:18:48,327 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:18:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:49,092 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2022-07-20 06:18:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:18:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2022-07-20 06:18:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:49,094 INFO L225 Difference]: With dead ends: 176 [2022-07-20 06:18:49,094 INFO L226 Difference]: Without dead ends: 176 [2022-07-20 06:18:49,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 06:18:49,095 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 630 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:49,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 430 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:18:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-20 06:18:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 119. [2022-07-20 06:18:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 112 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:18:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2022-07-20 06:18:49,099 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 59 [2022-07-20 06:18:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:49,103 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2022-07-20 06:18:49,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:18:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-07-20 06:18:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:18:49,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:49,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:49,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 06:18:49,105 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094491, now seen corresponding path program 1 times [2022-07-20 06:18:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:49,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405286632] [2022-07-20 06:18:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:49,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:18:49,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405286632] [2022-07-20 06:18:49,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405286632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097151184] [2022-07-20 06:18:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:49,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:49,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:49,848 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:49,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 06:18:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:50,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-20 06:18:50,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:50,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:18:50,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:18:50,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:50,242 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-20 06:18:50,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:18:50,572 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:18:50,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:18:50,930 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 27 treesize of output 15 [2022-07-20 06:18:50,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-20 06:18:50,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:18:50,944 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 7 treesize of output 3 [2022-07-20 06:18:51,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:51,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:18:51,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:51,273 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 33 treesize of output 31 [2022-07-20 06:18:51,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:51,282 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 06:18:51,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-07-20 06:18:51,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:51,295 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 14 treesize of output 16 [2022-07-20 06:18:51,564 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:51,564 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 46 treesize of output 43 [2022-07-20 06:18:51,567 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 18 treesize of output 20 [2022-07-20 06:18:51,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:51,628 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 32 treesize of output 30 [2022-07-20 06:18:51,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:51,634 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 14 treesize of output 16 [2022-07-20 06:18:51,687 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-20 06:18:51,689 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-20 06:18:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:51,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:51,878 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4576 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4576) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4575 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-20 06:18:51,888 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4574 (Array Int Int)) (v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4576 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4573) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4574) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4576) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4575 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_4573) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-20 06:18:51,903 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4575 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_4573) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4574 (Array Int Int)) (v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4576 (Array Int Int))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_4573) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_4574) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4576) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-20 06:18:51,917 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4575 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_ArrVal_4573) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4574 (Array Int Int)) (v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4576 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4573) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4574) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4576) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-20 06:18:51,936 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4575 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_ArrVal_4573) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4574 (Array Int Int)) (v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4576 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4573) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4574) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_4576) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-20 06:18:52,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4588 (Array Int Int)) (v_ArrVal_4589 (Array Int Int)) (v_ArrVal_4587 Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| Int)) (or (and (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4575 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_4588) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_4589) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_ArrVal_4573) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4574 (Array Int Int)) (v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4576 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_4589))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_4588) .cse0 v_ArrVal_4573) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_4575) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_4587) (select (select (store (store .cse1 .cse0 v_ArrVal_4574) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_4576) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:18:52,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097151184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:52,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:52,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2022-07-20 06:18:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999216020] [2022-07-20 06:18:52,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:52,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-20 06:18:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:52,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-20 06:18:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2477, Unknown=9, NotChecked=630, Total=3306 [2022-07-20 06:18:52,033 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 41 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:53,171 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2022-07-20 06:18:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:18:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 41 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-07-20 06:18:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:53,172 INFO L225 Difference]: With dead ends: 166 [2022-07-20 06:18:53,172 INFO L226 Difference]: Without dead ends: 166 [2022-07-20 06:18:53,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=333, Invalid=3837, Unknown=14, NotChecked=786, Total=4970 [2022-07-20 06:18:53,174 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 487 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:53,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1167 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1135 Invalid, 0 Unknown, 50 Unchecked, 0.6s Time] [2022-07-20 06:18:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-20 06:18:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 120. [2022-07-20 06:18:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.26) internal successors, (126), 113 states have internal predecessors, (126), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:18:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2022-07-20 06:18:53,178 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 59 [2022-07-20 06:18:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:53,178 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2022-07-20 06:18:53,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.239130434782609) internal successors, (103), 41 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2022-07-20 06:18:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:18:53,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:53,180 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:53,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-20 06:18:53,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-20 06:18:53,388 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1526484642, now seen corresponding path program 1 times [2022-07-20 06:18:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:53,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311329532] [2022-07-20 06:18:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:53,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:18:53,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:53,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311329532] [2022-07-20 06:18:53,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311329532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:53,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103353323] [2022-07-20 06:18:53,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:53,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:53,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:53,673 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:53,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 06:18:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:54,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 06:18:54,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:54,162 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-20 06:18:54,222 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_4848 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4848)))) is different from true [2022-07-20 06:18:54,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:54,234 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 15 treesize of output 17 [2022-07-20 06:18:54,258 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-20 06:18:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-07-20 06:18:54,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:54,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4853 (Array Int Int)) (|v_node_create_~temp~0#1.base_66| Int)) (or (not (< |v_node_create_~temp~0#1.base_66| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_66| v_ArrVal_4853) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0)))) is different from false [2022-07-20 06:18:54,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103353323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:54,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:54,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-07-20 06:18:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251509609] [2022-07-20 06:18:54,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:54,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 06:18:54,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 06:18:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-07-20 06:18:54,308 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:54,655 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-07-20 06:18:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:18:54,657 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-07-20 06:18:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:54,658 INFO L225 Difference]: With dead ends: 113 [2022-07-20 06:18:54,658 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 06:18:54,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-07-20 06:18:54,659 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 180 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:54,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 446 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 404 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-07-20 06:18:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 06:18:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-20 06:18:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 106 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:18:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2022-07-20 06:18:54,663 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 59 [2022-07-20 06:18:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:54,663 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2022-07-20 06:18:54,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-07-20 06:18:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 06:18:54,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:54,664 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:54,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:54,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:54,875 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:18:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 141611607, now seen corresponding path program 1 times [2022-07-20 06:18:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:54,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202422949] [2022-07-20 06:18:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:18:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:18:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:18:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:18:55,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:55,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202422949] [2022-07-20 06:18:55,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202422949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:55,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116153274] [2022-07-20 06:18:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:55,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:55,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:55,288 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:55,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 06:18:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:55,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-20 06:18:55,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:55,773 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-20 06:18:57,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:57,476 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 17 treesize of output 12 [2022-07-20 06:18:57,602 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-20 06:18:57,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 35 [2022-07-20 06:18:57,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:57,609 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 15 treesize of output 17 [2022-07-20 06:18:57,614 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-20 06:18:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:57,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:57,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5127 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5127) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-07-20 06:18:57,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5127 (Array Int Int)) (v_ArrVal_5126 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_5126)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5127) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-07-20 06:19:03,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (v_ArrVal_5127 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (|v_node_create_~temp~0#1.base_69| Int) (v_ArrVal_5126 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_69| v_ArrVal_5132))) (let ((.cse0 (select .cse2 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (< |v_node_create_~temp~0#1.base_69| |c_#StackHeapBarrier|)) (not (= (select (select (store (store .cse2 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_5126)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22| v_ArrVal_5127) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (< |v_node_create_~temp~0#1.base_69| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_22|))))) is different from false [2022-07-20 06:19:03,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116153274] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:03,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:19:03,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 35 [2022-07-20 06:19:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116082501] [2022-07-20 06:19:03,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:19:03,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 06:19:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:19:03,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 06:19:03,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1280, Unknown=8, NotChecked=222, Total=1640 [2022-07-20 06:19:03,837 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 35 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 06:19:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:19:04,769 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2022-07-20 06:19:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:19:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2022-07-20 06:19:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:19:04,770 INFO L225 Difference]: With dead ends: 151 [2022-07-20 06:19:04,770 INFO L226 Difference]: Without dead ends: 151 [2022-07-20 06:19:04,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=306, Invalid=2778, Unknown=8, NotChecked=330, Total=3422 [2022-07-20 06:19:04,772 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 338 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:19:04,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 732 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 791 Invalid, 0 Unknown, 3 Unchecked, 0.4s Time] [2022-07-20 06:19:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-20 06:19:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2022-07-20 06:19:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 107 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:19:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2022-07-20 06:19:04,776 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 60 [2022-07-20 06:19:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:19:04,776 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2022-07-20 06:19:04,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 06:19:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-07-20 06:19:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 06:19:04,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:19:04,776 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:19:04,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:19:04,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 06:19:04,988 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:19:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:19:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 95034574, now seen corresponding path program 1 times [2022-07-20 06:19:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:19:04,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397796323] [2022-07-20 06:19:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:19:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:05,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:19:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:19:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:19:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:19:06,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:19:06,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397796323] [2022-07-20 06:19:06,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397796323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:06,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944803560] [2022-07-20 06:19:06,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:06,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:06,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:19:06,876 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:19:06,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 06:19:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:07,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-20 06:19:07,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:19:07,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:19:07,606 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:19:07,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:19:07,728 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 13 treesize of output 9 [2022-07-20 06:19:07,801 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:19:07,802 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 44 treesize of output 43 [2022-07-20 06:19:08,066 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-07-20 06:19:08,066 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 37 [2022-07-20 06:19:08,070 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 11 [2022-07-20 06:19:08,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:19:09,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:09,275 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:19:09,276 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 2 case distinctions, treesize of input 75 treesize of output 67 [2022-07-20 06:19:09,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:09,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2022-07-20 06:19:09,292 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-07-20 06:19:09,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:19:09,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-07-20 06:19:09,670 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-07-20 06:19:09,670 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 46 treesize of output 26 [2022-07-20 06:19:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:19:09,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:19:09,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_ArrVal_5420 (Array Int Int)) (v_ArrVal_5421 (Array Int Int))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_5421))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_5420) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:19:09,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944803560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:09,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:19:09,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 56 [2022-07-20 06:19:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368347866] [2022-07-20 06:19:09,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:19:09,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-20 06:19:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:19:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-20 06:19:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3252, Unknown=7, NotChecked=114, Total=3540 [2022-07-20 06:19:09,925 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:19:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:19:13,296 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-07-20 06:19:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:19:13,297 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2022-07-20 06:19:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:19:13,297 INFO L225 Difference]: With dead ends: 105 [2022-07-20 06:19:13,297 INFO L226 Difference]: Without dead ends: 105 [2022-07-20 06:19:13,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=385, Invalid=5618, Unknown=7, NotChecked=152, Total=6162 [2022-07-20 06:19:13,300 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 73 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:19:13,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1400 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1353 Invalid, 0 Unknown, 144 Unchecked, 0.8s Time] [2022-07-20 06:19:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-20 06:19:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-20 06:19:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 98 states have internal predecessors, (105), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:19:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2022-07-20 06:19:13,309 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 61 [2022-07-20 06:19:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:19:13,310 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2022-07-20 06:19:13,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:19:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2022-07-20 06:19:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 06:19:13,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:19:13,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:19:13,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-20 06:19:13,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:13,515 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:19:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:19:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash 592087770, now seen corresponding path program 1 times [2022-07-20 06:19:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:19:13,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966479176] [2022-07-20 06:19:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:19:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:19:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:19:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:13,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:19:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:19:14,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:19:14,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966479176] [2022-07-20 06:19:14,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966479176] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:14,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252249210] [2022-07-20 06:19:14,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:19:14,123 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:19:14,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 06:19:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:14,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-20 06:19:14,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:19:14,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:19:14,742 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 18 treesize of output 10 [2022-07-20 06:19:14,808 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5691 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5691))) (exists ((v_ArrVal_5692 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5692)))) is different from true [2022-07-20 06:19:14,823 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5691 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5691))) (exists ((v_ArrVal_5693 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5693) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 06:19:14,828 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5694 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5694) |c_#memory_$Pointer$.base|)) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5691 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5691)))) is different from true [2022-07-20 06:19:14,900 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-20 06:19:14,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-20 06:19:14,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:14,904 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 32 treesize of output 30 [2022-07-20 06:19:15,281 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-20 06:19:15,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2022-07-20 06:19:15,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:15,300 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 24 treesize of output 24 [2022-07-20 06:19:15,355 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-20 06:19:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-07-20 06:19:15,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:19:18,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5697 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| Int) (v_ArrVal_5705 (Array Int Int)) (v_ArrVal_5695 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5705))) (let ((.cse2 (select .cse1 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse3 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse0 (store |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| 1))) (or (= (select .cse0 (select (select (store (store .cse1 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_5695)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5697) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (= (select .cse2 .cse3) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| |c_#StackHeapBarrier|)) (not (= (select .cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) 1)))))) is different from false [2022-07-20 06:19:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252249210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:18,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:19:18,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2022-07-20 06:19:18,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51102470] [2022-07-20 06:19:18,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:19:18,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-20 06:19:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:19:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-20 06:19:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2825, Unknown=31, NotChecked=444, Total=3540 [2022-07-20 06:19:18,007 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:19:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:19:18,998 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-07-20 06:19:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:19:18,999 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2022-07-20 06:19:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:19:19,000 INFO L225 Difference]: With dead ends: 115 [2022-07-20 06:19:19,000 INFO L226 Difference]: Without dead ends: 115 [2022-07-20 06:19:19,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=450, Invalid=4504, Unknown=32, NotChecked=564, Total=5550 [2022-07-20 06:19:19,001 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 81 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:19:19,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 722 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 800 Invalid, 0 Unknown, 274 Unchecked, 0.4s Time] [2022-07-20 06:19:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-20 06:19:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2022-07-20 06:19:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.244186046511628) internal successors, (107), 99 states have internal predecessors, (107), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:19:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-07-20 06:19:19,005 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 63 [2022-07-20 06:19:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:19:19,005 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-07-20 06:19:19,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:19:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-07-20 06:19:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 06:19:19,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:19:19,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:19:19,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:19:19,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:19,211 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:19:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:19:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash 592087771, now seen corresponding path program 1 times [2022-07-20 06:19:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:19:19,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704142602] [2022-07-20 06:19:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:19:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:19:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:19:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:19,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:19:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:19:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:19:20,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704142602] [2022-07-20 06:19:20,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704142602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:20,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136780425] [2022-07-20 06:19:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:20,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:20,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:19:20,381 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:19:20,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 06:19:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:20,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 06:19:20,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:19:21,041 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-20 06:19:21,045 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 7 treesize of output 3 [2022-07-20 06:19:21,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:21,289 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 17 treesize of output 12 [2022-07-20 06:19:21,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:21,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, 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 11 [2022-07-20 06:19:21,755 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-20 06:19:21,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2022-07-20 06:19:21,772 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-20 06:19:21,772 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 36 treesize of output 31 [2022-07-20 06:19:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:21,825 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 30 treesize of output 30 [2022-07-20 06:19:21,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:21,831 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 29 treesize of output 29 [2022-07-20 06:19:21,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-20 06:19:21,907 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 26 treesize of output 14 [2022-07-20 06:19:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:19:22,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:19:22,140 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5984 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5984) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_5985 (Array Int Int)) (v_ArrVal_5984 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5984) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5985) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-20 06:19:22,151 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5984 (Array Int Int)) (v_ArrVal_5983 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_5983)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5984) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_5985 (Array Int Int)) (v_ArrVal_5984 (Array Int Int)) (v_ArrVal_5983 Int) (v_ArrVal_5981 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_5983)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5984) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_5981)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5985) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-20 06:19:22,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:22,484 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 71 treesize of output 75 [2022-07-20 06:19:26,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| Int) (v_ArrVal_5994 (Array Int Int)) (v_ArrVal_5995 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.base_35| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_32| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_5994) |v_ULTIMATE.start_dll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_32| 4)) 0)) (and (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (<= 0 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_5995))) (store .cse0 |v_ULTIMATE.start_dll_append_~last~0#1.base_35| (store (select .cse0 |v_ULTIMATE.start_dll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_32| 4) v_prenex_4))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_5984 (Array Int Int)) (v_ArrVal_5983 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_5995))) (<= (select (select (store (store .cse1 |v_ULTIMATE.start_dll_append_~last~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_dll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_32| 4) v_ArrVal_5983)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_5984) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (forall ((v_ArrVal_5985 (Array Int Int)) (v_ArrVal_5981 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_5994))) (= (select (select (store (store .cse2 |v_ULTIMATE.start_dll_append_~last~0#1.base_35| (store (select .cse2 |v_ULTIMATE.start_dll_append_~last~0#1.base_35|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_32| 4) v_ArrVal_5981)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| v_ArrVal_5985) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_44| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:19:26,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136780425] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:26,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:19:26,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 44 [2022-07-20 06:19:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521057419] [2022-07-20 06:19:26,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:19:26,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:19:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:19:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:19:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2655, Unknown=14, NotChecked=318, Total=3192 [2022-07-20 06:19:26,983 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 39 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:19:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:19:28,980 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-07-20 06:19:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:19:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 39 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2022-07-20 06:19:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:19:28,982 INFO L225 Difference]: With dead ends: 111 [2022-07-20 06:19:28,982 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 06:19:28,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=617, Invalid=4637, Unknown=14, NotChecked=432, Total=5700 [2022-07-20 06:19:28,983 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 535 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:19:28,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 657 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 06:19:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 06:19:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2022-07-20 06:19:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 101 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:19:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-07-20 06:19:28,986 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 63 [2022-07-20 06:19:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:19:28,986 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-07-20 06:19:28,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 39 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:19:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-07-20 06:19:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 06:19:28,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:19:28,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:19:29,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-20 06:19:29,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:29,202 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:19:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:19:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2060666116, now seen corresponding path program 1 times [2022-07-20 06:19:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:19:29,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576731217] [2022-07-20 06:19:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:19:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:29,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:19:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:30,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:19:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:19:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:19:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:19:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576731217] [2022-07-20 06:19:30,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576731217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791005510] [2022-07-20 06:19:30,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:30,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:30,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:19:30,700 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:19:30,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 06:19:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:31,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 147 conjunts are in the unsatisfiable core [2022-07-20 06:19:31,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:19:31,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:19:31,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:19:31,254 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:19:31,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:19:31,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:19:31,641 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-20 06:19:31,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-20 06:19:31,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:19:31,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:31,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-20 06:19:31,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 06:19:32,072 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:19:32,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-07-20 06:19:32,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:19:32,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:32,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2022-07-20 06:19:32,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-20 06:19:32,527 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 7 treesize of output 3 [2022-07-20 06:19:32,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:32,862 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-20 06:19:32,862 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 2 case distinctions, treesize of input 86 treesize of output 65 [2022-07-20 06:19:32,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:32,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-07-20 06:19:32,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:32,880 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:19:32,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 06:19:32,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:32,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-07-20 06:19:33,802 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:19:33,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 129 [2022-07-20 06:19:33,816 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-20 06:19:33,816 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 69 treesize of output 49 [2022-07-20 06:19:33,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:33,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 06:19:33,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:33,943 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:19:33,944 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 2 case distinctions, treesize of input 82 treesize of output 68 [2022-07-20 06:19:33,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:19:33,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:33,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:19:34,072 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:34,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-07-20 06:19:34,076 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-20 06:19:34,218 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-20 06:19:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:19:34,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:19:34,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6289 (Array Int Int)) (v_ArrVal_6288 (Array Int Int)) (v_ArrVal_6290 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6289) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6288) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-20 06:19:34,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6287 (Array Int Int)) (v_ArrVal_6286 (Array Int Int)) (v_ArrVal_6284 Int) (v_ArrVal_6289 (Array Int Int)) (v_ArrVal_6288 (Array Int Int)) (v_ArrVal_6290 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6287) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6289) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6286) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6288) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6284)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-20 06:19:34,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6287 (Array Int Int)) (v_ArrVal_6286 (Array Int Int)) (v_ArrVal_6284 Int) (v_ArrVal_6289 (Array Int Int)) (v_ArrVal_6288 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (v_ArrVal_6290 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6287) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6289) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6286) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6288) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) .cse0 v_ArrVal_6284)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) .cse0) 0))))) is different from false [2022-07-20 06:19:34,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6287 (Array Int Int)) (v_ArrVal_6286 (Array Int Int)) (v_ArrVal_6284 Int) (v_ArrVal_6289 (Array Int Int)) (v_ArrVal_6288 (Array Int Int)) (v_ArrVal_6290 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_35| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_35| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_6287) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6289) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6286) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6288) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_6284)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) 0))))) is different from false [2022-07-20 06:19:34,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6287 (Array Int Int)) (v_ArrVal_6286 (Array Int Int)) (v_ArrVal_6284 Int) (v_ArrVal_6289 (Array Int Int)) (v_ArrVal_6288 (Array Int Int)) (v_ArrVal_6290 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_35| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_35| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_6287) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6289) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6286) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6288) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_6284)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))))) is different from false [2022-07-20 06:19:34,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6287 (Array Int Int)) (v_ArrVal_6286 (Array Int Int)) (v_ArrVal_6284 Int) (v_ArrVal_6289 (Array Int Int)) (v_ArrVal_6288 (Array Int Int)) (v_ArrVal_6290 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_35| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_35| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_6287) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6289) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6286) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6288) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_6284)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) 0))))) is different from false [2022-07-20 06:19:34,883 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6287 (Array Int Int)) (v_ArrVal_6286 (Array Int Int)) (v_ArrVal_6284 Int) (v_ArrVal_6289 (Array Int Int)) (v_ArrVal_6288 (Array Int Int)) (v_ArrVal_6304 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| Int) (v_ArrVal_6303 (Array Int Int)) (v_ArrVal_6290 (Array Int Int)) (v_ArrVal_6305 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_35| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_6304)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_6303))) (let ((.cse1 (select (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_35| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47|) 0)) (not (= (select (select .cse0 .cse1) .cse2) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_6305) .cse1 v_ArrVal_6287) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_6289) (select (select (store (store .cse0 .cse1 v_ArrVal_6286) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_6288) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_6284)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_47| v_ArrVal_6290) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-20 06:19:34,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791005510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:34,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:19:34,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 67 [2022-07-20 06:19:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881942308] [2022-07-20 06:19:34,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:19:34,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-20 06:19:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:19:34,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-20 06:19:34,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4578, Unknown=7, NotChecked=994, Total=5852 [2022-07-20 06:19:34,887 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 67 states, 65 states have (on average 1.7230769230769232) internal successors, (112), 58 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:19:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:19:38,859 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2022-07-20 06:19:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 06:19:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.7230769230769232) internal successors, (112), 58 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2022-07-20 06:19:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:19:38,861 INFO L225 Difference]: With dead ends: 167 [2022-07-20 06:19:38,861 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 06:19:38,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2106 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=874, Invalid=8653, Unknown=7, NotChecked=1386, Total=10920 [2022-07-20 06:19:38,862 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 708 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:19:38,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 997 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 06:19:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 06:19:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2022-07-20 06:19:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 108 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:19:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-07-20 06:19:38,866 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 65 [2022-07-20 06:19:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:19:38,867 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-07-20 06:19:38,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.7230769230769232) internal successors, (112), 58 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:19:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-07-20 06:19:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 06:19:38,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:19:38,868 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:19:38,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-20 06:19:39,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:39,084 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:19:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:19:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458320, now seen corresponding path program 1 times [2022-07-20 06:19:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:19:39,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790182896] [2022-07-20 06:19:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:19:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:19:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:19:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:19:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:19:40,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:19:40,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790182896] [2022-07-20 06:19:40,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790182896] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:40,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728484568] [2022-07-20 06:19:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:40,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:40,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:19:40,805 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:19:40,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-20 06:19:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:41,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-20 06:19:41,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:19:41,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:19:41,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:19:41,391 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:19:41,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:19:41,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:19:41,734 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-20 06:19:41,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-20 06:19:41,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 06:19:42,069 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:19:42,070 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-20 06:19:42,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:42,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2022-07-20 06:19:42,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-20 06:19:42,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, 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-20 06:19:42,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:42,803 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 11 [2022-07-20 06:19:42,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:42,821 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-20 06:19:42,821 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 2 case distinctions, treesize of input 75 treesize of output 56 [2022-07-20 06:19:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:42,840 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:19:42,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 06:19:43,703 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:19:43,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 119 [2022-07-20 06:19:43,715 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-20 06:19:43,715 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 68 treesize of output 48 [2022-07-20 06:19:43,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:43,817 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:19:43,817 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 2 case distinctions, treesize of input 84 treesize of output 66 [2022-07-20 06:19:43,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:43,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:19:43,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:19:44,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:44,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 28 [2022-07-20 06:19:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:19:44,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:19:44,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6589 (Array Int Int)) (v_ArrVal_6590 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6589) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (select |c_#valid| (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6590))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4))) 1)))) is different from false [2022-07-20 06:19:44,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6587 (Array Int Int)) (v_ArrVal_6589 (Array Int Int)) (v_ArrVal_6588 Int) (v_ArrVal_6590 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6588)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6589) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (select |c_#valid| (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6587) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6590))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse0))) 1)))) is different from false [2022-07-20 06:19:44,491 INFO L356 Elim1Store]: treesize reduction 5, result has 89.4 percent of original size [2022-07-20 06:19:44,491 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 51 treesize of output 50 [2022-07-20 06:19:45,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728484568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:45,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:19:45,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-07-20 06:19:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447116630] [2022-07-20 06:19:45,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:19:45,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-20 06:19:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:19:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-20 06:19:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5721, Unknown=3, NotChecked=306, Total=6320 [2022-07-20 06:19:45,724 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:19:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:19:49,414 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2022-07-20 06:19:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-20 06:19:49,415 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2022-07-20 06:19:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:19:49,416 INFO L225 Difference]: With dead ends: 138 [2022-07-20 06:19:49,416 INFO L226 Difference]: Without dead ends: 138 [2022-07-20 06:19:49,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2124 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=779, Invalid=8928, Unknown=3, NotChecked=390, Total=10100 [2022-07-20 06:19:49,417 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 322 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:19:49,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1060 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2262 Invalid, 0 Unknown, 4 Unchecked, 1.4s Time] [2022-07-20 06:19:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-20 06:19:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2022-07-20 06:19:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:19:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-07-20 06:19:49,421 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 68 [2022-07-20 06:19:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:19:49,422 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-07-20 06:19:49,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:19:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-07-20 06:19:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 06:19:49,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:19:49,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:19:49,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-20 06:19:49,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-20 06:19:49,637 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:19:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:19:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458321, now seen corresponding path program 1 times [2022-07-20 06:19:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:19:49,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178057560] [2022-07-20 06:19:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:49,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:19:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:19:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:50,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:19:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:19:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:19:51,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:19:51,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178057560] [2022-07-20 06:19:51,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178057560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:51,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281331613] [2022-07-20 06:19:51,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:51,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:51,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:19:51,100 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:19:51,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-20 06:19:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:51,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 145 conjunts are in the unsatisfiable core [2022-07-20 06:19:51,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:19:51,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:19:51,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:19:51,689 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:19:51,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:19:51,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:19:52,091 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-20 06:19:52,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-20 06:19:52,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:19:52,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 06:19:52,483 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:19:52,484 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 70 [2022-07-20 06:19:52,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-07-20 06:19:52,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:52,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 48 [2022-07-20 06:19:52,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-20 06:19:52,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-20 06:19:53,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:53,391 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:19:53,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 85 [2022-07-20 06:19:53,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:53,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:53,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-07-20 06:19:53,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:53,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 06:19:53,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:53,419 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:19:53,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 06:19:54,477 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:19:54,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 183 treesize of output 130 [2022-07-20 06:19:54,501 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-07-20 06:19:54,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 62 [2022-07-20 06:19:54,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:54,621 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:19:54,621 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 2 case distinctions, treesize of input 105 treesize of output 83 [2022-07-20 06:19:54,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:54,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-07-20 06:19:55,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:19:55,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:55,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:55,106 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 3 case distinctions, treesize of input 113 treesize of output 57 [2022-07-20 06:19:55,112 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:19:55,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 25 [2022-07-20 06:19:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:19:55,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:19:55,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6889 (Array Int Int)) (v_ArrVal_6888 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6889))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6888))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse0 4))) (let ((.cse1 (select (select .cse5 .cse3) .cse4))) (and (<= (+ .cse1 4) (select |c_#length| (select (select .cse2 .cse3) .cse4))) (<= 0 .cse1))))))))) is different from false [2022-07-20 06:19:55,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6885 (Array Int Int)) (v_ArrVal_6889 (Array Int Int)) (v_ArrVal_6886 Int)) (or (not (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6886)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_6888 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6886)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6889)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6885) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6888))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 4) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_6888 (Array Int Int))) (<= 0 (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6886)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6889))) (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6885) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6888) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) is different from false [2022-07-20 06:19:58,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281331613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:58,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:19:58,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 72 [2022-07-20 06:19:58,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569788101] [2022-07-20 06:19:58,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:19:58,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-20 06:19:58,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:19:58,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-20 06:19:58,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=7159, Unknown=34, NotChecked=342, Total=7832 [2022-07-20 06:19:58,357 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 73 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 64 states have internal predecessors, (123), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:20:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:02,390 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-20 06:20:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 06:20:02,390 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 64 states have internal predecessors, (123), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2022-07-20 06:20:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:02,391 INFO L225 Difference]: With dead ends: 142 [2022-07-20 06:20:02,391 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 06:20:02,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=635, Invalid=11990, Unknown=39, NotChecked=446, Total=13110 [2022-07-20 06:20:02,392 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 171 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:02,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1461 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2152 Invalid, 0 Unknown, 271 Unchecked, 1.1s Time] [2022-07-20 06:20:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 06:20:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2022-07-20 06:20:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 111 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:20:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2022-07-20 06:20:02,396 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 68 [2022-07-20 06:20:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:02,397 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2022-07-20 06:20:02,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 64 states have internal predecessors, (123), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:20:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2022-07-20 06:20:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-20 06:20:02,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:02,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:02,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:02,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-20 06:20:02,612 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:02,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1488466325, now seen corresponding path program 1 times [2022-07-20 06:20:02,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:02,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078254633] [2022-07-20 06:20:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:02,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:20:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:03,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:20:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:20:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:20:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:04,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078254633] [2022-07-20 06:20:04,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078254633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:04,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10650330] [2022-07-20 06:20:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:04,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:04,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:04,569 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:04,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-20 06:20:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:04,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-20 06:20:04,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:04,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:05,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:05,192 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:20:05,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:20:05,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:20:05,592 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-20 06:20:05,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-20 06:20:05,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-20 06:20:05,910 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:20:05,910 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-07-20 06:20:06,290 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:20:06,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 34 [2022-07-20 06:20:06,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-20 06:20:06,298 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 7 treesize of output 3 [2022-07-20 06:20:06,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:06,712 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:20:06,713 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 2 case distinctions, treesize of input 85 treesize of output 67 [2022-07-20 06:20:06,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:06,728 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:20:06,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 06:20:06,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:06,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:20:07,673 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:20:07,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 112 [2022-07-20 06:20:07,692 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-20 06:20:07,693 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 49 treesize of output 33 [2022-07-20 06:20:07,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:07,804 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:20:07,804 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 2 case distinctions, treesize of input 83 treesize of output 65 [2022-07-20 06:20:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:07,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:20:07,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:20:08,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:20:08,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 27 [2022-07-20 06:20:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:20:08,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:08,312 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7187 (Array Int Int)) (v_ArrVal_7186 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7187) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7186))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse1)) 0)) (not (<= 0 .cse1))))) is different from false [2022-07-20 06:20:08,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7183 Int) (v_ArrVal_7185 (Array Int Int)) (v_ArrVal_7187 (Array Int Int)) (v_ArrVal_7186 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_7183)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7187) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_7185) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7186))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4)) 0))))) is different from false [2022-07-20 06:20:10,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10650330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:10,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:20:10,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 69 [2022-07-20 06:20:10,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521605322] [2022-07-20 06:20:10,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:10,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-20 06:20:10,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:20:10,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-20 06:20:10,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=5987, Unknown=33, NotChecked=314, Total=6642 [2022-07-20 06:20:10,152 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:20:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:16,008 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2022-07-20 06:20:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-20 06:20:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 69 [2022-07-20 06:20:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:16,009 INFO L225 Difference]: With dead ends: 119 [2022-07-20 06:20:16,009 INFO L226 Difference]: Without dead ends: 119 [2022-07-20 06:20:16,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=886, Invalid=10009, Unknown=33, NotChecked=414, Total=11342 [2022-07-20 06:20:16,010 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 362 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:16,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1014 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1995 Invalid, 0 Unknown, 104 Unchecked, 1.4s Time] [2022-07-20 06:20:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-20 06:20:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2022-07-20 06:20:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 110 states have internal predecessors, (118), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:20:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2022-07-20 06:20:16,015 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 69 [2022-07-20 06:20:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:16,016 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2022-07-20 06:20:16,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 60 states have internal predecessors, (121), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:20:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2022-07-20 06:20:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 06:20:16,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:16,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:16,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-20 06:20:16,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:16,223 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1102226234, now seen corresponding path program 1 times [2022-07-20 06:20:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:20:16,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141234739] [2022-07-20 06:20:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:20:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:17,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:20:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:20:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:17,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 06:20:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:20:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:20:18,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141234739] [2022-07-20 06:20:18,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141234739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:18,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069582435] [2022-07-20 06:20:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:18,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:18,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:18,092 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:20:18,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-20 06:20:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:18,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 187 conjunts are in the unsatisfiable core [2022-07-20 06:20:18,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:18,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:18,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:18,730 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:20:18,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:20:18,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:20:18,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:18,967 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-20 06:20:19,069 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 7 treesize of output 3 [2022-07-20 06:20:19,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:20:19,466 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:20:19,466 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 06:20:19,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:19,494 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-20 06:20:19,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-20 06:20:19,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:20:19,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:20:19,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-20 06:20:19,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:20:19,906 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:20:19,907 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2022-07-20 06:20:19,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:19,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-07-20 06:20:19,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 06:20:20,391 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:20:20,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 44 [2022-07-20 06:20:20,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-20 06:20:20,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:20:20,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:20,812 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:20:20,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 06:20:20,920 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 06:20:20,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:21,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:20:21,122 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 1728663 column 56: unknown constant v_old(#memory_int)_AFTER_CALL_66 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 06:20:21,126 INFO L158 Benchmark]: Toolchain (without parser) took 130226.73ms. Allocated memory was 98.6MB in the beginning and 318.8MB in the end (delta: 220.2MB). Free memory was 64.4MB in the beginning and 170.9MB in the end (delta: -106.5MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2022-07-20 06:20:21,126 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 73.4MB. Free memory was 32.9MB in the beginning and 32.9MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:20:21,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.51ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 66.9MB in the end (delta: -2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 06:20:21,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.26ms. Allocated memory is still 98.6MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:20:21,126 INFO L158 Benchmark]: Boogie Preprocessor took 44.24ms. Allocated memory is still 98.6MB. Free memory was 64.8MB in the beginning and 63.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:20:21,126 INFO L158 Benchmark]: RCFGBuilder took 527.38ms. Allocated memory is still 98.6MB. Free memory was 63.2MB in the beginning and 44.9MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-20 06:20:21,126 INFO L158 Benchmark]: TraceAbstraction took 129170.04ms. Allocated memory was 98.6MB in the beginning and 318.8MB in the end (delta: 220.2MB). Free memory was 44.3MB in the beginning and 170.9MB in the end (delta: -126.6MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2022-07-20 06:20:21,127 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 73.4MB. Free memory was 32.9MB in the beginning and 32.9MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.51ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 66.9MB in the end (delta: -2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.26ms. Allocated memory is still 98.6MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.24ms. Allocated memory is still 98.6MB. Free memory was 64.8MB in the beginning and 63.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.38ms. Allocated memory is still 98.6MB. Free memory was 63.2MB in the beginning and 44.9MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 129170.04ms. Allocated memory was 98.6MB in the beginning and 318.8MB in the end (delta: 220.2MB). Free memory was 44.3MB in the beginning and 170.9MB in the end (delta: -126.6MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 1728663 column 56: unknown constant v_old(#memory_int)_AFTER_CALL_66 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 1728663 column 56: unknown constant v_old(#memory_int)_AFTER_CALL_66: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 06:20:21,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:20:23,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:20:23,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:20:23,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:20:23,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:20:23,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:20:23,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:20:23,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:20:23,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:20:23,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:20:23,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:20:23,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:20:23,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:20:23,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:20:23,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:20:23,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:20:23,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:20:23,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:20:23,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:20:23,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:20:23,275 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:20:23,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:20:23,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:20:23,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:20:23,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:20:23,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:20:23,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:20:23,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:20:23,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:20:23,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:20:23,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:20:23,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:20:23,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:20:23,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:20:23,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:20:23,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:20:23,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:20:23,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:20:23,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:20:23,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:20:23,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:20:23,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:20:23,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:20:23,324 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:20:23,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:20:23,325 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:20:23,325 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:20:23,326 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:20:23,326 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:20:23,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:20:23,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:20:23,327 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:20:23,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:20:23,328 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:20:23,328 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:20:23,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:20:23,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:20:23,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:20:23,329 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:20:23,329 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:20:23,329 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:20:23,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:20:23,330 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:20:23,330 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:20:23,330 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:20:23,330 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:20:23,331 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:20:23,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:20:23,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:20:23,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:20:23,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:20:23,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:20:23,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:20:23,332 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:20:23,332 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:20:23,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:20:23,333 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-07-20 06:20:23,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:20:23,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:20:23,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:20:23,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:20:23,693 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:20:23,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-20 06:20:23,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2179d471/0b8a6a6db8e34a8498a66cf6ece918b5/FLAGf54e1ace0 [2022-07-20 06:20:24,269 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:20:24,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-07-20 06:20:24,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2179d471/0b8a6a6db8e34a8498a66cf6ece918b5/FLAGf54e1ace0 [2022-07-20 06:20:24,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2179d471/0b8a6a6db8e34a8498a66cf6ece918b5 [2022-07-20 06:20:24,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:20:24,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:20:24,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:20:24,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:20:24,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:20:24,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:20:24" (1/1) ... [2022-07-20 06:20:24,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43711fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:24, skipping insertion in model container [2022-07-20 06:20:24,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:20:24" (1/1) ... [2022-07-20 06:20:24,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:20:24,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:20:25,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-07-20 06:20:25,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:20:25,113 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:20:25,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-07-20 06:20:25,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:20:25,193 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:20:25,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25 WrapperNode [2022-07-20 06:20:25,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:20:25,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:20:25,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:20:25,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:20:25,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,249 INFO L137 Inliner]: procedures = 130, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 126 [2022-07-20 06:20:25,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:20:25,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:20:25,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:20:25,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:20:25,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:20:25,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:20:25,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:20:25,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:20:25,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (1/1) ... [2022-07-20 06:20:25,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:20:25,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:20:25,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:20:25,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:20:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 06:20:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-20 06:20:25,386 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-20 06:20:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:20:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:20:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:20:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:20:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:20:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:20:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 06:20:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 06:20:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:20:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:20:25,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:20:25,550 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:20:25,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:20:25,989 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:20:25,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:20:25,995 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-20 06:20:25,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:20:25 BoogieIcfgContainer [2022-07-20 06:20:25,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:20:25,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:20:25,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:20:26,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:20:26,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:20:24" (1/3) ... [2022-07-20 06:20:26,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496114c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:20:26, skipping insertion in model container [2022-07-20 06:20:26,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:20:25" (2/3) ... [2022-07-20 06:20:26,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496114c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:20:26, skipping insertion in model container [2022-07-20 06:20:26,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:20:25" (3/3) ... [2022-07-20 06:20:26,010 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-07-20 06:20:26,020 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:20:26,020 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-07-20 06:20:26,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:20:26,058 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@51b80cce, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79799ffc [2022-07-20 06:20:26,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-07-20 06:20:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:20:26,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:26,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:26,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348631, now seen corresponding path program 1 times [2022-07-20 06:20:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:26,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664532505] [2022-07-20 06:20:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:26,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:26,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:26,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:26,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 06:20:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:26,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:20:26,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:26,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:26,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:26,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664532505] [2022-07-20 06:20:26,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664532505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:26,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:26,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:20:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122367934] [2022-07-20 06:20:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:26,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:26,290 INFO L87 Difference]: Start difference. First operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:26,468 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-07-20 06:20:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:26,470 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:20:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:26,478 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:20:26,478 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:20:26,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:26,483 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:26,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:20:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:20:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-20 06:20:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.88) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-07-20 06:20:26,513 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 7 [2022-07-20 06:20:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:26,513 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-07-20 06:20:26,514 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-07-20 06:20:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:20:26,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:26,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:26,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 06:20:26,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:26,715 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348632, now seen corresponding path program 1 times [2022-07-20 06:20:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:26,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906420294] [2022-07-20 06:20:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:26,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:26,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:26,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:26,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 06:20:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:26,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:20:26,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:26,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:26,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:26,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:26,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906420294] [2022-07-20 06:20:26,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906420294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:26,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:26,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:20:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079827999] [2022-07-20 06:20:26,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:26,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:26,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:26,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:26,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:26,812 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:26,964 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-20 06:20:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:26,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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:20:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:26,967 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:20:26,967 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:20:26,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:26,969 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:26,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:20:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:20:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 06:20:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.82) internal successors, (91), 84 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-07-20 06:20:26,976 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 7 [2022-07-20 06:20:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:26,977 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-07-20 06:20:26,977 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:20:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-07-20 06:20:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:20:26,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:26,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:26,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:27,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:27,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash 927333361, now seen corresponding path program 1 times [2022-07-20 06:20:27,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:27,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647915167] [2022-07-20 06:20:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:27,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:27,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:27,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 06:20:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:27,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:20:27,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:27,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:27,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:27,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:27,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647915167] [2022-07-20 06:20:27,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647915167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:27,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:27,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:20:27,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113287939] [2022-07-20 06:20:27,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:27,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:20:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:27,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:20:27,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:20:27,369 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:20:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:27,740 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-07-20 06:20:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:20:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-20 06:20:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:27,744 INFO L225 Difference]: With dead ends: 91 [2022-07-20 06:20:27,744 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:20:27,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:27,745 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 16 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:27,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 299 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:20:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:20:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-07-20 06:20:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.78) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-07-20 06:20:27,753 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 14 [2022-07-20 06:20:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:27,753 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-07-20 06:20:27,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:20:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-07-20 06:20:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:20:27,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:27,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:27,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-20 06:20:27,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:27,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 927333360, now seen corresponding path program 1 times [2022-07-20 06:20:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:27,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445781641] [2022-07-20 06:20:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:27,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:27,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:27,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:27,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 06:20:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:28,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:20:28,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:28,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:28,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:28,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:28,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445781641] [2022-07-20 06:20:28,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445781641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:28,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:28,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:20:28,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545798069] [2022-07-20 06:20:28,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:28,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:20:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:20:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:20:28,115 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:20:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:28,407 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-07-20 06:20:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:20:28,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-20 06:20:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:28,409 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:20:28,409 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:20:28,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:28,410 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 14 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:28,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 283 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:20:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:20:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-07-20 06:20:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.74) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-20 06:20:28,416 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2022-07-20 06:20:28,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:28,416 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-20 06:20:28,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:20:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-20 06:20:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:20:28,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:28,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:28,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:28,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:28,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1763306156, now seen corresponding path program 1 times [2022-07-20 06:20:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:28,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889935374] [2022-07-20 06:20:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:28,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:28,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:28,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:28,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 06:20:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:28,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:20:28,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:28,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:28,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889935374] [2022-07-20 06:20:28,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889935374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:28,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:20:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644838392] [2022-07-20 06:20:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:28,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:28,729 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:20:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:28,739 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-07-20 06:20:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-20 06:20:28,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:28,742 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:20:28,742 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 06:20:28,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:28,744 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:28,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 177 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 06:20:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-20 06:20:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-07-20 06:20:28,763 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2022-07-20 06:20:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:28,763 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-07-20 06:20:28,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:20:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-07-20 06:20:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:20:28,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:28,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:28,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:28,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:28,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash 958467140, now seen corresponding path program 1 times [2022-07-20 06:20:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689630058] [2022-07-20 06:20:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:28,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:28,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:28,974 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:28,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 06:20:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:29,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:20:29,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:29,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:29,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:29,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689630058] [2022-07-20 06:20:29,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689630058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:29,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:29,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:20:29,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211988923] [2022-07-20 06:20:29,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:29,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:29,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:29,101 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:20:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:29,128 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-07-20 06:20:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:29,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-20 06:20:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:29,130 INFO L225 Difference]: With dead ends: 91 [2022-07-20 06:20:29,130 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 06:20:29,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:29,131 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:29,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 06:20:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-07-20 06:20:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-07-20 06:20:29,136 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 17 [2022-07-20 06:20:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:29,137 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-07-20 06:20:29,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:20:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-07-20 06:20:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:20:29,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:29,138 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:29,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:29,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:29,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash 239866037, now seen corresponding path program 1 times [2022-07-20 06:20:29,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:29,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644318831] [2022-07-20 06:20:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:29,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:29,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:29,350 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:29,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 06:20:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:29,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:20:29,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:29,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:20:29,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:29,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644318831] [2022-07-20 06:20:29,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644318831] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:29,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:20:29,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 06:20:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466104737] [2022-07-20 06:20:29,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:29,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:20:29,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:29,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:20:29,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:20:29,578 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:20:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:29,607 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-20 06:20:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:20:29,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-07-20 06:20:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:29,609 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:20:29,609 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:20:29,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:20:29,610 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 31 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:29,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 270 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:20:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:20:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2022-07-20 06:20:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-20 06:20:29,614 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 31 [2022-07-20 06:20:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:29,615 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-20 06:20:29,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:20:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-20 06:20:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:20:29,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:29,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:29,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:29,826 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-20 06:20:29,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704317, now seen corresponding path program 1 times [2022-07-20 06:20:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:29,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322374573] [2022-07-20 06:20:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:29,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:29,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:29,829 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-20 06:20:29,833 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-20 06:20:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:29,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:20:29,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:29,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:30,120 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:20:30,120 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-20 06:20:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:30,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:30,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:30,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322374573] [2022-07-20 06:20:30,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322374573] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:30,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:20:30,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2022-07-20 06:20:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109999064] [2022-07-20 06:20:30,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:30,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:20:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:20:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:20:30,335 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:20:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:30,753 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-07-20 06:20:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:20:30,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-07-20 06:20:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:30,755 INFO L225 Difference]: With dead ends: 99 [2022-07-20 06:20:30,755 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 06:20:30,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:20:30,756 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:30,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 380 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 132 Unchecked, 0.3s Time] [2022-07-20 06:20:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 06:20:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-20 06:20:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.5625) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-07-20 06:20:30,767 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 32 [2022-07-20 06:20:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:30,767 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-07-20 06:20:30,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:20:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-07-20 06:20:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:20:30,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:30,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:30,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:30,975 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-20 06:20:30,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704316, now seen corresponding path program 1 times [2022-07-20 06:20:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:30,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694577717] [2022-07-20 06:20:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:30,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:30,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:30,978 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:30,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 06:20:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:31,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:20:31,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:31,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:31,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:33,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:33,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:20:33,417 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:20:33,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:20:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:33,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:38,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:38,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694577717] [2022-07-20 06:20:38,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694577717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:38,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1935903447] [2022-07-20 06:20:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:38,085 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:20:38,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:20:38,089 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:20:38,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-20 06:20:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:38,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:20:38,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:38,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:38,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:38,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:38,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:20:38,580 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:20:38,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:20:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:38,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:40,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1935903447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:40,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:20:40,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-20 06:20:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262351414] [2022-07-20 06:20:40,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:40,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:20:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:20:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=104, Unknown=3, NotChecked=0, Total=132 [2022-07-20 06:20:40,901 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:41,675 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-07-20 06:20:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:20:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-20 06:20:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:41,677 INFO L225 Difference]: With dead ends: 99 [2022-07-20 06:20:41,677 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 06:20:41,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=51, Invalid=218, Unknown=3, NotChecked=0, Total=272 [2022-07-20 06:20:41,678 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 12 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:41,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 349 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 54 Unchecked, 0.6s Time] [2022-07-20 06:20:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 06:20:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-07-20 06:20:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.546875) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-07-20 06:20:41,682 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 32 [2022-07-20 06:20:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:41,683 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-07-20 06:20:41,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-07-20 06:20:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:20:41,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:41,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:41,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-07-20 06:20:41,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-20 06:20:42,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:42,089 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1122646220, now seen corresponding path program 2 times [2022-07-20 06:20:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:42,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424443177] [2022-07-20 06:20:42,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:20:42,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:42,092 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:42,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 06:20:42,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:20:42,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:20:42,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:20:42,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:20:42,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:20:42,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:42,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424443177] [2022-07-20 06:20:42,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424443177] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:20:42,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:20:42,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-20 06:20:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788278214] [2022-07-20 06:20:42,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:42,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:20:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:42,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:20:42,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:42,416 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:20:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:42,653 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-20 06:20:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:20:42,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-07-20 06:20:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:42,655 INFO L225 Difference]: With dead ends: 98 [2022-07-20 06:20:42,655 INFO L226 Difference]: Without dead ends: 98 [2022-07-20 06:20:42,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:20:42,655 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 144 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:42,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 327 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:20:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-20 06:20:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-20 06:20:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.53125) internal successors, (98), 92 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-07-20 06:20:42,660 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 46 [2022-07-20 06:20:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:42,660 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-07-20 06:20:42,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:20:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-07-20 06:20:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:20:42,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:42,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:42,675 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-20 06:20:42,872 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-20 06:20:42,873 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash 186649324, now seen corresponding path program 1 times [2022-07-20 06:20:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:42,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271458485] [2022-07-20 06:20:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:42,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:42,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:42,875 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-20 06:20:42,877 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-20 06:20:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:43,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 06:20:43,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:43,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:43,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:43,279 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:20:43,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 06:20:43,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:43,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:43,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:20:43,676 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:20:43,676 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-20 06:20:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:20:43,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:44,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:44,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271458485] [2022-07-20 06:20:44,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271458485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:44,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [386166862] [2022-07-20 06:20:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:44,049 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:20:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:20:44,056 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:20:44,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-07-20 06:20:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:44,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 06:20:44,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:44,466 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:20:44,466 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-20 06:20:44,513 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:20:44,513 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 9 [2022-07-20 06:20:44,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:44,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:44,621 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:20:44,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 31 [2022-07-20 06:20:44,774 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:20:44,775 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 22 treesize of output 18 [2022-07-20 06:20:44,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:44,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:44,943 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:20:44,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-07-20 06:20:45,208 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:20:45,209 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 22 treesize of output 18 [2022-07-20 06:20:45,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:45,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:45,354 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:20:45,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-07-20 06:20:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 06:20:45,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:45,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [386166862] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:45,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:20:45,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2022-07-20 06:20:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29738206] [2022-07-20 06:20:45,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:20:45,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:20:45,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:20:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-07-20 06:20:45,594 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:20:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:48,265 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-20 06:20:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:20:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2022-07-20 06:20:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:48,267 INFO L225 Difference]: With dead ends: 100 [2022-07-20 06:20:48,267 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 06:20:48,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-07-20 06:20:48,268 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:48,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 545 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 191 Unchecked, 0.5s Time] [2022-07-20 06:20:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 06:20:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-07-20 06:20:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.515625) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2022-07-20 06:20:48,271 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 47 [2022-07-20 06:20:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:48,271 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2022-07-20 06:20:48,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 06:20:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2022-07-20 06:20:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:20:48,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:48,273 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:48,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2022-07-20 06:20:48,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-20 06:20:48,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:48,679 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash 186649325, now seen corresponding path program 1 times [2022-07-20 06:20:48,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:48,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965927540] [2022-07-20 06:20:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:48,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:48,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:48,682 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:48,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 06:20:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:48,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 06:20:48,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:48,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:48,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:49,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:49,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:51,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:51,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:20:51,212 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:20:51,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:20:51,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:53,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:53,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:20:53,733 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:20:53,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 06:20:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:20:53,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:20:54,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:54,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965927540] [2022-07-20 06:20:54,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965927540] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:20:54,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [373117593] [2022-07-20 06:20:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:20:54,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:20:54,136 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:20:54,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-07-20 06:20:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:54,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 06:20:54,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:54,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:54,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:54,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:54,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:20:54,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:56,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:56,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:20:57,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:20:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:20:57,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:20:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 06:20:57,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:57,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [373117593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:57,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:20:57,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-07-20 06:20:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615301144] [2022-07-20 06:20:57,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:57,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:20:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:57,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:20:57,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2022-07-20 06:20:57,252 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:57,738 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-07-20 06:20:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:20:57,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-07-20 06:20:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:57,739 INFO L225 Difference]: With dead ends: 97 [2022-07-20 06:20:57,739 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 06:20:57,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2022-07-20 06:20:57,740 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 10 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:57,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 345 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 73 Unchecked, 0.4s Time] [2022-07-20 06:20:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 06:20:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-07-20 06:20:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.5) internal successors, (96), 90 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-07-20 06:20:57,750 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 47 [2022-07-20 06:20:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:57,750 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-07-20 06:20:57,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-07-20 06:20:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:20:57,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:57,753 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:57,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:57,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:58,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:58,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1018625491, now seen corresponding path program 1 times [2022-07-20 06:20:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:58,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350706399] [2022-07-20 06:20:58,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:58,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:58,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:58,156 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:58,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 06:20:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:58,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:20:58,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 06:20:58,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:58,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:58,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350706399] [2022-07-20 06:20:58,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350706399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:58,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:58,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:20:58,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464077590] [2022-07-20 06:20:58,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:58,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:20:58,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:58,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:20:58,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:58,339 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:20:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:58,440 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-07-20 06:20:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:20:58,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-20 06:20:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:58,441 INFO L225 Difference]: With dead ends: 106 [2022-07-20 06:20:58,441 INFO L226 Difference]: Without dead ends: 106 [2022-07-20 06:20:58,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:20:58,442 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 55 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:58,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 83 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:20:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-20 06:20:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2022-07-20 06:20:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.46875) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-07-20 06:20:58,445 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 49 [2022-07-20 06:20:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:58,445 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-07-20 06:20:58,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:20:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-07-20 06:20:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:20:58,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:58,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:58,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-20 06:20:58,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:58,655 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1018625490, now seen corresponding path program 1 times [2022-07-20 06:20:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:58,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704957189] [2022-07-20 06:20:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:58,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:58,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:58,657 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:58,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 06:20:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:58,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:20:58,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 06:20:58,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:20:58,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:20:58,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704957189] [2022-07-20 06:20:58,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704957189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:20:58,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:20:58,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:20:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550580815] [2022-07-20 06:20:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:20:58,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:20:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:20:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:20:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:20:58,878 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:20:58,964 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2022-07-20 06:20:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:20:58,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-07-20 06:20:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:20:58,965 INFO L225 Difference]: With dead ends: 92 [2022-07-20 06:20:58,965 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 06:20:58,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:20:58,966 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 172 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:20:58,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 95 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:20:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 06:20:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-20 06:20:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.4375) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:20:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-07-20 06:20:58,969 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 49 [2022-07-20 06:20:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:20:58,970 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-07-20 06:20:58,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:20:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-07-20 06:20:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:20:58,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:20:58,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:20:58,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:20:59,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:20:59,182 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:20:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:20:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash 353447346, now seen corresponding path program 1 times [2022-07-20 06:20:59,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:20:59,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638872640] [2022-07-20 06:20:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:20:59,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:20:59,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:20:59,184 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:20:59,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 06:20:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:20:59,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 06:20:59,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:20:59,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:20:59,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 6 treesize of output 5 [2022-07-20 06:20:59,832 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 11 treesize of output 7 [2022-07-20 06:21:00,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:00,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:21:00,164 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:21:00,164 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 23 treesize of output 34 [2022-07-20 06:21:00,250 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 27 treesize of output 15 [2022-07-20 06:21:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:21:00,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:00,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:00,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638872640] [2022-07-20 06:21:00,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638872640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:00,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28864517] [2022-07-20 06:21:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:00,496 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:21:00,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:21:00,503 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:21:00,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-20 06:21:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:00,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 06:21:00,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:01,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:01,381 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 11 treesize of output 7 [2022-07-20 06:21:01,609 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:21:01,609 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 23 treesize of output 34 [2022-07-20 06:21:01,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:01,619 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 27 treesize of output 27 [2022-07-20 06:21:01,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-20 06:21:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:21:01,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:01,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [28864517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:01,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:21:01,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-07-20 06:21:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034585563] [2022-07-20 06:21:01,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:01,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 06:21:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:01,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 06:21:01,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=602, Unknown=5, NotChecked=0, Total=702 [2022-07-20 06:21:01,984 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:21:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:03,060 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-07-20 06:21:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:21:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-20 06:21:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:03,061 INFO L225 Difference]: With dead ends: 125 [2022-07-20 06:21:03,061 INFO L226 Difference]: Without dead ends: 125 [2022-07-20 06:21:03,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=155, Invalid=958, Unknown=9, NotChecked=0, Total=1122 [2022-07-20 06:21:03,062 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 65 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:03,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 796 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 530 Invalid, 0 Unknown, 170 Unchecked, 0.8s Time] [2022-07-20 06:21:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-20 06:21:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2022-07-20 06:21:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-07-20 06:21:03,066 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 51 [2022-07-20 06:21:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:03,066 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-07-20 06:21:03,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:21:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-07-20 06:21:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:21:03,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:03,067 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:03,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:03,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-20 06:21:03,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:03,472 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash 353447347, now seen corresponding path program 1 times [2022-07-20 06:21:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:03,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220923781] [2022-07-20 06:21:03,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:03,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:03,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:03,474 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:03,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 06:21:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:03,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-20 06:21:03,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:03,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:03,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:04,028 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 6 treesize of output 5 [2022-07-20 06:21:04,032 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 6 treesize of output 5 [2022-07-20 06:21:04,193 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 21 treesize of output 13 [2022-07-20 06:21:04,199 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 7 treesize of output 3 [2022-07-20 06:21:04,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:04,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:21:04,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:04,567 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 27 treesize of output 27 [2022-07-20 06:21:04,589 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 06:21:04,589 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 17 treesize of output 17 [2022-07-20 06:21:04,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:04,605 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 14 treesize of output 16 [2022-07-20 06:21:04,775 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-20 06:21:04,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:21:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:21:04,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:05,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:05,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220923781] [2022-07-20 06:21:05,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220923781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:05,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815293901] [2022-07-20 06:21:05,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:05,599 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:21:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:21:05,604 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:21:05,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-07-20 06:21:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:06,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 06:21:06,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:06,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:06,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:06,710 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 21 treesize of output 13 [2022-07-20 06:21:06,717 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 7 treesize of output 3 [2022-07-20 06:21:06,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:07,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:21:07,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:07,016 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 27 treesize of output 27 [2022-07-20 06:21:07,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:07,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:21:07,055 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 06:21:07,055 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 17 treesize of output 17 [2022-07-20 06:21:07,224 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-20 06:21:07,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:21:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:21:07,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:07,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [815293901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:07,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:21:07,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-07-20 06:21:07,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961032193] [2022-07-20 06:21:07,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:07,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 06:21:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:07,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 06:21:07,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=747, Unknown=18, NotChecked=0, Total=870 [2022-07-20 06:21:07,676 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:21:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:08,828 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2022-07-20 06:21:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:21:08,829 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-20 06:21:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:08,831 INFO L225 Difference]: With dead ends: 133 [2022-07-20 06:21:08,831 INFO L226 Difference]: Without dead ends: 133 [2022-07-20 06:21:08,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=166, Invalid=1144, Unknown=22, NotChecked=0, Total=1332 [2022-07-20 06:21:08,833 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 72 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:08,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 689 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 0 Unknown, 106 Unchecked, 0.6s Time] [2022-07-20 06:21:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-20 06:21:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2022-07-20 06:21:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-20 06:21:08,836 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 51 [2022-07-20 06:21:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:08,837 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-20 06:21:08,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:21:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-20 06:21:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:21:08,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:08,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:08,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:09,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:09,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:09,243 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash 353294446, now seen corresponding path program 1 times [2022-07-20 06:21:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:09,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837862364] [2022-07-20 06:21:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:09,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:09,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:09,245 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:09,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 06:21:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:09,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:21:09,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 06:21:09,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:09,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:09,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837862364] [2022-07-20 06:21:09,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837862364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:09,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:09,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:21:09,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850812505] [2022-07-20 06:21:09,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:09,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:21:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:21:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:21:09,453 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:09,572 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2022-07-20 06:21:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:21:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-20 06:21:09,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:09,573 INFO L225 Difference]: With dead ends: 104 [2022-07-20 06:21:09,573 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 06:21:09,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-20 06:21:09,573 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 111 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:09,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 101 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:21:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 06:21:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-07-20 06:21:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2022-07-20 06:21:09,576 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 51 [2022-07-20 06:21:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:09,576 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2022-07-20 06:21:09,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-07-20 06:21:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:21:09,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:09,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:09,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:09,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:09,783 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash 353294447, now seen corresponding path program 1 times [2022-07-20 06:21:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:09,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374729052] [2022-07-20 06:21:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:09,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:09,786 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:09,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 06:21:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:10,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:21:10,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 06:21:10,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:10,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:10,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374729052] [2022-07-20 06:21:10,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374729052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:10,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:10,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:21:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56087983] [2022-07-20 06:21:10,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:10,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:21:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:10,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:21:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:21:10,125 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:10,287 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-20 06:21:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:21:10,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-20 06:21:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:10,288 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:21:10,288 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:21:10,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:21:10,289 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 149 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:10,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 86 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:21:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:21:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-20 06:21:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.338235294117647) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-07-20 06:21:10,292 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2022-07-20 06:21:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:10,292 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-07-20 06:21:10,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-07-20 06:21:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:21:10,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:10,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:10,304 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-20 06:21:10,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:10,493 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:10,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:10,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893007, now seen corresponding path program 1 times [2022-07-20 06:21:10,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:10,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771085079] [2022-07-20 06:21:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:10,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:10,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:10,495 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:10,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 06:21:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:10,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:21:10,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:10,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:21:10,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:10,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771085079] [2022-07-20 06:21:10,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771085079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:10,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:10,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:21:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222351446] [2022-07-20 06:21:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:10,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:21:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:21:10,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:21:10,801 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:21:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:11,101 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-07-20 06:21:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:21:11,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-20 06:21:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:11,102 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:21:11,102 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:21:11,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:21:11,103 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:11,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 188 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:21:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:21:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2022-07-20 06:21:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-07-20 06:21:11,106 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 54 [2022-07-20 06:21:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:11,106 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-07-20 06:21:11,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:21:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-07-20 06:21:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:21:11,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:11,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:11,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:11,332 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-20 06:21:11,333 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893006, now seen corresponding path program 1 times [2022-07-20 06:21:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:11,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774831293] [2022-07-20 06:21:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:11,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:11,335 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-20 06:21:11,336 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-20 06:21:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:11,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:21:11,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:11,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:21:11,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:11,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:11,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774831293] [2022-07-20 06:21:11,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774831293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:11,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:11,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:21:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802990752] [2022-07-20 06:21:11,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:11,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:21:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:21:11,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:21:11,647 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:21:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:11,944 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-20 06:21:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:21:11,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-20 06:21:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:11,946 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:21:11,946 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:21:11,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:21:11,947 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 45 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:11,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:21:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:21:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 06:21:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 82 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-07-20 06:21:11,950 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 54 [2022-07-20 06:21:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:11,950 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-07-20 06:21:11,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:21:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-07-20 06:21:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:21:11,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:11,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:11,962 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-20 06:21:12,155 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-20 06:21:12,155 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:12,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948792, now seen corresponding path program 1 times [2022-07-20 06:21:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:12,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443220817] [2022-07-20 06:21:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:12,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:12,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:12,157 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:12,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-20 06:21:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:12,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:21:12,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:12,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:12,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:21:12,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 06:21:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:21:12,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:12,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:12,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443220817] [2022-07-20 06:21:12,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443220817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:12,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:12,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:21:12,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476705252] [2022-07-20 06:21:12,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:12,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:21:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:21:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:21:12,552 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:13,156 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-07-20 06:21:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:21:13,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-20 06:21:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:13,158 INFO L225 Difference]: With dead ends: 149 [2022-07-20 06:21:13,158 INFO L226 Difference]: Without dead ends: 149 [2022-07-20 06:21:13,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:21:13,158 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 162 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:13,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 306 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:21:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-20 06:21:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 92. [2022-07-20 06:21:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-20 06:21:13,162 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 54 [2022-07-20 06:21:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:13,163 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-20 06:21:13,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-20 06:21:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 06:21:13,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:13,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:13,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:13,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:13,371 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948791, now seen corresponding path program 1 times [2022-07-20 06:21:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:13,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748018479] [2022-07-20 06:21:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:13,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:13,373 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:13,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-20 06:21:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:13,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:21:13,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:13,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-20 06:21:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:21:13,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:21:13,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:21:13,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 06:21:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:21:13,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:13,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:13,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748018479] [2022-07-20 06:21:13,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748018479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:13,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:13,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:21:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061412116] [2022-07-20 06:21:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:13,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:21:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:13,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:21:13,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:21:13,844 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:14,483 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2022-07-20 06:21:14,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:21:14,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-20 06:21:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:14,485 INFO L225 Difference]: With dead ends: 139 [2022-07-20 06:21:14,485 INFO L226 Difference]: Without dead ends: 139 [2022-07-20 06:21:14,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:21:14,486 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 150 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:14,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 320 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:21:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-20 06:21:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 94. [2022-07-20 06:21:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 88 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-07-20 06:21:14,489 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 54 [2022-07-20 06:21:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:14,489 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-07-20 06:21:14,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-07-20 06:21:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:21:14,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:14,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:14,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:14,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:14,702 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1467023000, now seen corresponding path program 1 times [2022-07-20 06:21:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:14,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64792138] [2022-07-20 06:21:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:14,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:14,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:14,704 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:14,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-20 06:21:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:15,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-20 06:21:15,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:15,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:15,318 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:21:15,319 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 19 treesize of output 26 [2022-07-20 06:21:15,439 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 13 treesize of output 9 [2022-07-20 06:21:15,534 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:21:15,534 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 60 treesize of output 57 [2022-07-20 06:21:15,539 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 12 treesize of output 11 [2022-07-20 06:21:15,820 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:21:15,820 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 42 treesize of output 30 [2022-07-20 06:21:15,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 06:21:15,841 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 7 treesize of output 3 [2022-07-20 06:21:16,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:16,227 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:21:16,227 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 2 case distinctions, treesize of input 48 treesize of output 46 [2022-07-20 06:21:16,278 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-20 06:21:16,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 66 [2022-07-20 06:21:16,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:16,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:21:16,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 15 treesize of output 7 [2022-07-20 06:21:16,885 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:21:16,886 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 75 treesize of output 43 [2022-07-20 06:21:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:21:18,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:18,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64792138] [2022-07-20 06:21:18,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64792138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1668252855] [2022-07-20 06:21:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:21:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:21:18,494 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:21:18,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-20 06:21:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:18,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-20 06:21:18,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:19,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:19,426 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:21:19,426 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 19 treesize of output 26 [2022-07-20 06:21:19,709 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 13 treesize of output 9 [2022-07-20 06:21:19,875 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:21:19,875 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 48 treesize of output 47 [2022-07-20 06:21:20,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:20,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 21 [2022-07-20 06:21:20,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 7 treesize of output 3 [2022-07-20 06:21:21,000 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-20 06:21:21,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 66 [2022-07-20 06:21:21,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:21,041 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:21:21,041 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 2 case distinctions, treesize of input 70 treesize of output 60 [2022-07-20 06:21:21,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:21,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:21:21,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:21:21,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:21,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 34 [2022-07-20 06:21:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:21:22,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:22,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1668252855] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:22,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:21:22,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2022-07-20 06:21:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58679790] [2022-07-20 06:21:22,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:22,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-20 06:21:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-20 06:21:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2605, Unknown=15, NotChecked=0, Total=2862 [2022-07-20 06:21:22,845 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 47 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:21:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:24,671 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2022-07-20 06:21:24,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:21:24,672 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-07-20 06:21:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:24,672 INFO L225 Difference]: With dead ends: 97 [2022-07-20 06:21:24,673 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 06:21:24,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=348, Invalid=3664, Unknown=20, NotChecked=0, Total=4032 [2022-07-20 06:21:24,674 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 36 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:24,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 852 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 487 Invalid, 0 Unknown, 287 Unchecked, 0.8s Time] [2022-07-20 06:21:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 06:21:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-07-20 06:21:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-07-20 06:21:24,677 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 55 [2022-07-20 06:21:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:24,678 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-07-20 06:21:24,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:21:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-07-20 06:21:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:21:24,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:24,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:24,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:24,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:25,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:25,084 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1467022999, now seen corresponding path program 1 times [2022-07-20 06:21:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:25,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200803272] [2022-07-20 06:21:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:25,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:25,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:25,089 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:25,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-20 06:21:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:25,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-20 06:21:25,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:25,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:25,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:25,867 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:21:25,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 06:21:25,898 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:21:25,899 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 19 treesize of output 26 [2022-07-20 06:21:26,068 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 13 treesize of output 9 [2022-07-20 06:21:26,076 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 13 treesize of output 9 [2022-07-20 06:21:26,184 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:21:26,184 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 60 treesize of output 57 [2022-07-20 06:21:26,189 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 22 treesize of output 24 [2022-07-20 06:21:26,526 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-20 06:21:26,526 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 45 [2022-07-20 06:21:26,540 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:21:26,540 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:21:26,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-20 06:21:26,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-20 06:21:26,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:26,995 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:21:26,996 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 2 case distinctions, treesize of input 75 treesize of output 65 [2022-07-20 06:21:27,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:27,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:27,012 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:21:27,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-20 06:21:27,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:27,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:21:27,053 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:21:27,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:21:27,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:21:27,540 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-20 06:21:27,541 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 95 treesize of output 56 [2022-07-20 06:21:27,569 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-20 06:21:27,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-20 06:21:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:21:27,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:28,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:28,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200803272] [2022-07-20 06:21:28,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200803272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:28,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1128443263] [2022-07-20 06:21:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:28,942 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:21:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:21:28,943 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:21:28,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-07-20 06:21:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:29,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-20 06:21:29,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:29,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:29,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:30,220 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:21:30,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 06:21:30,250 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:21:30,251 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 19 treesize of output 26 [2022-07-20 06:21:30,600 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 13 treesize of output 9 [2022-07-20 06:21:30,614 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 13 treesize of output 9 [2022-07-20 06:21:30,835 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:21:30,835 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 60 treesize of output 57 [2022-07-20 06:21:30,841 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 22 treesize of output 24 [2022-07-20 06:21:31,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:31,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-20 06:21:31,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:31,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:21:31,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:31,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:21:31,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:31,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:31,838 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 06:21:31,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-20 06:21:31,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:31,862 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 06:21:31,862 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 2 case distinctions, treesize of input 75 treesize of output 65 [2022-07-20 06:21:31,892 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:21:31,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:21:32,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:32,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:21:32,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:32,864 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 3 case distinctions, treesize of input 95 treesize of output 47 [2022-07-20 06:21:32,882 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-20 06:21:32,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-20 06:21:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:21:32,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:33,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1128443263] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:33,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:21:33,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2022-07-20 06:21:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320720589] [2022-07-20 06:21:33,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:33,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 06:21:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:33,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 06:21:33,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2054, Unknown=14, NotChecked=0, Total=2256 [2022-07-20 06:21:33,415 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 42 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 35 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:21:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:36,486 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2022-07-20 06:21:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:21:36,487 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 35 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-07-20 06:21:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:36,487 INFO L225 Difference]: With dead ends: 132 [2022-07-20 06:21:36,487 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 06:21:36,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=316, Invalid=3088, Unknown=18, NotChecked=0, Total=3422 [2022-07-20 06:21:36,488 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 92 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:36,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1262 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 815 Invalid, 0 Unknown, 354 Unchecked, 1.4s Time] [2022-07-20 06:21:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 06:21:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2022-07-20 06:21:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 92 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2022-07-20 06:21:36,492 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 55 [2022-07-20 06:21:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:36,492 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2022-07-20 06:21:36,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 35 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:21:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2022-07-20 06:21:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:21:36,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:36,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:36,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:36,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:36,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:21:36,896 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:36,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:36,896 INFO L85 PathProgramCache]: Analyzing trace with hash -938871693, now seen corresponding path program 1 times [2022-07-20 06:21:36,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:36,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629379200] [2022-07-20 06:21:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:36,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:36,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:36,898 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:36,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-20 06:21:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:37,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:21:37,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:37,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:21:37,266 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-20 06:21:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:21:37,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:37,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:37,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629379200] [2022-07-20 06:21:37,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629379200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:37,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:37,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:21:37,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005223334] [2022-07-20 06:21:37,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:37,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:21:37,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:37,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:21:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:21:37,290 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:37,663 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-20 06:21:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:21:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-07-20 06:21:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:37,664 INFO L225 Difference]: With dead ends: 126 [2022-07-20 06:21:37,664 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 06:21:37,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:21:37,665 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 99 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:37,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 495 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:21:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 06:21:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2022-07-20 06:21:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-07-20 06:21:37,669 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 55 [2022-07-20 06:21:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:37,669 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-07-20 06:21:37,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:21:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-07-20 06:21:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 06:21:37,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:37,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:37,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-20 06:21:37,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:37,875 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash 959790642, now seen corresponding path program 1 times [2022-07-20 06:21:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:37,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35099206] [2022-07-20 06:21:37,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:37,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:37,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:37,877 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:37,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-20 06:21:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:38,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 06:21:38,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:38,430 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 6 treesize of output 5 [2022-07-20 06:21:38,520 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-20 06:21:38,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:38,751 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 15 treesize of output 17 [2022-07-20 06:21:38,810 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-20 06:21:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:21:38,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:38,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:38,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35099206] [2022-07-20 06:21:38,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35099206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:38,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1627718231] [2022-07-20 06:21:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:38,938 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:21:38,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:21:38,940 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:21:38,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-07-20 06:21:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:39,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 06:21:39,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:39,868 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-20 06:21:40,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:40,220 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 15 treesize of output 17 [2022-07-20 06:21:40,304 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-20 06:21:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:21:40,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:40,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1627718231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:40,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:21:40,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-07-20 06:21:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522425146] [2022-07-20 06:21:40,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:40,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 06:21:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 06:21:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=998, Unknown=35, NotChecked=0, Total=1190 [2022-07-20 06:21:40,418 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 32 states, 30 states have (on average 2.966666666666667) internal successors, (89), 28 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:21:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:41,293 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-07-20 06:21:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:21:41,294 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.966666666666667) internal successors, (89), 28 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-07-20 06:21:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:41,295 INFO L225 Difference]: With dead ends: 102 [2022-07-20 06:21:41,295 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 06:21:41,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=260, Invalid=1583, Unknown=49, NotChecked=0, Total=1892 [2022-07-20 06:21:41,296 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 61 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:41,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 671 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 126 Unchecked, 0.5s Time] [2022-07-20 06:21:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 06:21:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-07-20 06:21:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:21:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-07-20 06:21:41,299 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 56 [2022-07-20 06:21:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:41,299 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-07-20 06:21:41,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.966666666666667) internal successors, (89), 28 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:21:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-07-20 06:21:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:21:41,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:41,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:41,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-20 06:21:41,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:21:41,708 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash -588248546, now seen corresponding path program 2 times [2022-07-20 06:21:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:41,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468463565] [2022-07-20 06:21:41,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:21:41,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:41,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:41,710 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:41,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-20 06:21:42,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:21:42,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:21:42,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-20 06:21:42,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:42,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:42,275 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-20 06:21:42,283 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-20 06:21:42,741 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:21:42,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-20 06:21:42,746 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-20 06:21:42,777 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:21:42,777 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 19 treesize of output 26 [2022-07-20 06:21:42,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 06:21:42,962 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-20 06:21:42,970 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-20 06:21:42,998 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 23 treesize of output 22 [2022-07-20 06:21:43,009 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 23 treesize of output 22 [2022-07-20 06:21:43,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:43,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:21:43,140 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:21:43,140 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 97 treesize of output 60 [2022-07-20 06:21:43,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-20 06:21:43,542 INFO L356 Elim1Store]: treesize reduction 11, result has 66.7 percent of original size [2022-07-20 06:21:43,542 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 65 [2022-07-20 06:21:43,558 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-20 06:21:43,558 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 06:21:43,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-20 06:21:43,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:43,947 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:21:43,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 82 [2022-07-20 06:21:43,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:43,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:43,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:43,989 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-20 06:21:43,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-20 06:21:44,041 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:21:44,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:21:44,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:21:45,042 INFO L356 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2022-07-20 06:21:45,043 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 109 [2022-07-20 06:21:45,084 INFO L356 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-07-20 06:21:45,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 54 [2022-07-20 06:21:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:21:45,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:45,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468463565] [2022-07-20 06:21:45,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468463565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [313493823] [2022-07-20 06:21:45,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:21:45,890 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:21:45,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:21:45,891 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:21:45,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-07-20 06:21:46,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:21:46,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:21:46,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-20 06:21:46,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:46,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:21:46,830 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-20 06:21:46,844 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-20 06:21:47,444 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:21:47,444 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 19 treesize of output 26 [2022-07-20 06:21:47,466 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-20 06:21:47,478 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-20 06:21:47,799 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-20 06:21:47,812 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-20 06:21:47,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:21:47,882 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 23 treesize of output 22 [2022-07-20 06:21:48,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:48,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:21:48,212 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:21:48,212 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 97 treesize of output 60 [2022-07-20 06:21:48,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-20 06:21:48,978 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:21:48,978 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 44 [2022-07-20 06:21:48,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:21:48,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 06:21:49,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:49,290 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-20 06:21:49,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 82 [2022-07-20 06:21:49,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:49,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:49,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:49,311 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-20 06:21:49,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-20 06:21:49,339 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-20 06:21:49,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:21:51,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:21:51,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:51,567 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-20 06:21:51,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 82 [2022-07-20 06:21:51,603 INFO L356 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-07-20 06:21:51,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2022-07-20 06:21:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:21:51,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:21:52,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [313493823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:21:52,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:21:52,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 49 [2022-07-20 06:21:52,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674042632] [2022-07-20 06:21:52,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:21:52,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-20 06:21:52,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:52,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-20 06:21:52,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2716, Unknown=7, NotChecked=0, Total=2970 [2022-07-20 06:21:52,011 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 49 states, 47 states have (on average 1.702127659574468) internal successors, (80), 43 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:21:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:54,127 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-07-20 06:21:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:21:54,128 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.702127659574468) internal successors, (80), 43 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-07-20 06:21:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:54,128 INFO L225 Difference]: With dead ends: 114 [2022-07-20 06:21:54,128 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 06:21:54,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 82 SyntacticMatches, 13 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=339, Invalid=3681, Unknown=12, NotChecked=0, Total=4032 [2022-07-20 06:21:54,130 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 48 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:54,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1005 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 597 Invalid, 0 Unknown, 366 Unchecked, 1.1s Time] [2022-07-20 06:21:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 06:21:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2022-07-20 06:21:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 104 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:21:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2022-07-20 06:21:54,133 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 59 [2022-07-20 06:21:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:54,134 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2022-07-20 06:21:54,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.702127659574468) internal successors, (80), 43 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 06:21:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-07-20 06:21:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:21:54,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:54,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:54,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:54,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-20 06:21:54,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:54,541 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094492, now seen corresponding path program 1 times [2022-07-20 06:21:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:54,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085451219] [2022-07-20 06:21:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:54,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:54,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:54,543 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:54,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-20 06:21:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:54,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 06:21:54,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:55,162 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 7 treesize of output 3 [2022-07-20 06:21:55,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:55,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:21:55,753 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:21:55,753 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 27 treesize of output 28 [2022-07-20 06:21:55,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:55,836 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 23 treesize of output 23 [2022-07-20 06:21:55,966 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 24 treesize of output 12 [2022-07-20 06:21:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:21:56,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:21:56,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:21:56,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085451219] [2022-07-20 06:21:56,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085451219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:21:56,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:21:56,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-07-20 06:21:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861697627] [2022-07-20 06:21:56,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:21:56,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 06:21:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:21:56,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 06:21:56,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=473, Unknown=9, NotChecked=0, Total=552 [2022-07-20 06:21:56,091 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:21:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:21:56,809 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-07-20 06:21:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:21:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2022-07-20 06:21:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:21:56,810 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:21:56,810 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 06:21:56,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=693, Unknown=12, NotChecked=0, Total=812 [2022-07-20 06:21:56,811 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:21:56,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 375 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 250 Unchecked, 0.4s Time] [2022-07-20 06:21:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 06:21:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-20 06:21:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 118 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-20 06:21:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-07-20 06:21:56,815 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 59 [2022-07-20 06:21:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:21:56,815 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-07-20 06:21:56,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:21:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-07-20 06:21:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:21:56,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:21:56,816 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:21:56,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-20 06:21:57,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:21:57,027 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-20 06:21:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:21:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094491, now seen corresponding path program 1 times [2022-07-20 06:21:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:21:57,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185283587] [2022-07-20 06:21:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:21:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:21:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:21:57,031 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:21:57,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-20 06:21:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:21:57,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 06:21:57,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:21:57,597 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 6 treesize of output 5 [2022-07-20 06:21:57,716 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 7 treesize of output 3 [2022-07-20 06:21:57,719 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 7 treesize of output 3 [2022-07-20 06:21:58,015 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:21:58,015 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-20 06:21:58,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:21:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:58,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:21:58,461 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:21:58,462 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 43 treesize of output 42 [2022-07-20 06:21:58,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:58,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 33 treesize of output 33 [2022-07-20 06:21:58,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:58,575 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 29 treesize of output 29 [2022-07-20 06:21:58,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:21:58,586 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 29 treesize of output 29