./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:56:03,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:56:03,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:56:03,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:56:03,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:56:03,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:56:03,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:56:03,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:56:03,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:56:03,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:56:03,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:56:03,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:56:03,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:56:03,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:56:03,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:56:03,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:56:03,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:56:03,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:56:03,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:56:03,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:56:03,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:56:03,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:56:03,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:56:03,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:56:03,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:56:03,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:56:03,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:56:03,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:56:03,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:56:03,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:56:03,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:56:03,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:56:03,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:56:03,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:56:03,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:56:03,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:56:03,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:56:03,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:56:03,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:56:03,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:56:03,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:56:03,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:56:03,667 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:56:03,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:56:03,668 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:56:03,668 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:56:03,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:56:03,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:56:03,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:56:03,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:56:03,670 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:56:03,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:56:03,671 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:56:03,671 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:56:03,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:56:03,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:56:03,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:56:03,672 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:56:03,672 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:56:03,672 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:56:03,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:56:03,672 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:56:03,673 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:56:03,673 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:56:03,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:56:03,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:56:03,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:56:03,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:56:03,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:56:03,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:56:03,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:56:03,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:56:03,674 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:56:03,674 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:56:03,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:56:03,675 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:56:03,675 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2023-02-14 13:56:03,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:56:03,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:56:03,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:56:03,865 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:56:03,865 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:56:03,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-02-14 13:56:04,901 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:56:05,123 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:56:05,123 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-02-14 13:56:05,132 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96979fd9/682d56e305634f6eae52e75dc7e0465a/FLAG71f40d02c [2023-02-14 13:56:05,146 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96979fd9/682d56e305634f6eae52e75dc7e0465a [2023-02-14 13:56:05,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:56:05,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:56:05,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:56:05,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:56:05,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:56:05,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24831d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05, skipping insertion in model container [2023-02-14 13:56:05,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:56:05,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:56:05,436 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-02-14 13:56:05,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:56:05,463 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:56:05,497 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-02-14 13:56:05,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:56:05,521 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:56:05,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05 WrapperNode [2023-02-14 13:56:05,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:56:05,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:56:05,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:56:05,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:56:05,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,572 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2023-02-14 13:56:05,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:56:05,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:56:05,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:56:05,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:56:05,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,607 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:56:05,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:56:05,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:56:05,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:56:05,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (1/1) ... [2023-02-14 13:56:05,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:56:05,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:05,665 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) [2023-02-14 13:56:05,671 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 [2023-02-14 13:56:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:56:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:56:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-14 13:56:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-14 13:56:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:56:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:56:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 13:56:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:56:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:56:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:56:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 13:56:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:56:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:56:05,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:56:05,810 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:56:05,812 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:56:06,091 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:56:06,095 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:56:06,096 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 13:56:06,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:56:06 BoogieIcfgContainer [2023-02-14 13:56:06,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:56:06,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:56:06,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:56:06,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:56:06,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:56:05" (1/3) ... [2023-02-14 13:56:06,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0ba691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:56:06, skipping insertion in model container [2023-02-14 13:56:06,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:56:05" (2/3) ... [2023-02-14 13:56:06,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0ba691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:56:06, skipping insertion in model container [2023-02-14 13:56:06,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:56:06" (3/3) ... [2023-02-14 13:56:06,105 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-02-14 13:56:06,116 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:56:06,116 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-02-14 13:56:06,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:56:06,149 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50fc3ac7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:56:06,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-02-14 13:56:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 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) [2023-02-14 13:56:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:56:06,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:06,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:56:06,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:06,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 895521621, now seen corresponding path program 1 times [2023-02-14 13:56:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:06,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44392959] [2023-02-14 13:56:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:06,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:06,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44392959] [2023-02-14 13:56:06,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44392959] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:06,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:06,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:56:06,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939112449] [2023-02-14 13:56:06,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:06,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:56:06,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:56:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:56:06,390 INFO L87 Difference]: Start difference. First operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:06,478 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2023-02-14 13:56:06,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:56:06,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:56:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:06,485 INFO L225 Difference]: With dead ends: 125 [2023-02-14 13:56:06,486 INFO L226 Difference]: Without dead ends: 122 [2023-02-14 13:56:06,487 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 [2023-02-14 13:56:06,489 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:06,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-14 13:56:06,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-14 13:56:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.953125) internal successors, (125), 117 states have internal predecessors, (125), 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) [2023-02-14 13:56:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2023-02-14 13:56:06,513 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2023-02-14 13:56:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:06,514 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2023-02-14 13:56:06,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2023-02-14 13:56:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:56:06,514 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:06,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:56:06,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:56:06,515 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash 895521622, now seen corresponding path program 1 times [2023-02-14 13:56:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:06,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328211757] [2023-02-14 13:56:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:06,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:06,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328211757] [2023-02-14 13:56:06,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328211757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:06,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:06,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:56:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803653170] [2023-02-14 13:56:06,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:06,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:56:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:06,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:56:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:56:06,632 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:06,719 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2023-02-14 13:56:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:56:06,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:56:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:06,720 INFO L225 Difference]: With dead ends: 120 [2023-02-14 13:56:06,720 INFO L226 Difference]: Without dead ends: 120 [2023-02-14 13:56:06,720 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 [2023-02-14 13:56:06,721 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:06,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-14 13:56:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-14 13:56:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.921875) internal successors, (123), 115 states have internal predecessors, (123), 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) [2023-02-14 13:56:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2023-02-14 13:56:06,728 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2023-02-14 13:56:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:06,728 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2023-02-14 13:56:06,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:56:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2023-02-14 13:56:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 13:56:06,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:06,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:06,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:56:06,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash 164994135, now seen corresponding path program 1 times [2023-02-14 13:56:06,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:06,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452674013] [2023-02-14 13:56:06,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:06,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:06,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:06,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452674013] [2023-02-14 13:56:06,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452674013] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:06,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:06,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:56:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302508090] [2023-02-14 13:56:06,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:06,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:56:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:56:06,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:56:06,827 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:56:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:06,913 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-14 13:56:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:56:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-14 13:56:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:06,917 INFO L225 Difference]: With dead ends: 127 [2023-02-14 13:56:06,917 INFO L226 Difference]: Without dead ends: 127 [2023-02-14 13:56:06,918 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 [2023-02-14 13:56:06,918 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:06,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-14 13:56:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2023-02-14 13:56:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 116 states have internal predecessors, (124), 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) [2023-02-14 13:56:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2023-02-14 13:56:06,929 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 13 [2023-02-14 13:56:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:06,930 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2023-02-14 13:56:06,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:56:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2023-02-14 13:56:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:56:06,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:06,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:06,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:56:06,932 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453220, now seen corresponding path program 1 times [2023-02-14 13:56:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:06,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468563394] [2023-02-14 13:56:06,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:07,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468563394] [2023-02-14 13:56:07,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468563394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:07,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:07,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:56:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268334735] [2023-02-14 13:56:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:07,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:56:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:07,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:56:07,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:56:07,114 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:56:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:07,313 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2023-02-14 13:56:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:56:07,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-14 13:56:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:07,316 INFO L225 Difference]: With dead ends: 121 [2023-02-14 13:56:07,316 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 13:56:07,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:56:07,323 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 13 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:07,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:56:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 13:56:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2023-02-14 13:56:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 115 states have internal predecessors, (123), 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) [2023-02-14 13:56:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2023-02-14 13:56:07,339 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 22 [2023-02-14 13:56:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:07,340 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2023-02-14 13:56:07,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:56:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2023-02-14 13:56:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:56:07,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:07,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:07,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:56:07,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453219, now seen corresponding path program 1 times [2023-02-14 13:56:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:07,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187860749] [2023-02-14 13:56:07,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:07,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:07,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187860749] [2023-02-14 13:56:07,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187860749] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:07,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:07,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:56:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349352139] [2023-02-14 13:56:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:07,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:56:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:56:07,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:56:07,557 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:56:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:07,751 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2023-02-14 13:56:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:56:07,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-14 13:56:07,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:07,752 INFO L225 Difference]: With dead ends: 120 [2023-02-14 13:56:07,755 INFO L226 Difference]: Without dead ends: 120 [2023-02-14 13:56:07,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:56:07,757 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 11 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:07,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 443 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:56:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-14 13:56:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2023-02-14 13:56:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.876923076923077) internal successors, (122), 114 states have internal predecessors, (122), 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) [2023-02-14 13:56:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2023-02-14 13:56:07,771 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 22 [2023-02-14 13:56:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:07,771 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2023-02-14 13:56:07,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 13:56:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2023-02-14 13:56:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 13:56:07,772 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:07,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:07,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:56:07,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:07,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296005, now seen corresponding path program 1 times [2023-02-14 13:56:07,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:07,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840990755] [2023-02-14 13:56:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:56:08,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:08,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840990755] [2023-02-14 13:56:08,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840990755] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:08,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986481028] [2023-02-14 13:56:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:08,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:08,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:08,035 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) [2023-02-14 13:56:08,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 13:56:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:08,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 13:56:08,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:08,192 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:08,221 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-14 13:56:08,232 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-14 13:56:08,248 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:56:08,248 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-14 13:56:08,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:08,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986481028] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:56:08,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:56:08,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-14 13:56:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780532422] [2023-02-14 13:56:08,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:08,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 13:56:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 13:56:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-14 13:56:08,550 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:56:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:08,783 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2023-02-14 13:56:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:56:08,784 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-14 13:56:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:08,785 INFO L225 Difference]: With dead ends: 136 [2023-02-14 13:56:08,785 INFO L226 Difference]: Without dead ends: 136 [2023-02-14 13:56:08,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-14 13:56:08,785 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 208 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:08,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 441 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 425 Invalid, 0 Unknown, 246 Unchecked, 0.2s Time] [2023-02-14 13:56:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-14 13:56:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2023-02-14 13:56:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 113 states have internal predecessors, (121), 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) [2023-02-14 13:56:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2023-02-14 13:56:08,798 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 25 [2023-02-14 13:56:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:08,798 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2023-02-14 13:56:08,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:56:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2023-02-14 13:56:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 13:56:08,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:08,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:08,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:08,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-14 13:56:08,999 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296006, now seen corresponding path program 1 times [2023-02-14 13:56:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:09,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171439191] [2023-02-14 13:56:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:56:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171439191] [2023-02-14 13:56:09,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171439191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127218403] [2023-02-14 13:56:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:09,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:09,326 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) [2023-02-14 13:56:09,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 13:56:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:09,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 13:56:09,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:09,486 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:09,669 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:09,669 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:09,676 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-14 13:56:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:09,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:09,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127218403] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:09,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:09,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-14 13:56:09,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226682619] [2023-02-14 13:56:09,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:09,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 13:56:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 13:56:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-02-14 13:56:09,835 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:56:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:10,179 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2023-02-14 13:56:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:56:10,181 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-14 13:56:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:10,181 INFO L225 Difference]: With dead ends: 119 [2023-02-14 13:56:10,181 INFO L226 Difference]: Without dead ends: 119 [2023-02-14 13:56:10,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-02-14 13:56:10,182 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 117 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:10,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 604 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 13:56:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-14 13:56:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-02-14 13:56:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 1.8461538461538463) internal successors, (120), 112 states have internal predecessors, (120), 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) [2023-02-14 13:56:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2023-02-14 13:56:10,184 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 25 [2023-02-14 13:56:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:10,184 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2023-02-14 13:56:10,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 13:56:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2023-02-14 13:56:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 13:56:10,185 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:10,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:10,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:10,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-14 13:56:10,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704927, now seen corresponding path program 1 times [2023-02-14 13:56:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:10,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646526894] [2023-02-14 13:56:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:10,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:10,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:56:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:10,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646526894] [2023-02-14 13:56:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646526894] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439327520] [2023-02-14 13:56:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:10,678 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) [2023-02-14 13:56:10,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 13:56:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:10,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 13:56:10,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:10,790 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:10,807 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:10,819 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:56:10,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:10,849 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:10,857 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2023-02-14 13:56:10,864 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2023-02-14 13:56:10,875 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:56:10,875 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:10,911 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-14 13:56:10,932 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:10,932 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-14 13:56:10,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:11,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439327520] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:11,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:11,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2023-02-14 13:56:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322324305] [2023-02-14 13:56:11,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:11,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 13:56:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 13:56:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2023-02-14 13:56:11,189 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:56:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:11,533 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2023-02-14 13:56:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:56:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2023-02-14 13:56:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:11,535 INFO L225 Difference]: With dead ends: 126 [2023-02-14 13:56:11,535 INFO L226 Difference]: Without dead ends: 126 [2023-02-14 13:56:11,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=363, Unknown=4, NotChecked=172, Total=650 [2023-02-14 13:56:11,536 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 278 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:11,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 350 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 450 Invalid, 0 Unknown, 522 Unchecked, 0.3s Time] [2023-02-14 13:56:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-14 13:56:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2023-02-14 13:56:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 103 states have internal predecessors, (111), 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) [2023-02-14 13:56:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2023-02-14 13:56:11,539 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 37 [2023-02-14 13:56:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:11,540 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2023-02-14 13:56:11,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 13:56:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2023-02-14 13:56:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 13:56:11,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:11,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:11,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-14 13:56:11,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:11,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704928, now seen corresponding path program 1 times [2023-02-14 13:56:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:11,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940027203] [2023-02-14 13:56:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:12,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:12,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 13:56:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940027203] [2023-02-14 13:56:12,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940027203] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951586219] [2023-02-14 13:56:12,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:12,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:12,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:12,158 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) [2023-02-14 13:56:12,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 13:56:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:12,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:56:12,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:12,280 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:12,290 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:12,304 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2023-02-14 13:56:12,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:12,328 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:12,344 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:12,350 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:56:12,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:12,373 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:12,415 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:12,420 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:56:12,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:12,442 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-14 13:56:12,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:12,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951586219] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:12,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:12,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2023-02-14 13:56:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707817206] [2023-02-14 13:56:12,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:12,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 13:56:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:12,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 13:56:12,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=171, Unknown=3, NotChecked=84, Total=306 [2023-02-14 13:56:12,504 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:12,823 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2023-02-14 13:56:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:56:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-02-14 13:56:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:12,834 INFO L225 Difference]: With dead ends: 117 [2023-02-14 13:56:12,834 INFO L226 Difference]: Without dead ends: 117 [2023-02-14 13:56:12,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=243, Unknown=3, NotChecked=102, Total=420 [2023-02-14 13:56:12,835 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 257 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:12,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 350 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 489 Invalid, 0 Unknown, 303 Unchecked, 0.3s Time] [2023-02-14 13:56:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-14 13:56:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2023-02-14 13:56:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 94 states have internal predecessors, (102), 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) [2023-02-14 13:56:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2023-02-14 13:56:12,837 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 37 [2023-02-14 13:56:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:12,837 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2023-02-14 13:56:12,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2023-02-14 13:56:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 13:56:12,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:12,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:12,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:13,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:13,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990998, now seen corresponding path program 1 times [2023-02-14 13:56:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:13,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706594632] [2023-02-14 13:56:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-14 13:56:13,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:13,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706594632] [2023-02-14 13:56:13,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706594632] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:13,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:13,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:56:13,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182226509] [2023-02-14 13:56:13,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:13,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:56:13,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:13,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:56:13,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:56:13,136 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:56:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:13,262 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2023-02-14 13:56:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:56:13,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-14 13:56:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:13,263 INFO L225 Difference]: With dead ends: 115 [2023-02-14 13:56:13,263 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 13:56:13,263 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 [2023-02-14 13:56:13,263 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 77 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:13,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 289 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 13:56:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2023-02-14 13:56:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 92 states have internal predecessors, (100), 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) [2023-02-14 13:56:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2023-02-14 13:56:13,265 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 40 [2023-02-14 13:56:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:13,265 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2023-02-14 13:56:13,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:56:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2023-02-14 13:56:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 13:56:13,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:13,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:13,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 13:56:13,266 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990997, now seen corresponding path program 1 times [2023-02-14 13:56:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:13,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837227510] [2023-02-14 13:56:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:13,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:56:13,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:13,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837227510] [2023-02-14 13:56:13,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837227510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:13,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:56:13,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:56:13,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329096186] [2023-02-14 13:56:13,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:13,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:56:13,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:13,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:56:13,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:56:13,412 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:56:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:13,531 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2023-02-14 13:56:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:56:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-14 13:56:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:13,532 INFO L225 Difference]: With dead ends: 95 [2023-02-14 13:56:13,532 INFO L226 Difference]: Without dead ends: 95 [2023-02-14 13:56:13,532 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 [2023-02-14 13:56:13,532 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 78 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:13,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 300 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-14 13:56:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-02-14 13:56:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 90 states have internal predecessors, (98), 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) [2023-02-14 13:56:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2023-02-14 13:56:13,534 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 40 [2023-02-14 13:56:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:13,534 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2023-02-14 13:56:13,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 13:56:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2023-02-14 13:56:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:56:13,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:13,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:13,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 13:56:13,535 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:13,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801691, now seen corresponding path program 1 times [2023-02-14 13:56:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:13,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012499029] [2023-02-14 13:56:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:56:13,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:13,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012499029] [2023-02-14 13:56:13,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012499029] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:13,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428161029] [2023-02-14 13:56:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:13,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:13,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:13,997 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) [2023-02-14 13:56:13,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 13:56:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:14,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-14 13:56:14,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:14,274 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:14,347 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1056 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1056))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-14 13:56:14,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:14,366 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:14,374 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-14 13:56:14,374 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-14 13:56:14,424 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 13:56:14,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:56:14,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428161029] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:14,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:56:14,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-14 13:56:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918052512] [2023-02-14 13:56:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:14,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 13:56:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 13:56:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-14 13:56:14,438 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:56:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:14,869 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2023-02-14 13:56:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 13:56:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-14 13:56:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:14,870 INFO L225 Difference]: With dead ends: 145 [2023-02-14 13:56:14,870 INFO L226 Difference]: Without dead ends: 145 [2023-02-14 13:56:14,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-14 13:56:14,871 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 89 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:14,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 904 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 804 Invalid, 3 Unknown, 177 Unchecked, 0.3s Time] [2023-02-14 13:56:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-14 13:56:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 94. [2023-02-14 13:56:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 89 states have internal predecessors, (98), 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) [2023-02-14 13:56:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2023-02-14 13:56:14,885 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 41 [2023-02-14 13:56:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:14,885 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2023-02-14 13:56:14,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:56:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2023-02-14 13:56:14,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:56:14,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:14,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:14,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:15,091 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,SelfDestructingSolverStorable11 [2023-02-14 13:56:15,092 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:15,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801690, now seen corresponding path program 1 times [2023-02-14 13:56:15,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:15,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407796864] [2023-02-14 13:56:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:15,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:15,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407796864] [2023-02-14 13:56:15,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407796864] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:15,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980177997] [2023-02-14 13:56:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:15,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:15,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:15,745 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) [2023-02-14 13:56:15,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 13:56:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:15,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-14 13:56:15,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:16,147 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:16,150 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:16,257 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1215 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1215))) (exists ((v_ArrVal_1211 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1211) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1214 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1214))))) is different from true [2023-02-14 13:56:16,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:16,301 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:16,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:16,304 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:16,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:16,307 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2023-02-14 13:56:16,313 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:56:16,313 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:16,343 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:16,346 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 13:56:16,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:16,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980177997] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:16,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:16,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2023-02-14 13:56:16,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631432826] [2023-02-14 13:56:16,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:16,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 13:56:16,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:16,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 13:56:16,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2023-02-14 13:56:16,557 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:17,769 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2023-02-14 13:56:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 13:56:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-02-14 13:56:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:17,771 INFO L225 Difference]: With dead ends: 158 [2023-02-14 13:56:17,771 INFO L226 Difference]: Without dead ends: 158 [2023-02-14 13:56:17,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=331, Invalid=2638, Unknown=5, NotChecked=106, Total=3080 [2023-02-14 13:56:17,772 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 637 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:17,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1386 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1452 Invalid, 3 Unknown, 167 Unchecked, 0.6s Time] [2023-02-14 13:56:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-14 13:56:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 102. [2023-02-14 13:56:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 97 states have internal predecessors, (106), 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) [2023-02-14 13:56:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2023-02-14 13:56:17,774 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 41 [2023-02-14 13:56:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:17,776 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2023-02-14 13:56:17,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2023-02-14 13:56:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 13:56:17,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:17,776 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-14 13:56:17,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:17,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:17,984 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1993086700, now seen corresponding path program 1 times [2023-02-14 13:56:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:17,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217920012] [2023-02-14 13:56:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:18,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217920012] [2023-02-14 13:56:18,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217920012] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956308768] [2023-02-14 13:56:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:18,539 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) [2023-02-14 13:56:18,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 13:56:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:18,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 13:56:18,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:18,889 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:18,933 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1405 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1405) |c_#memory_$Pointer$.base|))) is different from true [2023-02-14 13:56:18,938 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1406 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1406))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 13:56:18,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:18,952 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:19,000 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-02-14 13:56:19,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:19,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956308768] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:19,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:19,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2023-02-14 13:56:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794821590] [2023-02-14 13:56:19,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:19,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 13:56:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:19,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 13:56:19,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1014, Unknown=11, NotChecked=130, Total=1260 [2023-02-14 13:56:19,129 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:19,901 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-02-14 13:56:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 13:56:19,902 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2023-02-14 13:56:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:19,902 INFO L225 Difference]: With dead ends: 104 [2023-02-14 13:56:19,902 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 13:56:19,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=1747, Unknown=13, NotChecked=174, Total=2162 [2023-02-14 13:56:19,903 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 351 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:19,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1009 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1005 Invalid, 0 Unknown, 200 Unchecked, 0.4s Time] [2023-02-14 13:56:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 13:56:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-02-14 13:56:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 93 states have internal predecessors, (101), 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) [2023-02-14 13:56:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-02-14 13:56:19,905 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 44 [2023-02-14 13:56:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:19,905 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-02-14 13:56:19,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-14 13:56:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-02-14 13:56:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:56:19,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:19,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-14 13:56:19,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:20,111 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 [2023-02-14 13:56:20,112 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176968, now seen corresponding path program 1 times [2023-02-14 13:56:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794711209] [2023-02-14 13:56:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794711209] [2023-02-14 13:56:21,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794711209] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872799106] [2023-02-14 13:56:21,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:21,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:21,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:21,043 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) [2023-02-14 13:56:21,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 13:56:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:21,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-14 13:56:21,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:21,223 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:21,371 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:21,371 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:21,447 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:21,548 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:21,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 13:56:21,680 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:21,681 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 22 [2023-02-14 13:56:21,684 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:21,687 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:21,826 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1573 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1573) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1572 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1572))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-14 13:56:21,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:21,859 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:56:21,859 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 43 [2023-02-14 13:56:21,884 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-14 13:56:21,885 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 57 [2023-02-14 13:56:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:21,888 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:22,011 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:22,236 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:56:22,243 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-14 13:56:22,244 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 36 [2023-02-14 13:56:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:56:22,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:22,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872799106] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:22,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:22,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2023-02-14 13:56:22,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274929113] [2023-02-14 13:56:22,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:22,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-14 13:56:22,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:22,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-14 13:56:22,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2476, Unknown=2, NotChecked=100, Total=2756 [2023-02-14 13:56:22,562 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 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) [2023-02-14 13:56:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:24,761 INFO L93 Difference]: Finished difference Result 207 states and 228 transitions. [2023-02-14 13:56:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 13:56:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 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 46 [2023-02-14 13:56:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:24,769 INFO L225 Difference]: With dead ends: 207 [2023-02-14 13:56:24,770 INFO L226 Difference]: Without dead ends: 207 [2023-02-14 13:56:24,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=493, Invalid=4477, Unknown=4, NotChecked=138, Total=5112 [2023-02-14 13:56:24,776 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 566 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:24,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1421 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1913 Invalid, 3 Unknown, 192 Unchecked, 0.9s Time] [2023-02-14 13:56:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-14 13:56:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 118. [2023-02-14 13:56:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 111 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) [2023-02-14 13:56:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2023-02-14 13:56:24,780 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 46 [2023-02-14 13:56:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:24,781 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2023-02-14 13:56:24,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 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) [2023-02-14 13:56:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2023-02-14 13:56:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:56:24,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:24,784 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-14 13:56:24,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:24,990 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 [2023-02-14 13:56:24,990 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176969, now seen corresponding path program 1 times [2023-02-14 13:56:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:24,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433392745] [2023-02-14 13:56:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:24,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:25,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:25,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433392745] [2023-02-14 13:56:26,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433392745] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152274001] [2023-02-14 13:56:26,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:26,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:26,128 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) [2023-02-14 13:56:26,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 13:56:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:26,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 114 conjunts are in the unsatisfiable core [2023-02-14 13:56:26,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:26,337 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:26,594 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:56:26,595 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:26,680 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:26,687 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:26,820 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:26,820 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 44 [2023-02-14 13:56:26,825 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:27,001 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:27,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2023-02-14 13:56:27,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2023-02-14 13:56:27,175 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1745 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1745) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1749 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1748 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1748))))) is different from true [2023-02-14 13:56:27,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:27,250 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:56:27,250 INFO L350 Elim1Store]: Elim1 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 75 [2023-02-14 13:56:27,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:27,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:27,259 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:56:27,259 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 80 [2023-02-14 13:56:27,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:27,266 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 26 [2023-02-14 13:56:27,279 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-14 13:56:27,280 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 34 [2023-02-14 13:56:27,477 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:27,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2023-02-14 13:56:27,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-02-14 13:56:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:56:27,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:27,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152274001] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:27,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:27,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2023-02-14 13:56:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681318118] [2023-02-14 13:56:27,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:27,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-14 13:56:27,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:27,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-14 13:56:27,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2907, Unknown=2, NotChecked=108, Total=3192 [2023-02-14 13:56:27,890 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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) [2023-02-14 13:56:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:31,345 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2023-02-14 13:56:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 13:56:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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 46 [2023-02-14 13:56:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:31,347 INFO L225 Difference]: With dead ends: 243 [2023-02-14 13:56:31,347 INFO L226 Difference]: Without dead ends: 243 [2023-02-14 13:56:31,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=465, Invalid=5087, Unknown=2, NotChecked=146, Total=5700 [2023-02-14 13:56:31,348 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 613 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:31,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2718 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3642 Invalid, 0 Unknown, 124 Unchecked, 1.8s Time] [2023-02-14 13:56:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-14 13:56:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 117. [2023-02-14 13:56:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.348314606741573) internal successors, (120), 110 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) [2023-02-14 13:56:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2023-02-14 13:56:31,352 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 46 [2023-02-14 13:56:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:31,352 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2023-02-14 13:56:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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) [2023-02-14 13:56:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2023-02-14 13:56:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:56:31,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:31,353 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:31,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:31,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-14 13:56:31,558 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1589162821, now seen corresponding path program 2 times [2023-02-14 13:56:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:31,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471963703] [2023-02-14 13:56:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:32,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471963703] [2023-02-14 13:56:32,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471963703] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:32,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546559004] [2023-02-14 13:56:32,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:56:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:32,720 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) [2023-02-14 13:56:32,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 13:56:32,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:56:32,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:56:32,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 136 conjunts are in the unsatisfiable core [2023-02-14 13:56:32,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:32,945 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:33,194 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:33,194 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:33,276 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:33,282 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:33,389 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 13:56:33,389 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 33 [2023-02-14 13:56:33,394 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:33,772 INFO L321 Elim1Store]: treesize reduction 72, result has 29.4 percent of original size [2023-02-14 13:56:33,772 INFO L350 Elim1Store]: Elim1 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 6 case distinctions, treesize of input 99 treesize of output 78 [2023-02-14 13:56:33,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:33,809 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-14 13:56:33,809 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 53 [2023-02-14 13:56:33,821 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-14 13:56:33,822 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-14 13:56:34,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:34,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:34,646 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:56:34,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2023-02-14 13:56:34,931 INFO L321 Elim1Store]: treesize reduction 102, result has 15.7 percent of original size [2023-02-14 13:56:34,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 57 [2023-02-14 13:56:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:35,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:35,189 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2023-02-14 13:56:35,189 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 23 [2023-02-14 13:56:35,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546559004] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:35,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:35,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2023-02-14 13:56:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154827848] [2023-02-14 13:56:35,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:35,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-14 13:56:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-14 13:56:35,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4463, Unknown=4, NotChecked=0, Total=4692 [2023-02-14 13:56:35,653 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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) [2023-02-14 13:56:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:40,958 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2023-02-14 13:56:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 13:56:40,959 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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 51 [2023-02-14 13:56:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:40,959 INFO L225 Difference]: With dead ends: 175 [2023-02-14 13:56:40,960 INFO L226 Difference]: Without dead ends: 175 [2023-02-14 13:56:40,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2099 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=585, Invalid=8340, Unknown=5, NotChecked=0, Total=8930 [2023-02-14 13:56:40,961 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 444 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:40,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1880 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2641 Invalid, 1 Unknown, 0 Unchecked, 1.4s Time] [2023-02-14 13:56:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-14 13:56:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 120. [2023-02-14 13:56:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 113 states have internal predecessors, (123), 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) [2023-02-14 13:56:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2023-02-14 13:56:40,972 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 51 [2023-02-14 13:56:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:40,972 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2023-02-14 13:56:40,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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) [2023-02-14 13:56:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2023-02-14 13:56:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 13:56:40,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:40,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:40,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:41,177 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,SelfDestructingSolverStorable16 [2023-02-14 13:56:41,177 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680377, now seen corresponding path program 1 times [2023-02-14 13:56:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:41,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110189672] [2023-02-14 13:56:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:41,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:41,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:41,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110189672] [2023-02-14 13:56:41,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110189672] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:41,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250045891] [2023-02-14 13:56:41,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:41,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:41,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:41,815 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) [2023-02-14 13:56:41,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 13:56:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:41,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-14 13:56:41,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:42,047 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:42,185 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:42,211 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 13:56:42,211 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 20 [2023-02-14 13:56:42,241 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:56:42,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:56:42,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250045891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:42,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:56:42,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 29 [2023-02-14 13:56:42,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170754269] [2023-02-14 13:56:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:42,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 13:56:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:42,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 13:56:42,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2023-02-14 13:56:42,244 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:56:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:42,373 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2023-02-14 13:56:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:56:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2023-02-14 13:56:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:42,375 INFO L225 Difference]: With dead ends: 139 [2023-02-14 13:56:42,375 INFO L226 Difference]: Without dead ends: 139 [2023-02-14 13:56:42,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2023-02-14 13:56:42,376 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 248 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:42,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 346 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-14 13:56:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2023-02-14 13:56:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.326086956521739) 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) [2023-02-14 13:56:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-14 13:56:42,396 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 52 [2023-02-14 13:56:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:42,396 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-14 13:56:42,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:56:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-14 13:56:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 13:56:42,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:42,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:42,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:42,610 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,SelfDestructingSolverStorable17 [2023-02-14 13:56:42,610 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680376, now seen corresponding path program 1 times [2023-02-14 13:56:42,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:42,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915588455] [2023-02-14 13:56:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:42,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:43,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:43,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:43,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915588455] [2023-02-14 13:56:43,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915588455] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:43,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008229188] [2023-02-14 13:56:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:43,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:43,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:43,464 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) [2023-02-14 13:56:43,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 13:56:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:43,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-14 13:56:43,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:43,706 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:43,836 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:43,839 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:43,870 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 13:56:43,870 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 20 [2023-02-14 13:56:43,877 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 13:56:43,878 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 18 [2023-02-14 13:56:43,920 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:56:43,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-02-14 13:56:43,923 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:56:43,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-02-14 13:56:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 13:56:43,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:56:43,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008229188] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:43,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:56:43,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 31 [2023-02-14 13:56:43,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261478596] [2023-02-14 13:56:43,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:43,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 13:56:43,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:43,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 13:56:43,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2023-02-14 13:56:43,955 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:56:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:44,110 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-02-14 13:56:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:56:44,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2023-02-14 13:56:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:44,111 INFO L225 Difference]: With dead ends: 119 [2023-02-14 13:56:44,111 INFO L226 Difference]: Without dead ends: 119 [2023-02-14 13:56:44,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2023-02-14 13:56:44,112 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 179 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:44,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 351 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:56:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-14 13:56:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-02-14 13:56:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 110 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) [2023-02-14 13:56:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2023-02-14 13:56:44,129 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 52 [2023-02-14 13:56:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:44,130 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2023-02-14 13:56:44,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 13:56:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2023-02-14 13:56:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 13:56:44,131 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:44,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:56:44,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:44,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:44,336 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash 965522297, now seen corresponding path program 1 times [2023-02-14 13:56:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:44,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535465822] [2023-02-14 13:56:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:44,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:45,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:45,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535465822] [2023-02-14 13:56:45,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535465822] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:45,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268066018] [2023-02-14 13:56:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:45,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:45,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:45,306 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) [2023-02-14 13:56:45,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 13:56:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:45,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 90 conjunts are in the unsatisfiable core [2023-02-14 13:56:45,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:45,529 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:45,677 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:45,677 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:45,789 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:45,919 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:45,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-14 13:56:46,065 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:46,065 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 17 [2023-02-14 13:56:46,069 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:46,183 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2533 (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_2534)) (= 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_2533)))) is different from true [2023-02-14 13:56:46,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:46,218 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 13:56:46,219 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 40 [2023-02-14 13:56:46,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:46,222 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 34 [2023-02-14 13:56:46,231 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 13:56:46,232 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:46,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-02-14 13:56:46,385 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:56:46,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-14 13:56:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:56:46,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:46,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268066018] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:46,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 13:56:46,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 46 [2023-02-14 13:56:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105790775] [2023-02-14 13:56:46,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 13:56:46,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 13:56:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:46,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 13:56:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2290, Unknown=1, NotChecked=96, Total=2550 [2023-02-14 13:56:46,614 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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) [2023-02-14 13:56:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:47,772 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-02-14 13:56:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 13:56:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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 54 [2023-02-14 13:56:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:47,774 INFO L225 Difference]: With dead ends: 120 [2023-02-14 13:56:47,774 INFO L226 Difference]: Without dead ends: 120 [2023-02-14 13:56:47,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=3715, Unknown=1, NotChecked=124, Total=4160 [2023-02-14 13:56:47,775 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 155 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:47,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1564 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1505 Invalid, 0 Unknown, 102 Unchecked, 0.6s Time] [2023-02-14 13:56:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-14 13:56:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2023-02-14 13:56:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 110 states have internal predecessors, (119), 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) [2023-02-14 13:56:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2023-02-14 13:56:47,778 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 54 [2023-02-14 13:56:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:47,778 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2023-02-14 13:56:47,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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) [2023-02-14 13:56:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2023-02-14 13:56:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 13:56:47,779 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:47,779 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-02-14 13:56:47,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-14 13:56:47,985 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,SelfDestructingSolverStorable19 [2023-02-14 13:56:47,985 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2042113126, now seen corresponding path program 3 times [2023-02-14 13:56:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:47,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423658873] [2023-02-14 13:56:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:48,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:48,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-14 13:56:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-14 13:56:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-02-14 13:56:48,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:48,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423658873] [2023-02-14 13:56:48,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423658873] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:48,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789474487] [2023-02-14 13:56:48,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 13:56:48,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:48,086 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) [2023-02-14 13:56:48,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 13:56:48,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-14 13:56:48,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:56:48,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 13:56:48,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 13:56:48,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:56:48,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789474487] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:56:48,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 13:56:48,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-14 13:56:48,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760146204] [2023-02-14 13:56:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:56:48,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:56:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:56:48,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:56:48,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:56:48,413 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:56:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:56:48,422 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-02-14 13:56:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:56:48,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2023-02-14 13:56:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:56:48,423 INFO L225 Difference]: With dead ends: 85 [2023-02-14 13:56:48,424 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 13:56:48,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:56:48,428 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:56:48,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 99 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:56:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 13:56:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-14 13:56:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 80 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) [2023-02-14 13:56:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-02-14 13:56:48,430 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 58 [2023-02-14 13:56:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:56:48,430 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-02-14 13:56:48,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 13:56:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-02-14 13:56:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-14 13:56:48,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:56:48,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2023-02-14 13:56:48,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-14 13:56:48,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:48,647 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:56:48,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:56:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash -214738826, now seen corresponding path program 1 times [2023-02-14 13:56:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:56:48,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557884436] [2023-02-14 13:56:48,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:56:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:56:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 13:56:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 13:56:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 13:56:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:56:50,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557884436] [2023-02-14 13:56:50,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557884436] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:56:50,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682555191] [2023-02-14 13:56:50,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:56:50,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:56:50,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:56:50,637 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) [2023-02-14 13:56:50,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-14 13:56:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:56:50,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 182 conjunts are in the unsatisfiable core [2023-02-14 13:56:50,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:56:50,878 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:50,938 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:50,968 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:51,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:51,074 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:51,182 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:51,186 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:51,389 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:56:51,389 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:51,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:51,396 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 14 [2023-02-14 13:56:51,536 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:51,702 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:56:51,702 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 34 [2023-02-14 13:56:51,938 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 13:56:51,938 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 24 [2023-02-14 13:56:51,941 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:51,944 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:51,948 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:52,155 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:52,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:52,330 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 13:56:52,330 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 56 [2023-02-14 13:56:52,349 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 13:56:52,349 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:52,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:52,359 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:52,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:52,364 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 14 [2023-02-14 13:56:53,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:53,164 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 38 treesize of output 21 [2023-02-14 13:56:53,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:53,422 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-14 13:56:53,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:53,560 INFO L321 Elim1Store]: treesize reduction 86, result has 3.4 percent of original size [2023-02-14 13:56:53,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 99 treesize of output 48 [2023-02-14 13:56:53,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:53,739 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-02-14 13:56:53,853 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:53,859 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:53,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:53,872 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:53,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:53,972 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 31 [2023-02-14 13:56:53,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:53,979 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 21 [2023-02-14 13:56:53,983 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:54,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:54,118 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 47 treesize of output 23 [2023-02-14 13:56:54,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:56:54,124 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 33 treesize of output 13 [2023-02-14 13:56:54,173 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 13:56:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 18 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:56:54,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:56:54,450 INFO L350 Elim1Store]: Elim1 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 230 treesize of output 226 [2023-02-14 13:56:54,466 INFO L350 Elim1Store]: Elim1 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 526 treesize of output 510 [2023-02-14 13:56:55,834 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse34 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse5 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse23 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (not .cse23)) (.cse27 (not .cse5)) (.cse47 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse64 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse63 (select .cse64 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse65 (+ v_arrayElimCell_156 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 .cse34)) (= (select (select .cse64 v_arrayElimCell_155) .cse65) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse63 .cse65))))))) (.cse49 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse60 (select .cse62 v_arrayElimCell_155)) (.cse61 (+ v_arrayElimCell_156 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse60 .cse34)) (= (select .cse60 .cse61) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse61))))))) (.cse48 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969)) (.cse59 (+ v_arrayElimCell_156 4))) (or (= (select (select .cse58 v_arrayElimCell_155) .cse59) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse58 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse59)))))) (.cse54 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse55 (select .cse57 v_arrayElimCell_155))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse56 (+ v_arrayElimCell_156 4))) (or (= (select .cse55 .cse56) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse57 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse56))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse55 .cse34))))))) (.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse34)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (or (not .cse1) .cse25 (not .cse2))) (.cse12 (or .cse5 .cse54)) (.cse17 (or .cse54 .cse23)) (.cse10 (or .cse5 .cse48)) (.cse11 (or .cse5 .cse49)) (.cse13 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse50 (select .cse53 v_arrayElimCell_155)) (.cse51 (select .cse53 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse52 (+ v_arrayElimCell_156 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse50 .cse34)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse51 .cse34)) (= (select .cse50 .cse52) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse51 .cse52))))))) (.cse18 (or .cse49 .cse23)) (.cse19 (or .cse48 .cse23)) (.cse9 (or .cse47 .cse23)) (.cse22 (or .cse5 .cse47)) (.cse4 (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_155 Int)) (let ((.cse43 (select .cse46 v_arrayElimCell_155))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse44 (+ v_arrayElimCell_156 4))) (or (= (select .cse43 .cse44) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse44))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 .cse34))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse34))))))) (.cse14 (or .cse26 .cse27 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse41 (select .cse42 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 .cse34)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse34)) (= (select .cse41 (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (let ((.cse0 (and .cse4 .cse14)) (.cse8 (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (let ((.cse40 (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (let ((.cse39 (+ v_arrayElimCell_156 4))) (or (= (select (select .cse38 v_arrayElimCell_155) .cse39) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse40 .cse39))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse40 .cse34))))))) (.cse3 (and .cse4 .cse9 .cse14 .cse22)) (.cse16 (and .cse10 .cse11 .cse13 .cse14 .cse18 .cse19)) (.cse15 (and .cse4 .cse12 .cse14 .cse17)) (.cse24 (let ((.cse32 (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse34)) (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (let ((.cse37 (select .cse36 v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 .cse34)) (= (select .cse37 (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (.cse29 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969) v_arrayElimCell_155) (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|))) (.cse30 (forall ((v_arrayElimCell_155 Int) (v_ArrVal_2960 (Array Int Int)) (v_arrayElimCell_156 Int) (v_ArrVal_2969 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969) v_arrayElimCell_155))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 .cse34)) (= (select .cse35 (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (let ((.cse31 (and .cse29 .cse30)) (.cse28 (and (forall ((v_ArrVal_2960 (Array Int Int)) (v_ArrVal_2969 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2960) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2969))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse33 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse34)) (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_156 Int)) (= (select (select .cse33 v_arrayElimCell_155) (+ v_arrayElimCell_156 4)) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse32))) (and (or .cse1 .cse28) (or .cse2 (and .cse29 .cse30 (or .cse1 .cse31))) (or (and .cse29 .cse30 (or .cse2 .cse31)) .cse1) (or .cse2 .cse28) .cse32 .cse7)))) (.cse20 (or .cse25 .cse26 .cse27))) (and (or .cse0 .cse1) (or .cse2 .cse3) .cse4 (or .cse0 .cse2) (or .cse5 (let ((.cse6 (and .cse4 .cse8 .cse9))) (and .cse4 (or .cse6 .cse2) (or .cse1 .cse6) .cse7))) (or .cse2 (and .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 (or .cse15 .cse1) (or .cse1 .cse16) .cse17 .cse18 .cse19 .cse20)) (or (let ((.cse21 (and .cse4 .cse8 .cse22))) (and .cse4 (or .cse1 .cse21) (or .cse21 .cse2) .cse7)) .cse23) (or .cse5 .cse24) (or .cse1 .cse3) (or .cse1 (and .cse4 .cse10 .cse11 (or .cse2 .cse16) .cse12 .cse13 .cse14 (or .cse15 .cse2) .cse17 .cse18 .cse19 .cse20)) .cse14 (or .cse24 .cse23) .cse20 .cse7))))) is different from false [2023-02-14 13:57:05,113 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 122 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:57:16,818 WARN L233 SmtUtils]: Spent 8.56s on a formula simplification. DAG size of input: 123 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:57:26,173 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 124 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:57:40,281 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 132 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:58:03,525 WARN L233 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 133 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:58:13,439 WARN L233 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 134 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:58:49,936 WARN L233 SmtUtils]: Spent 27.60s on a formula simplification. DAG size of input: 532 DAG size of output: 433 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-14 13:58:49,937 INFO L321 Elim1Store]: treesize reduction 396, result has 63.7 percent of original size [2023-02-14 13:58:49,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 33 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 33 new quantified variables, introduced 66 case distinctions, treesize of input 6357 treesize of output 10857 [2023-02-14 13:59:02,267 INFO L217 Elim1Store]: Index analysis took 7772 ms [2023-02-14 13:59:12,035 WARN L233 SmtUtils]: Spent 9.74s on a formula simplification. DAG size of input: 772 DAG size of output: 39 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-14 13:59:12,036 INFO L321 Elim1Store]: treesize reduction 2235, result has 2.5 percent of original size [2023-02-14 13:59:12,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 32 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 102 case distinctions, treesize of input 18900 treesize of output 22512 [2023-02-14 13:59:13,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:13,944 INFO L350 Elim1Store]: Elim1 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 18359 treesize of output 17848 [2023-02-14 13:59:15,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:59:15,867 INFO L350 Elim1Store]: Elim1 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 17839 treesize of output 17588 [2023-02-14 13:59:48,509 INFO L217 Elim1Store]: Index analysis took 1236 ms