./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.0.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 ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:43:19,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:43:19,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:43:19,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:43:19,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:43:19,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:43:19,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:43:19,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:43:19,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:43:19,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:43:19,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:43:19,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:43:19,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:43:19,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:43:19,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:43:19,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:43:19,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:43:19,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:43:19,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:43:19,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:43:19,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:43:19,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:43:19,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:43:19,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:43:19,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:43:19,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:43:19,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:43:19,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:43:19,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:43:19,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:43:19,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:43:19,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:43:19,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:43:19,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:43:19,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:43:19,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:43:19,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:43:19,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:43:19,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:43:19,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:43:19,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:43:19,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 01:43:20,008 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:43:20,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:43:20,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:43:20,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:43:20,009 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:43:20,009 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:43:20,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:43:20,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:43:20,010 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:43:20,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:43:20,011 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:43:20,011 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:43:20,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:43:20,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:43:20,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:43:20,012 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:43:20,012 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:43:20,012 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:43:20,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:43:20,012 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:43:20,012 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:43:20,013 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:43:20,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:43:20,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:43:20,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:43:20,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:43:20,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:43:20,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:43:20,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:43:20,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:43:20,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:43:20,014 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:43:20,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:43:20,015 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:43:20,015 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 -> ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea [2023-02-14 01:43:20,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:43:20,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:43:20,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:43:20,216 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:43:20,216 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:43:20,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.0.i [2023-02-14 01:43:21,286 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:43:21,488 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:43:21,488 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.0.i [2023-02-14 01:43:21,498 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706a238ed/3e4501260c254839a67351ca53584f24/FLAGe3a64f7aa [2023-02-14 01:43:21,515 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706a238ed/3e4501260c254839a67351ca53584f24 [2023-02-14 01:43:21,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:43:21,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:43:21,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:43:21,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:43:21,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:43:21,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8b3c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21, skipping insertion in model container [2023-02-14 01:43:21,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:43:21,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:43:21,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:43:21,844 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:43:21,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:43:21,885 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:43:21,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21 WrapperNode [2023-02-14 01:43:21,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:43:21,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:43:21,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:43:21,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:43:21,891 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:43:21" (1/1) ... [2023-02-14 01:43:21,901 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:43:21" (1/1) ... [2023-02-14 01:43:21,915 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2023-02-14 01:43:21,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:43:21,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:43:21,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:43:21,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:43:21,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,941 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:43:21,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:43:21,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:43:21,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:43:21,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (1/1) ... [2023-02-14 01:43:21,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:43:21,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:21,985 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 01:43:21,997 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 01:43:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 01:43:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 01:43:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 01:43:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 01:43:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 01:43:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 01:43:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:43:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 01:43:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:43:22,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:43:22,115 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:43:22,116 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:43:22,383 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:43:22,388 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:43:22,388 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 01:43:22,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:43:22 BoogieIcfgContainer [2023-02-14 01:43:22,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:43:22,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:43:22,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:43:22,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:43:22,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:43:21" (1/3) ... [2023-02-14 01:43:22,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b966815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:43:22, skipping insertion in model container [2023-02-14 01:43:22,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:43:21" (2/3) ... [2023-02-14 01:43:22,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b966815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:43:22, skipping insertion in model container [2023-02-14 01:43:22,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:43:22" (3/3) ... [2023-02-14 01:43:22,397 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.0.i [2023-02-14 01:43:22,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:43:22,414 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-02-14 01:43:22,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:43:22,460 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;@5d5141e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:43:22,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-02-14 01:43:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 01:43:22,468 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:22,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 01:43:22,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2023-02-14 01:43:22,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:22,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036768517] [2023-02-14 01:43:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:22,590 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 01:43:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:22,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036768517] [2023-02-14 01:43:22,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036768517] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:22,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:22,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:43:22,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910788558] [2023-02-14 01:43:22,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:22,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 01:43:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:22,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 01:43:22,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 01:43:22,617 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:22,628 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2023-02-14 01:43:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 01:43:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 01:43:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:22,635 INFO L225 Difference]: With dead ends: 64 [2023-02-14 01:43:22,635 INFO L226 Difference]: Without dead ends: 62 [2023-02-14 01:43:22,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 01:43:22,639 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:22,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-14 01:43:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-02-14 01:43:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-02-14 01:43:22,663 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2023-02-14 01:43:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:22,663 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-02-14 01:43:22,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-02-14 01:43:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 01:43:22,664 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:22,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:22,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 01:43:22,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2023-02-14 01:43:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:22,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471257450] [2023-02-14 01:43:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:22,707 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 01:43:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:22,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471257450] [2023-02-14 01:43:22,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471257450] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:22,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:22,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:43:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190090886] [2023-02-14 01:43:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:22,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:43:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:43:22,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:43:22,711 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:22,722 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2023-02-14 01:43:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:43:22,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 01:43:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:22,723 INFO L225 Difference]: With dead ends: 63 [2023-02-14 01:43:22,723 INFO L226 Difference]: Without dead ends: 63 [2023-02-14 01:43:22,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 01:43:22,725 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:22,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-14 01:43:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-14 01:43:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2023-02-14 01:43:22,730 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2023-02-14 01:43:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:22,730 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2023-02-14 01:43:22,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2023-02-14 01:43:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 01:43:22,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:22,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:22,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 01:43:22,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:22,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2023-02-14 01:43:22,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:22,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871323982] [2023-02-14 01:43:22,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:22,796 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 01:43:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:22,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871323982] [2023-02-14 01:43:22,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871323982] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:22,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:22,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:43:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065395346] [2023-02-14 01:43:22,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:22,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:43:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:43:22,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:43:22,800 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:22,828 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2023-02-14 01:43:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:43:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 01:43:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:22,830 INFO L225 Difference]: With dead ends: 111 [2023-02-14 01:43:22,830 INFO L226 Difference]: Without dead ends: 111 [2023-02-14 01:43:22,830 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 01:43:22,831 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:22,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-14 01:43:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2023-02-14 01:43:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2023-02-14 01:43:22,851 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2023-02-14 01:43:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:22,851 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2023-02-14 01:43:22,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2023-02-14 01:43:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 01:43:22,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:22,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:22,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 01:43:22,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2023-02-14 01:43:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:22,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591034661] [2023-02-14 01:43:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:22,978 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 01:43:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591034661] [2023-02-14 01:43:22,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591034661] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:22,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:22,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:43:22,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156897979] [2023-02-14 01:43:22,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:22,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:43:22,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:22,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:43:22,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:43:22,981 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:23,035 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2023-02-14 01:43:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:43:23,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-14 01:43:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:23,037 INFO L225 Difference]: With dead ends: 101 [2023-02-14 01:43:23,037 INFO L226 Difference]: Without dead ends: 101 [2023-02-14 01:43:23,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:43:23,038 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:23,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 211 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-14 01:43:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2023-02-14 01:43:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2023-02-14 01:43:23,044 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2023-02-14 01:43:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:23,044 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2023-02-14 01:43:23,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2023-02-14 01:43:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 01:43:23,045 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:23,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:23,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 01:43:23,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2023-02-14 01:43:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:23,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085385954] [2023-02-14 01:43:23,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:23,085 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 01:43:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:23,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085385954] [2023-02-14 01:43:23,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085385954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:23,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:23,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:43:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448085559] [2023-02-14 01:43:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:23,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:43:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:23,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:43:23,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:43:23,087 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:23,131 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2023-02-14 01:43:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:43:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-14 01:43:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:23,133 INFO L225 Difference]: With dead ends: 177 [2023-02-14 01:43:23,133 INFO L226 Difference]: Without dead ends: 174 [2023-02-14 01:43:23,133 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 01:43:23,134 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:23,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-14 01:43:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2023-02-14 01:43:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2023-02-14 01:43:23,148 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 8 [2023-02-14 01:43:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:23,149 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2023-02-14 01:43:23,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2023-02-14 01:43:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 01:43:23,149 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:23,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:23,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 01:43:23,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2023-02-14 01:43:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:23,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135183453] [2023-02-14 01:43:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:23,194 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 01:43:23,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:23,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135183453] [2023-02-14 01:43:23,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135183453] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:23,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:23,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:43:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025896933] [2023-02-14 01:43:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:23,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:43:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:23,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:43:23,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:43:23,197 INFO L87 Difference]: Start difference. First operand 153 states and 246 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:23,254 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2023-02-14 01:43:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:43:23,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-14 01:43:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:23,258 INFO L225 Difference]: With dead ends: 231 [2023-02-14 01:43:23,258 INFO L226 Difference]: Without dead ends: 231 [2023-02-14 01:43:23,259 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 01:43:23,261 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 69 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:23,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-02-14 01:43:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 208. [2023-02-14 01:43:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.7894736842105263) internal successors, (340), 207 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 340 transitions. [2023-02-14 01:43:23,279 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 340 transitions. Word has length 8 [2023-02-14 01:43:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:23,280 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 340 transitions. [2023-02-14 01:43:23,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2023-02-14 01:43:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 01:43:23,280 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:23,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:23,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 01:43:23,281 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2023-02-14 01:43:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:23,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257091348] [2023-02-14 01:43:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:23,334 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 01:43:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:23,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257091348] [2023-02-14 01:43:23,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257091348] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:23,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:23,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:43:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671818738] [2023-02-14 01:43:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:23,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:43:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:23,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:43:23,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:43:23,339 INFO L87 Difference]: Start difference. First operand 208 states and 340 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:23,370 INFO L93 Difference]: Finished difference Result 226 states and 346 transitions. [2023-02-14 01:43:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:43:23,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-14 01:43:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:23,371 INFO L225 Difference]: With dead ends: 226 [2023-02-14 01:43:23,371 INFO L226 Difference]: Without dead ends: 226 [2023-02-14 01:43:23,371 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 01:43:23,373 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 68 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:23,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 180 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-14 01:43:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2023-02-14 01:43:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.7473684210526317) internal successors, (332), 205 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 332 transitions. [2023-02-14 01:43:23,404 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 332 transitions. Word has length 8 [2023-02-14 01:43:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:23,404 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 332 transitions. [2023-02-14 01:43:23,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 332 transitions. [2023-02-14 01:43:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 01:43:23,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:23,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:23,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 01:43:23,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2023-02-14 01:43:23,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:23,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793083456] [2023-02-14 01:43:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:23,434 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 01:43:23,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:23,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793083456] [2023-02-14 01:43:23,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793083456] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:23,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:23,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:43:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432632324] [2023-02-14 01:43:23,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:23,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:43:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:43:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:43:23,437 INFO L87 Difference]: Start difference. First operand 206 states and 332 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:23,464 INFO L93 Difference]: Finished difference Result 265 states and 366 transitions. [2023-02-14 01:43:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:43:23,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-14 01:43:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:23,465 INFO L225 Difference]: With dead ends: 265 [2023-02-14 01:43:23,465 INFO L226 Difference]: Without dead ends: 265 [2023-02-14 01:43:23,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:43:23,468 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:23,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 279 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-02-14 01:43:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2023-02-14 01:43:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.6821192052980132) internal successors, (254), 162 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2023-02-14 01:43:23,476 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 9 [2023-02-14 01:43:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:23,476 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2023-02-14 01:43:23,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2023-02-14 01:43:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 01:43:23,480 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:23,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:23,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 01:43:23,480 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2023-02-14 01:43:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:23,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441271578] [2023-02-14 01:43:23,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:23,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:23,525 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 01:43:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:23,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441271578] [2023-02-14 01:43:23,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441271578] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:23,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:23,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:43:23,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122740335] [2023-02-14 01:43:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:23,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:43:23,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:43:23,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:43:23,536 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:23,561 INFO L93 Difference]: Finished difference Result 362 states and 528 transitions. [2023-02-14 01:43:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:43:23,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 01:43:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:23,563 INFO L225 Difference]: With dead ends: 362 [2023-02-14 01:43:23,563 INFO L226 Difference]: Without dead ends: 362 [2023-02-14 01:43:23,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:43:23,564 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:23,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 232 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-02-14 01:43:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 234. [2023-02-14 01:43:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 222 states have (on average 1.6036036036036037) internal successors, (356), 233 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2023-02-14 01:43:23,570 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 10 [2023-02-14 01:43:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:23,570 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2023-02-14 01:43:23,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2023-02-14 01:43:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:43:23,572 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:23,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:23,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 01:43:23,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:23,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2023-02-14 01:43:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:23,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181181654] [2023-02-14 01:43:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:23,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181181654] [2023-02-14 01:43:23,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181181654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:23,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608892498] [2023-02-14 01:43:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:23,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:23,651 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 01:43:23,652 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 01:43:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:23,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:43:23,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:23,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:23,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608892498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:23,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:23,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-14 01:43:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508794052] [2023-02-14 01:43:23,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:23,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:43:23,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:43:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:43:23,798 INFO L87 Difference]: Start difference. First operand 234 states and 356 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:23,841 INFO L93 Difference]: Finished difference Result 238 states and 346 transitions. [2023-02-14 01:43:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:43:23,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 01:43:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:23,843 INFO L225 Difference]: With dead ends: 238 [2023-02-14 01:43:23,843 INFO L226 Difference]: Without dead ends: 238 [2023-02-14 01:43:23,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:43:23,844 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 139 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:23,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 338 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-14 01:43:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2023-02-14 01:43:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 218 states have (on average 1.5779816513761469) internal successors, (344), 229 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 344 transitions. [2023-02-14 01:43:23,849 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 344 transitions. Word has length 16 [2023-02-14 01:43:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:23,850 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 344 transitions. [2023-02-14 01:43:23,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 344 transitions. [2023-02-14 01:43:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:43:23,851 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:23,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:23,860 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 01:43:24,058 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,SelfDestructingSolverStorable9 [2023-02-14 01:43:24,059 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2023-02-14 01:43:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:24,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996592622] [2023-02-14 01:43:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:24,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996592622] [2023-02-14 01:43:24,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996592622] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:24,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296306346] [2023-02-14 01:43:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:24,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:24,105 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 01:43:24,107 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 01:43:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:24,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:43:24,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:24,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:24,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296306346] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:24,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:24,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-14 01:43:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804748773] [2023-02-14 01:43:24,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:24,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:43:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:24,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:43:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:43:24,234 INFO L87 Difference]: Start difference. First operand 230 states and 344 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:24,307 INFO L93 Difference]: Finished difference Result 525 states and 738 transitions. [2023-02-14 01:43:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:43:24,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 01:43:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:24,310 INFO L225 Difference]: With dead ends: 525 [2023-02-14 01:43:24,310 INFO L226 Difference]: Without dead ends: 525 [2023-02-14 01:43:24,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:43:24,311 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 207 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:24,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 528 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-02-14 01:43:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 323. [2023-02-14 01:43:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.5305466237942122) internal successors, (476), 322 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2023-02-14 01:43:24,317 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 16 [2023-02-14 01:43:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:24,317 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2023-02-14 01:43:24,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2023-02-14 01:43:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 01:43:24,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:24,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:24,328 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 01:43:24,526 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,SelfDestructingSolverStorable10 [2023-02-14 01:43:24,526 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:24,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1134377974, now seen corresponding path program 2 times [2023-02-14 01:43:24,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:24,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735793912] [2023-02-14 01:43:24,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:24,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 01:43:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:24,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735793912] [2023-02-14 01:43:24,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735793912] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:24,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801449579] [2023-02-14 01:43:24,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:43:24,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:24,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:24,596 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 01:43:24,633 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 01:43:24,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:43:24,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:43:24,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:43:24,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:24,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:24,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801449579] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:24,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:24,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2023-02-14 01:43:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103949881] [2023-02-14 01:43:24,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:24,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:43:24,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:24,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:43:24,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:43:24,724 INFO L87 Difference]: Start difference. First operand 323 states and 476 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:24,797 INFO L93 Difference]: Finished difference Result 525 states and 726 transitions. [2023-02-14 01:43:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:43:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-14 01:43:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:24,800 INFO L225 Difference]: With dead ends: 525 [2023-02-14 01:43:24,800 INFO L226 Difference]: Without dead ends: 525 [2023-02-14 01:43:24,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-02-14 01:43:24,800 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 390 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:24,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 420 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-02-14 01:43:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 323. [2023-02-14 01:43:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.4919614147909968) internal successors, (464), 322 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 464 transitions. [2023-02-14 01:43:24,808 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 464 transitions. Word has length 22 [2023-02-14 01:43:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:24,808 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 464 transitions. [2023-02-14 01:43:24,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 464 transitions. [2023-02-14 01:43:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 01:43:24,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:24,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:24,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:25,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:25,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:25,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:25,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2023-02-14 01:43:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:25,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032144438] [2023-02-14 01:43:25,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:25,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:25,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:25,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032144438] [2023-02-14 01:43:25,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032144438] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:25,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567282071] [2023-02-14 01:43:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:25,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:25,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:25,086 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 01:43:25,088 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 01:43:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:25,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:43:25,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:25,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:25,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567282071] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:25,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:25,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-14 01:43:25,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842451757] [2023-02-14 01:43:25,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:25,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:43:25,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:43:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:43:25,230 INFO L87 Difference]: Start difference. First operand 323 states and 464 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:25,274 INFO L93 Difference]: Finished difference Result 936 states and 1334 transitions. [2023-02-14 01:43:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:43:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-14 01:43:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:25,277 INFO L225 Difference]: With dead ends: 936 [2023-02-14 01:43:25,278 INFO L226 Difference]: Without dead ends: 936 [2023-02-14 01:43:25,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:43:25,279 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 180 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:25,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 167 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2023-02-14 01:43:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 811. [2023-02-14 01:43:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 799 states have (on average 1.4793491864831039) internal successors, (1182), 810 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1182 transitions. [2023-02-14 01:43:25,290 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1182 transitions. Word has length 24 [2023-02-14 01:43:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:25,291 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1182 transitions. [2023-02-14 01:43:25,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1182 transitions. [2023-02-14 01:43:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:43:25,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:25,292 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:25,301 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 01:43:25,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:25,507 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:25,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:25,507 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2023-02-14 01:43:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:25,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223041495] [2023-02-14 01:43:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:25,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:25,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223041495] [2023-02-14 01:43:25,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223041495] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:25,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908669951] [2023-02-14 01:43:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:25,577 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 01:43:25,579 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 01:43:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:25,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:43:25,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:25,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:25,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908669951] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:25,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:25,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-02-14 01:43:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649463079] [2023-02-14 01:43:25,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:25,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:43:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:43:25,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:43:25,693 INFO L87 Difference]: Start difference. First operand 811 states and 1182 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:25,787 INFO L93 Difference]: Finished difference Result 2807 states and 3858 transitions. [2023-02-14 01:43:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:43:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 01:43:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:25,794 INFO L225 Difference]: With dead ends: 2807 [2023-02-14 01:43:25,795 INFO L226 Difference]: Without dead ends: 2807 [2023-02-14 01:43:25,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-02-14 01:43:25,795 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 557 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:25,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 583 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2023-02-14 01:43:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 1879. [2023-02-14 01:43:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1867 states have (on average 1.432244242099625) internal successors, (2674), 1878 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2674 transitions. [2023-02-14 01:43:25,824 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2674 transitions. Word has length 27 [2023-02-14 01:43:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:25,824 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2674 transitions. [2023-02-14 01:43:25,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2674 transitions. [2023-02-14 01:43:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:43:25,825 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:25,825 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:25,832 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 01:43:26,030 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,SelfDestructingSolverStorable13 [2023-02-14 01:43:26,031 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash 554127938, now seen corresponding path program 1 times [2023-02-14 01:43:26,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:26,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774922024] [2023-02-14 01:43:26,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:43:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:26,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774922024] [2023-02-14 01:43:26,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774922024] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:26,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862140436] [2023-02-14 01:43:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:26,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:26,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:26,097 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 01:43:26,099 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 01:43:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:26,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:43:26,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:43:26,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:43:26,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862140436] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:26,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:26,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-02-14 01:43:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776776826] [2023-02-14 01:43:26,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:26,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:43:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:26,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:43:26,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:43:26,234 INFO L87 Difference]: Start difference. First operand 1879 states and 2674 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:26,283 INFO L93 Difference]: Finished difference Result 1558 states and 2125 transitions. [2023-02-14 01:43:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:43:26,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 01:43:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:26,288 INFO L225 Difference]: With dead ends: 1558 [2023-02-14 01:43:26,288 INFO L226 Difference]: Without dead ends: 1558 [2023-02-14 01:43:26,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:43:26,289 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 376 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:26,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 520 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2023-02-14 01:43:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 885. [2023-02-14 01:43:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 873 states have (on average 1.404352806414662) internal successors, (1226), 884 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1226 transitions. [2023-02-14 01:43:26,302 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1226 transitions. Word has length 27 [2023-02-14 01:43:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:26,303 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1226 transitions. [2023-02-14 01:43:26,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1226 transitions. [2023-02-14 01:43:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 01:43:26,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:26,304 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:26,311 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 01:43:26,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 01:43:26,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2023-02-14 01:43:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:26,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907082685] [2023-02-14 01:43:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-14 01:43:26,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:26,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907082685] [2023-02-14 01:43:26,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907082685] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:26,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356887806] [2023-02-14 01:43:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:26,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:26,601 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 01:43:26,603 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 01:43:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:26,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:43:26,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:26,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:43:26,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356887806] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:26,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:26,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2023-02-14 01:43:26,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487499820] [2023-02-14 01:43:26,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:26,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 01:43:26,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:26,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 01:43:26,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:43:26,807 INFO L87 Difference]: Start difference. First operand 885 states and 1226 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:27,047 INFO L93 Difference]: Finished difference Result 2448 states and 3223 transitions. [2023-02-14 01:43:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 01:43:27,048 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-14 01:43:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:27,053 INFO L225 Difference]: With dead ends: 2448 [2023-02-14 01:43:27,054 INFO L226 Difference]: Without dead ends: 2448 [2023-02-14 01:43:27,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2023-02-14 01:43:27,055 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1395 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:27,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 811 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2023-02-14 01:43:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 984. [2023-02-14 01:43:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 972 states have (on average 1.4207818930041152) internal successors, (1381), 983 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1381 transitions. [2023-02-14 01:43:27,073 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1381 transitions. Word has length 51 [2023-02-14 01:43:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:27,073 INFO L495 AbstractCegarLoop]: Abstraction has 984 states and 1381 transitions. [2023-02-14 01:43:27,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1381 transitions. [2023-02-14 01:43:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-14 01:43:27,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:27,074 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:27,091 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 01:43:27,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:27,282 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:27,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2023-02-14 01:43:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:27,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416941176] [2023-02-14 01:43:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-14 01:43:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416941176] [2023-02-14 01:43:27,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416941176] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992694270] [2023-02-14 01:43:27,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:27,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:27,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:27,372 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 01:43:27,374 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 01:43:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:27,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:43:27,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-14 01:43:27,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-14 01:43:27,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992694270] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:27,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:43:27,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2023-02-14 01:43:27,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356031606] [2023-02-14 01:43:27,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:27,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:43:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:27,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:43:27,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:43:27,525 INFO L87 Difference]: Start difference. First operand 984 states and 1381 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:27,613 INFO L93 Difference]: Finished difference Result 2310 states and 3137 transitions. [2023-02-14 01:43:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:43:27,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-02-14 01:43:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:27,619 INFO L225 Difference]: With dead ends: 2310 [2023-02-14 01:43:27,619 INFO L226 Difference]: Without dead ends: 2310 [2023-02-14 01:43:27,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-14 01:43:27,620 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 267 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:27,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 388 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2023-02-14 01:43:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1632. [2023-02-14 01:43:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1620 states have (on average 1.3962962962962964) internal successors, (2262), 1631 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2262 transitions. [2023-02-14 01:43:27,643 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2262 transitions. Word has length 59 [2023-02-14 01:43:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:27,643 INFO L495 AbstractCegarLoop]: Abstraction has 1632 states and 2262 transitions. [2023-02-14 01:43:27,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2262 transitions. [2023-02-14 01:43:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-14 01:43:27,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:27,645 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:27,650 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 01:43:27,850 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,SelfDestructingSolverStorable16 [2023-02-14 01:43:27,851 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:27,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:27,851 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2023-02-14 01:43:27,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:27,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987868069] [2023-02-14 01:43:27,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:27,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-14 01:43:27,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987868069] [2023-02-14 01:43:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987868069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004108785] [2023-02-14 01:43:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:27,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:27,939 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 01:43:27,939 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 01:43:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:28,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:43:28,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-14 01:43:28,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-14 01:43:28,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004108785] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:28,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:28,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2023-02-14 01:43:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015581931] [2023-02-14 01:43:28,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:28,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:43:28,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:43:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:43:28,094 INFO L87 Difference]: Start difference. First operand 1632 states and 2262 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:28,958 INFO L93 Difference]: Finished difference Result 9168 states and 12495 transitions. [2023-02-14 01:43:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-14 01:43:28,958 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-02-14 01:43:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:28,982 INFO L225 Difference]: With dead ends: 9168 [2023-02-14 01:43:28,982 INFO L226 Difference]: Without dead ends: 9168 [2023-02-14 01:43:28,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2023-02-14 01:43:28,984 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 1527 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:28,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 717 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:43:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9168 states. [2023-02-14 01:43:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9168 to 4625. [2023-02-14 01:43:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 4614 states have (on average 1.4195925444299957) internal successors, (6550), 4624 states have internal predecessors, (6550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6550 transitions. [2023-02-14 01:43:29,067 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6550 transitions. Word has length 59 [2023-02-14 01:43:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:29,068 INFO L495 AbstractCegarLoop]: Abstraction has 4625 states and 6550 transitions. [2023-02-14 01:43:29,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6550 transitions. [2023-02-14 01:43:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-14 01:43:29,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:29,069 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:29,075 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 01:43:29,275 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,SelfDestructingSolverStorable17 [2023-02-14 01:43:29,275 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:29,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2023-02-14 01:43:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:29,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215369745] [2023-02-14 01:43:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-14 01:43:29,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:29,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215369745] [2023-02-14 01:43:29,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215369745] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:29,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027067360] [2023-02-14 01:43:29,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:29,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:29,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:29,411 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 01:43:29,426 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 01:43:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:29,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:43:29,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 01:43:29,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 01:43:29,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027067360] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:29,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:29,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2023-02-14 01:43:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189287216] [2023-02-14 01:43:29,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:29,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:43:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:29,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:43:29,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:43:29,623 INFO L87 Difference]: Start difference. First operand 4625 states and 6550 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:30,049 INFO L93 Difference]: Finished difference Result 10247 states and 14121 transitions. [2023-02-14 01:43:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-14 01:43:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-02-14 01:43:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:30,090 INFO L225 Difference]: With dead ends: 10247 [2023-02-14 01:43:30,090 INFO L226 Difference]: Without dead ends: 10247 [2023-02-14 01:43:30,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2023-02-14 01:43:30,091 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 1095 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:30,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1379 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2023-02-14 01:43:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 4425. [2023-02-14 01:43:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 4414 states have (on average 1.3948799275033983) internal successors, (6157), 4424 states have internal predecessors, (6157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 6157 transitions. [2023-02-14 01:43:30,163 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 6157 transitions. Word has length 63 [2023-02-14 01:43:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:30,164 INFO L495 AbstractCegarLoop]: Abstraction has 4425 states and 6157 transitions. [2023-02-14 01:43:30,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 6157 transitions. [2023-02-14 01:43:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-14 01:43:30,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:30,165 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 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] [2023-02-14 01:43:30,176 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 01:43:30,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:30,371 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2023-02-14 01:43:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:30,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601884319] [2023-02-14 01:43:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-14 01:43:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:30,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601884319] [2023-02-14 01:43:30,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601884319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:30,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494090608] [2023-02-14 01:43:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:30,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:30,463 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 01:43:30,465 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 01:43:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:30,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:43:30,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-14 01:43:30,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-14 01:43:30,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494090608] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:30,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:30,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-02-14 01:43:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865301608] [2023-02-14 01:43:30,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:30,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:43:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:30,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:43:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:43:30,671 INFO L87 Difference]: Start difference. First operand 4425 states and 6157 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:30,895 INFO L93 Difference]: Finished difference Result 3827 states and 5012 transitions. [2023-02-14 01:43:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 01:43:30,896 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-02-14 01:43:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:30,901 INFO L225 Difference]: With dead ends: 3827 [2023-02-14 01:43:30,901 INFO L226 Difference]: Without dead ends: 3827 [2023-02-14 01:43:30,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2023-02-14 01:43:30,902 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 603 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:30,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2060 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2023-02-14 01:43:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2865. [2023-02-14 01:43:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2854 states have (on average 1.3135949544498948) internal successors, (3749), 2864 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3749 transitions. [2023-02-14 01:43:30,942 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3749 transitions. Word has length 63 [2023-02-14 01:43:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:30,943 INFO L495 AbstractCegarLoop]: Abstraction has 2865 states and 3749 transitions. [2023-02-14 01:43:30,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3749 transitions. [2023-02-14 01:43:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-14 01:43:30,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:30,944 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:30,950 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 01:43:31,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:31,149 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2023-02-14 01:43:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:31,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89539936] [2023-02-14 01:43:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-14 01:43:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89539936] [2023-02-14 01:43:31,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89539936] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781952815] [2023-02-14 01:43:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:31,209 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 01:43:31,211 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 01:43:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:31,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:43:31,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-14 01:43:31,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-14 01:43:31,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781952815] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:31,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:31,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-02-14 01:43:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330695445] [2023-02-14 01:43:31,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:31,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:43:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:31,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:43:31,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:43:31,386 INFO L87 Difference]: Start difference. First operand 2865 states and 3749 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:31,443 INFO L93 Difference]: Finished difference Result 2863 states and 3720 transitions. [2023-02-14 01:43:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:43:31,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-02-14 01:43:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:31,447 INFO L225 Difference]: With dead ends: 2863 [2023-02-14 01:43:31,447 INFO L226 Difference]: Without dead ends: 2863 [2023-02-14 01:43:31,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:43:31,448 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 110 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:31,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 256 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2023-02-14 01:43:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2854. [2023-02-14 01:43:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2843 states have (on average 1.307069996482589) internal successors, (3716), 2853 states have internal predecessors, (3716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3716 transitions. [2023-02-14 01:43:31,494 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3716 transitions. Word has length 64 [2023-02-14 01:43:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:31,494 INFO L495 AbstractCegarLoop]: Abstraction has 2854 states and 3716 transitions. [2023-02-14 01:43:31,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3716 transitions. [2023-02-14 01:43:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 01:43:31,495 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:31,495 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:31,503 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 01:43:31,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-14 01:43:31,703 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1737502264, now seen corresponding path program 1 times [2023-02-14 01:43:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:31,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121014555] [2023-02-14 01:43:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-14 01:43:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121014555] [2023-02-14 01:43:31,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121014555] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485914674] [2023-02-14 01:43:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:31,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:31,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:31,829 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 01:43:31,831 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 01:43:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:31,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:43:31,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-14 01:43:31,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-14 01:43:32,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485914674] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:32,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:32,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2023-02-14 01:43:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840813097] [2023-02-14 01:43:32,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:32,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:43:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:32,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:43:32,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:43:32,054 INFO L87 Difference]: Start difference. First operand 2854 states and 3716 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:32,273 INFO L93 Difference]: Finished difference Result 3939 states and 5165 transitions. [2023-02-14 01:43:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 01:43:32,273 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-02-14 01:43:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:32,278 INFO L225 Difference]: With dead ends: 3939 [2023-02-14 01:43:32,278 INFO L226 Difference]: Without dead ends: 3939 [2023-02-14 01:43:32,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2023-02-14 01:43:32,279 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 356 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:32,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 778 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2023-02-14 01:43:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2136. [2023-02-14 01:43:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2125 states have (on average 1.3035294117647058) internal successors, (2770), 2135 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2770 transitions. [2023-02-14 01:43:32,307 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2770 transitions. Word has length 65 [2023-02-14 01:43:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:32,307 INFO L495 AbstractCegarLoop]: Abstraction has 2136 states and 2770 transitions. [2023-02-14 01:43:32,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2770 transitions. [2023-02-14 01:43:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-14 01:43:32,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:32,308 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:32,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:32,513 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,SelfDestructingSolverStorable21 [2023-02-14 01:43:32,514 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1937207539, now seen corresponding path program 1 times [2023-02-14 01:43:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:32,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091483182] [2023-02-14 01:43:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-14 01:43:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:32,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091483182] [2023-02-14 01:43:32,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091483182] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:32,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256629130] [2023-02-14 01:43:32,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:32,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:32,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:32,640 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 01:43:32,643 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 01:43:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:32,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:43:32,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:32,746 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 01:43:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-14 01:43:32,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-14 01:43:33,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256629130] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:33,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:33,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-02-14 01:43:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943976045] [2023-02-14 01:43:33,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:33,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:43:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:33,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:43:33,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:43:33,104 INFO L87 Difference]: Start difference. First operand 2136 states and 2770 transitions. Second operand has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:33,341 INFO L93 Difference]: Finished difference Result 4146 states and 5271 transitions. [2023-02-14 01:43:33,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:43:33,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2023-02-14 01:43:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:33,346 INFO L225 Difference]: With dead ends: 4146 [2023-02-14 01:43:33,346 INFO L226 Difference]: Without dead ends: 4146 [2023-02-14 01:43:33,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:43:33,347 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 523 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:33,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 624 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:43:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2023-02-14 01:43:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 3102. [2023-02-14 01:43:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3102 states, 3091 states have (on average 1.3154318990617924) internal successors, (4066), 3101 states have internal predecessors, (4066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4066 transitions. [2023-02-14 01:43:33,379 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 4066 transitions. Word has length 69 [2023-02-14 01:43:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:33,380 INFO L495 AbstractCegarLoop]: Abstraction has 3102 states and 4066 transitions. [2023-02-14 01:43:33,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 4066 transitions. [2023-02-14 01:43:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-02-14 01:43:33,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:33,381 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 8, 6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:33,389 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 01:43:33,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:33,589 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1779624174, now seen corresponding path program 1 times [2023-02-14 01:43:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:33,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307851687] [2023-02-14 01:43:33,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:33,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2023-02-14 01:43:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:33,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307851687] [2023-02-14 01:43:33,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307851687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:33,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:43:33,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:43:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806946585] [2023-02-14 01:43:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:33,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:43:33,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:43:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:43:33,700 INFO L87 Difference]: Start difference. First operand 3102 states and 4066 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:33,768 INFO L93 Difference]: Finished difference Result 6805 states and 8699 transitions. [2023-02-14 01:43:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:43:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2023-02-14 01:43:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:33,781 INFO L225 Difference]: With dead ends: 6805 [2023-02-14 01:43:33,781 INFO L226 Difference]: Without dead ends: 6805 [2023-02-14 01:43:33,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:43:33,782 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 194 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:33,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 406 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2023-02-14 01:43:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 3244. [2023-02-14 01:43:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 3233 states have (on average 1.3201360965047944) internal successors, (4268), 3243 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4268 transitions. [2023-02-14 01:43:33,840 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4268 transitions. Word has length 88 [2023-02-14 01:43:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:33,841 INFO L495 AbstractCegarLoop]: Abstraction has 3244 states and 4268 transitions. [2023-02-14 01:43:33,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4268 transitions. [2023-02-14 01:43:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-02-14 01:43:33,843 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:33,843 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:33,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-14 01:43:33,844 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash -93068261, now seen corresponding path program 1 times [2023-02-14 01:43:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:33,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287477774] [2023-02-14 01:43:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 61 proven. 147 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-02-14 01:43:33,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:33,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287477774] [2023-02-14 01:43:33,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287477774] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818693132] [2023-02-14 01:43:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:33,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:33,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:33,980 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 01:43:34,020 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 01:43:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:34,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:43:34,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2023-02-14 01:43:34,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:43:34,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818693132] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:43:34,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:43:34,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2023-02-14 01:43:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781924614] [2023-02-14 01:43:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:34,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:43:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:43:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:43:34,137 INFO L87 Difference]: Start difference. First operand 3244 states and 4268 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:34,173 INFO L93 Difference]: Finished difference Result 3609 states and 4617 transitions. [2023-02-14 01:43:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:43:34,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-02-14 01:43:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:34,178 INFO L225 Difference]: With dead ends: 3609 [2023-02-14 01:43:34,178 INFO L226 Difference]: Without dead ends: 3609 [2023-02-14 01:43:34,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:43:34,178 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 54 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:34,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2023-02-14 01:43:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3280. [2023-02-14 01:43:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 3269 states have (on average 1.2970327317222392) internal successors, (4240), 3279 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 4240 transitions. [2023-02-14 01:43:34,206 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 4240 transitions. Word has length 96 [2023-02-14 01:43:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:34,206 INFO L495 AbstractCegarLoop]: Abstraction has 3280 states and 4240 transitions. [2023-02-14 01:43:34,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 4240 transitions. [2023-02-14 01:43:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-14 01:43:34,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:34,208 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 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 01:43:34,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:34,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:34,414 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1826247984, now seen corresponding path program 1 times [2023-02-14 01:43:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:34,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197615691] [2023-02-14 01:43:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:34,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2023-02-14 01:43:34,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:34,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197615691] [2023-02-14 01:43:34,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197615691] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:34,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814895700] [2023-02-14 01:43:34,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:34,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:34,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:34,512 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:34,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-14 01:43:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:34,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:43:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-14 01:43:34,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-14 01:43:34,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814895700] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:34,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:34,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2023-02-14 01:43:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202963267] [2023-02-14 01:43:34,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:34,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:43:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:34,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:43:34,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:43:34,744 INFO L87 Difference]: Start difference. First operand 3280 states and 4240 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:34,942 INFO L93 Difference]: Finished difference Result 3904 states and 4668 transitions. [2023-02-14 01:43:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:43:34,943 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2023-02-14 01:43:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:34,947 INFO L225 Difference]: With dead ends: 3904 [2023-02-14 01:43:34,948 INFO L226 Difference]: Without dead ends: 3904 [2023-02-14 01:43:34,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2023-02-14 01:43:34,948 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 727 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:34,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2344 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2023-02-14 01:43:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 2228. [2023-02-14 01:43:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2218 states have (on average 1.21190261496844) internal successors, (2688), 2227 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2688 transitions. [2023-02-14 01:43:34,984 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2688 transitions. Word has length 98 [2023-02-14 01:43:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:34,985 INFO L495 AbstractCegarLoop]: Abstraction has 2228 states and 2688 transitions. [2023-02-14 01:43:34,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2688 transitions. [2023-02-14 01:43:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-02-14 01:43:34,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:34,987 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:34,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:35,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-14 01:43:35,192 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -932844676, now seen corresponding path program 1 times [2023-02-14 01:43:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:35,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059657356] [2023-02-14 01:43:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:35,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:35,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059657356] [2023-02-14 01:43:35,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059657356] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:35,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165169515] [2023-02-14 01:43:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:35,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:35,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:35,282 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:35,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-14 01:43:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:35,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:43:35,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:35,398 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 01:43:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:35,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:35,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165169515] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:35,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:35,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-02-14 01:43:35,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231128316] [2023-02-14 01:43:35,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:35,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:43:35,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:35,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:43:35,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:43:35,586 INFO L87 Difference]: Start difference. First operand 2228 states and 2688 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:35,769 INFO L93 Difference]: Finished difference Result 3146 states and 3743 transitions. [2023-02-14 01:43:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 01:43:35,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-02-14 01:43:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:35,773 INFO L225 Difference]: With dead ends: 3146 [2023-02-14 01:43:35,773 INFO L226 Difference]: Without dead ends: 3146 [2023-02-14 01:43:35,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:43:35,774 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 327 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:35,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 409 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2023-02-14 01:43:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 2229. [2023-02-14 01:43:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2220 states have (on average 1.212162162162162) internal successors, (2691), 2228 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2691 transitions. [2023-02-14 01:43:35,809 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2691 transitions. Word has length 111 [2023-02-14 01:43:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:35,809 INFO L495 AbstractCegarLoop]: Abstraction has 2229 states and 2691 transitions. [2023-02-14 01:43:35,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2691 transitions. [2023-02-14 01:43:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-02-14 01:43:35,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:35,811 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:35,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:36,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-14 01:43:36,017 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash -932844675, now seen corresponding path program 1 times [2023-02-14 01:43:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:36,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130045300] [2023-02-14 01:43:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:36,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:36,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130045300] [2023-02-14 01:43:36,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130045300] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:36,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300641856] [2023-02-14 01:43:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:36,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:36,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:36,217 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:36,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-14 01:43:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:36,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:43:36,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:36,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:36,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300641856] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:36,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:36,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 16 [2023-02-14 01:43:36,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104589882] [2023-02-14 01:43:36,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:36,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 01:43:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:36,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 01:43:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-02-14 01:43:36,902 INFO L87 Difference]: Start difference. First operand 2229 states and 2691 transitions. Second operand has 17 states, 16 states have (on average 11.4375) internal successors, (183), 17 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:37,530 INFO L93 Difference]: Finished difference Result 6465 states and 7732 transitions. [2023-02-14 01:43:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 01:43:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.4375) internal successors, (183), 17 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-02-14 01:43:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:37,548 INFO L225 Difference]: With dead ends: 6465 [2023-02-14 01:43:37,548 INFO L226 Difference]: Without dead ends: 6465 [2023-02-14 01:43:37,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=374, Invalid=958, Unknown=0, NotChecked=0, Total=1332 [2023-02-14 01:43:37,549 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1093 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:37,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1168 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:43:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2023-02-14 01:43:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 2385. [2023-02-14 01:43:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2376 states have (on average 1.2175925925925926) internal successors, (2893), 2384 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 2893 transitions. [2023-02-14 01:43:37,583 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 2893 transitions. Word has length 111 [2023-02-14 01:43:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:37,583 INFO L495 AbstractCegarLoop]: Abstraction has 2385 states and 2893 transitions. [2023-02-14 01:43:37,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.4375) internal successors, (183), 17 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2893 transitions. [2023-02-14 01:43:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-02-14 01:43:37,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:37,585 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:37,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:37,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-14 01:43:37,791 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1146584722, now seen corresponding path program 1 times [2023-02-14 01:43:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:37,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358366143] [2023-02-14 01:43:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 28 proven. 213 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-02-14 01:43:37,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:37,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358366143] [2023-02-14 01:43:37,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358366143] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:37,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87799283] [2023-02-14 01:43:37,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:37,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:37,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:37,950 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:37,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-14 01:43:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:38,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:43:38,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:38,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:38,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87799283] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:38,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:38,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2023-02-14 01:43:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935590279] [2023-02-14 01:43:38,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:38,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:43:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:43:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:43:38,266 INFO L87 Difference]: Start difference. First operand 2385 states and 2893 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:38,908 INFO L93 Difference]: Finished difference Result 5270 states and 6298 transitions. [2023-02-14 01:43:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-14 01:43:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2023-02-14 01:43:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:38,913 INFO L225 Difference]: With dead ends: 5270 [2023-02-14 01:43:38,913 INFO L226 Difference]: Without dead ends: 5270 [2023-02-14 01:43:38,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=512, Invalid=1468, Unknown=0, NotChecked=0, Total=1980 [2023-02-14 01:43:38,914 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 564 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:38,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1267 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:43:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5270 states. [2023-02-14 01:43:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5270 to 2385. [2023-02-14 01:43:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2376 states have (on average 1.2146464646464648) internal successors, (2886), 2384 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 2886 transitions. [2023-02-14 01:43:38,942 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 2886 transitions. Word has length 112 [2023-02-14 01:43:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:38,942 INFO L495 AbstractCegarLoop]: Abstraction has 2385 states and 2886 transitions. [2023-02-14 01:43:38,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2886 transitions. [2023-02-14 01:43:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-02-14 01:43:38,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:38,944 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:38,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:39,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-14 01:43:39,150 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1937224330, now seen corresponding path program 1 times [2023-02-14 01:43:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:39,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083145749] [2023-02-14 01:43:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:39,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083145749] [2023-02-14 01:43:39,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083145749] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:39,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902259703] [2023-02-14 01:43:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:39,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:39,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:39,291 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:39,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-14 01:43:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:39,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:43:39,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:39,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:39,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902259703] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:39,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:39,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-02-14 01:43:39,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791692912] [2023-02-14 01:43:39,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:39,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:43:39,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:43:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:43:39,637 INFO L87 Difference]: Start difference. First operand 2385 states and 2886 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:39,792 INFO L93 Difference]: Finished difference Result 4569 states and 5488 transitions. [2023-02-14 01:43:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:43:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-02-14 01:43:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:39,796 INFO L225 Difference]: With dead ends: 4569 [2023-02-14 01:43:39,796 INFO L226 Difference]: Without dead ends: 4569 [2023-02-14 01:43:39,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:43:39,797 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 537 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:39,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 266 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2023-02-14 01:43:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 2386. [2023-02-14 01:43:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2377 states have (on average 1.2145561632309634) internal successors, (2887), 2385 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 2887 transitions. [2023-02-14 01:43:39,819 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 2887 transitions. Word has length 114 [2023-02-14 01:43:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:39,819 INFO L495 AbstractCegarLoop]: Abstraction has 2386 states and 2887 transitions. [2023-02-14 01:43:39,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2887 transitions. [2023-02-14 01:43:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-02-14 01:43:39,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:39,821 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:39,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:40,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:40,027 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash -374280255, now seen corresponding path program 1 times [2023-02-14 01:43:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:40,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309021415] [2023-02-14 01:43:40,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 41 proven. 275 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-14 01:43:40,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:40,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309021415] [2023-02-14 01:43:40,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309021415] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:40,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416466990] [2023-02-14 01:43:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:40,941 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:40,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-14 01:43:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:41,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 01:43:41,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:41,443 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 01:43:41,446 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 01:43:41,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:43:41,506 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 17 treesize of output 15 [2023-02-14 01:43:41,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:43:41,511 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 17 treesize of output 15 [2023-02-14 01:43:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 46 proven. 192 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:41,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:41,616 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 12 treesize of output 10 [2023-02-14 01:43:41,618 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 18 treesize of output 16 [2023-02-14 01:43:41,627 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 12 treesize of output 10 [2023-02-14 01:43:41,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:43:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 46 proven. 192 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:41,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416466990] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:41,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:41,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 25 [2023-02-14 01:43:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849078767] [2023-02-14 01:43:41,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:41,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 01:43:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 01:43:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-02-14 01:43:41,879 INFO L87 Difference]: Start difference. First operand 2386 states and 2887 transitions. Second operand has 26 states, 26 states have (on average 6.461538461538462) internal successors, (168), 25 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:44,487 INFO L93 Difference]: Finished difference Result 7362 states and 8650 transitions. [2023-02-14 01:43:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-02-14 01:43:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.461538461538462) internal successors, (168), 25 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2023-02-14 01:43:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:44,493 INFO L225 Difference]: With dead ends: 7362 [2023-02-14 01:43:44,493 INFO L226 Difference]: Without dead ends: 7362 [2023-02-14 01:43:44,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1119, Invalid=4581, Unknown=0, NotChecked=0, Total=5700 [2023-02-14 01:43:44,494 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 1359 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:44,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 2376 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:43:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2023-02-14 01:43:44,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 2950. [2023-02-14 01:43:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2941 states have (on average 1.213532811968718) internal successors, (3569), 2949 states have internal predecessors, (3569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3569 transitions. [2023-02-14 01:43:44,527 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3569 transitions. Word has length 117 [2023-02-14 01:43:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:44,527 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 3569 transitions. [2023-02-14 01:43:44,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.461538461538462) internal successors, (168), 25 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3569 transitions. [2023-02-14 01:43:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-02-14 01:43:44,529 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:44,529 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:44,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-02-14 01:43:44,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:44,735 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:44,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash 779532359, now seen corresponding path program 1 times [2023-02-14 01:43:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:44,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615504440] [2023-02-14 01:43:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 84 proven. 313 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 01:43:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:45,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615504440] [2023-02-14 01:43:45,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615504440] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:45,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917707103] [2023-02-14 01:43:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:45,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:45,127 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:45,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-14 01:43:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:45,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-14 01:43:45,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:45,351 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 01:43:45,353 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 01:43:45,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:43:45,506 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 17 treesize of output 15 [2023-02-14 01:43:45,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:43:45,511 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 17 treesize of output 15 [2023-02-14 01:43:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 80 proven. 317 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 01:43:45,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:46,155 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 14 treesize of output 12 [2023-02-14 01:43:46,158 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 20 treesize of output 16 [2023-02-14 01:43:46,171 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 14 treesize of output 12 [2023-02-14 01:43:46,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:43:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 76 proven. 321 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 01:43:46,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917707103] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:46,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:46,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-02-14 01:43:46,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167122639] [2023-02-14 01:43:46,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:46,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-14 01:43:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:46,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-14 01:43:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2023-02-14 01:43:46,386 INFO L87 Difference]: Start difference. First operand 2950 states and 3569 transitions. Second operand has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:48,479 INFO L93 Difference]: Finished difference Result 15206 states and 17825 transitions. [2023-02-14 01:43:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-02-14 01:43:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2023-02-14 01:43:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:48,494 INFO L225 Difference]: With dead ends: 15206 [2023-02-14 01:43:48,495 INFO L226 Difference]: Without dead ends: 15206 [2023-02-14 01:43:48,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1155, Invalid=6155, Unknown=0, NotChecked=0, Total=7310 [2023-02-14 01:43:48,497 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 2280 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:48,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 2999 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:43:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15206 states. [2023-02-14 01:43:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15206 to 8278. [2023-02-14 01:43:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8278 states, 8269 states have (on average 1.207159269561011) internal successors, (9982), 8277 states have internal predecessors, (9982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8278 states to 8278 states and 9982 transitions. [2023-02-14 01:43:48,600 INFO L78 Accepts]: Start accepts. Automaton has 8278 states and 9982 transitions. Word has length 117 [2023-02-14 01:43:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:48,601 INFO L495 AbstractCegarLoop]: Abstraction has 8278 states and 9982 transitions. [2023-02-14 01:43:48,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8278 states and 9982 transitions. [2023-02-14 01:43:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-02-14 01:43:48,605 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:48,606 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:48,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:48,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:48,812 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1282212589, now seen corresponding path program 1 times [2023-02-14 01:43:48,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:48,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193714063] [2023-02-14 01:43:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:49,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193714063] [2023-02-14 01:43:49,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193714063] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:49,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850437266] [2023-02-14 01:43:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:49,007 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:49,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-14 01:43:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:49,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:43:49,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:49,276 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 13 treesize of output 9 [2023-02-14 01:43:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 01:43:49,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:49,424 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_28 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_28) 0)) (= (store |c_#valid| v_~x1~0.base_28 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-02-14 01:43:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 97 trivial. 48 not checked. [2023-02-14 01:43:49,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850437266] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:49,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:49,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 8 [2023-02-14 01:43:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734847509] [2023-02-14 01:43:49,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:49,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 01:43:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:49,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 01:43:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2023-02-14 01:43:49,461 INFO L87 Difference]: Start difference. First operand 8278 states and 9982 transitions. Second operand has 9 states, 8 states have (on average 10.25) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:49,746 INFO L93 Difference]: Finished difference Result 18955 states and 22785 transitions. [2023-02-14 01:43:49,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 01:43:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2023-02-14 01:43:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:49,786 INFO L225 Difference]: With dead ends: 18955 [2023-02-14 01:43:49,787 INFO L226 Difference]: Without dead ends: 18937 [2023-02-14 01:43:49,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=201, Unknown=1, NotChecked=30, Total=306 [2023-02-14 01:43:49,787 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 412 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:49,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 656 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 216 Unchecked, 0.2s Time] [2023-02-14 01:43:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18937 states. [2023-02-14 01:43:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18937 to 14041. [2023-02-14 01:43:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14041 states, 14032 states have (on average 1.206171607753706) internal successors, (16925), 14040 states have internal predecessors, (16925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14041 states to 14041 states and 16925 transitions. [2023-02-14 01:43:49,986 INFO L78 Accepts]: Start accepts. Automaton has 14041 states and 16925 transitions. Word has length 118 [2023-02-14 01:43:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:49,987 INFO L495 AbstractCegarLoop]: Abstraction has 14041 states and 16925 transitions. [2023-02-14 01:43:49,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14041 states and 16925 transitions. [2023-02-14 01:43:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-02-14 01:43:49,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:49,994 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:50,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:50,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:50,201 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash -224880734, now seen corresponding path program 1 times [2023-02-14 01:43:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:50,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873801689] [2023-02-14 01:43:50,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 335 proven. 4 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2023-02-14 01:43:50,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:50,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873801689] [2023-02-14 01:43:50,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873801689] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:50,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426315480] [2023-02-14 01:43:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:50,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:50,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:50,315 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:50,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-14 01:43:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:50,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:43:50,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 335 proven. 4 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2023-02-14 01:43:50,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2023-02-14 01:43:50,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426315480] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:50,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:43:50,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2023-02-14 01:43:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836217448] [2023-02-14 01:43:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:43:50,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:43:50,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:50,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:43:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:43:50,525 INFO L87 Difference]: Start difference. First operand 14041 states and 16925 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:50,602 INFO L93 Difference]: Finished difference Result 10162 states and 12168 transitions. [2023-02-14 01:43:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:43:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2023-02-14 01:43:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:50,615 INFO L225 Difference]: With dead ends: 10162 [2023-02-14 01:43:50,615 INFO L226 Difference]: Without dead ends: 10162 [2023-02-14 01:43:50,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:43:50,616 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 126 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:50,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 464 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:43:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10162 states. [2023-02-14 01:43:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10162 to 8827. [2023-02-14 01:43:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8827 states, 8818 states have (on average 1.1958493989566794) internal successors, (10545), 8826 states have internal predecessors, (10545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8827 states to 8827 states and 10545 transitions. [2023-02-14 01:43:50,725 INFO L78 Accepts]: Start accepts. Automaton has 8827 states and 10545 transitions. Word has length 146 [2023-02-14 01:43:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:50,726 INFO L495 AbstractCegarLoop]: Abstraction has 8827 states and 10545 transitions. [2023-02-14 01:43:50,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 8827 states and 10545 transitions. [2023-02-14 01:43:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-02-14 01:43:50,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:50,730 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 14, 9, 9, 7, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:50,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:50,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:50,937 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 368256012, now seen corresponding path program 2 times [2023-02-14 01:43:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:50,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689745850] [2023-02-14 01:43:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 336 proven. 3 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-02-14 01:43:51,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:51,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689745850] [2023-02-14 01:43:51,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689745850] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:51,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114776833] [2023-02-14 01:43:51,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:43:51,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:51,055 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:51,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-14 01:43:51,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:43:51,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:43:51,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:43:51,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 291 proven. 109 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-14 01:43:51,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 291 proven. 109 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-14 01:43:51,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114776833] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:51,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:51,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-14 01:43:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088118043] [2023-02-14 01:43:51,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:51,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 01:43:51,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:51,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 01:43:51,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:43:51,433 INFO L87 Difference]: Start difference. First operand 8827 states and 10545 transitions. Second operand has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:43:51,642 INFO L93 Difference]: Finished difference Result 10609 states and 12209 transitions. [2023-02-14 01:43:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 01:43:51,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2023-02-14 01:43:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:43:51,654 INFO L225 Difference]: With dead ends: 10609 [2023-02-14 01:43:51,654 INFO L226 Difference]: Without dead ends: 10609 [2023-02-14 01:43:51,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2023-02-14 01:43:51,655 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 858 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:43:51,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1733 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:43:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10609 states. [2023-02-14 01:43:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10609 to 7447. [2023-02-14 01:43:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7447 states, 7438 states have (on average 1.1560903468674375) internal successors, (8599), 7446 states have internal predecessors, (8599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7447 states to 7447 states and 8599 transitions. [2023-02-14 01:43:51,741 INFO L78 Accepts]: Start accepts. Automaton has 7447 states and 8599 transitions. Word has length 155 [2023-02-14 01:43:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:43:51,741 INFO L495 AbstractCegarLoop]: Abstraction has 7447 states and 8599 transitions. [2023-02-14 01:43:51,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:43:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7447 states and 8599 transitions. [2023-02-14 01:43:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-02-14 01:43:51,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:43:51,745 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:43:51,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-02-14 01:43:51,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-02-14 01:43:51,951 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:43:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:43:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1761139834, now seen corresponding path program 1 times [2023-02-14 01:43:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:43:51,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247839936] [2023-02-14 01:43:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:43:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 104 proven. 679 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-14 01:43:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:43:52,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247839936] [2023-02-14 01:43:52,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247839936] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:43:52,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628577041] [2023-02-14 01:43:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:43:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:43:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:43:52,653 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:43:52,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-14 01:43:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:43:52,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-14 01:43:52,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:43:52,838 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 01:43:52,946 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 01:43:52,950 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 01:43:53,096 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:43:53,096 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 01:43:53,101 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 01:43:53,114 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 01:43:53,121 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 01:43:53,124 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 01:43:53,162 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 01:43:53,166 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 01:43:53,269 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 01:43:53,272 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 01:43:53,375 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 01:43:53,376 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 01:43:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 100 proven. 673 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-14 01:43:53,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:43:53,603 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1343) c_~S~0.base) .cse0) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1342) c_~S~0.base) .cse0) 0)))) is different from false [2023-02-14 01:43:53,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:43:53,974 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 01:43:53,975 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 36 treesize of output 24 [2023-02-14 01:43:53,978 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 11 treesize of output 7 [2023-02-14 01:43:53,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:43:53,985 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 01:43:53,986 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:43:53,987 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 20 treesize of output 8 [2023-02-14 01:43:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 90 proven. 443 refuted. 0 times theorem prover too weak. 56 trivial. 240 not checked. [2023-02-14 01:43:54,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628577041] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:43:54,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:43:54,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2023-02-14 01:43:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76368102] [2023-02-14 01:43:54,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:43:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-14 01:43:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:43:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-14 01:43:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=447, Unknown=2, NotChecked=42, Total=552 [2023-02-14 01:43:54,214 INFO L87 Difference]: Start difference. First operand 7447 states and 8599 transitions. Second operand has 24 states, 24 states have (on average 9.625) internal successors, (231), 23 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:44:03,678 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 51 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:44:14,802 WARN L233 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 60 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:44:20,219 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 53 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:44:21,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~S~0.offset 4)) (.cse0 (+ 4 c_~x1~0.offset))) (and (forall ((v_~x1~0.base_30 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_30) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_30 v_ArrVal_1342) c_~x1~0.base) .cse0) 0)))) (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1343) c_~S~0.base) .cse1) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1342) c_~S~0.base) .cse1) 0)) (forall ((v_~x1~0.base_30 Int)) (or (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_30 v_ArrVal_1343) c_~x1~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))))) is different from false [2023-02-14 01:44:29,860 WARN L233 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 58 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:44:36,879 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 62 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:44:37,996 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1343) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1342) c_~S~0.base) .cse0) 0)) (= c_~x4~0.offset 0) (= c_~x4~0.base 0) (forall ((v_~x1~0.base_30 Int)) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_30 v_ArrVal_1342) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_30 Int)) (or (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_30 v_ArrVal_1343) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))))) is different from false [2023-02-14 01:44:38,033 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1343) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1342) c_~S~0.base) .cse0) 0)) (= c_~t4~0.base 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (forall ((v_~x1~0.base_30 Int)) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_30 v_ArrVal_1342) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_30 Int)) (or (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_30 v_ArrVal_1343) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))))) is different from false [2023-02-14 01:44:47,304 WARN L233 SmtUtils]: Spent 9.23s on a formula simplification. DAG size of input: 54 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:44:48,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 01:44:55,161 WARN L233 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 39 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:44:55,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1343) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1342) c_~S~0.base) .cse0) 0)) (forall ((v_~x1~0.base_30 Int)) (or (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_30 v_ArrVal_1342) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_30 Int)) (or (forall ((v_ArrVal_1343 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_30 v_ArrVal_1343) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_30) 0)))))) is different from false [2023-02-14 01:45:07,036 WARN L233 SmtUtils]: Spent 11.75s on a formula simplification. DAG size of input: 64 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:45:20,420 WARN L233 SmtUtils]: Spent 11.73s on a formula simplification. DAG size of input: 66 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:45:29,092 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 49 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:45:37,411 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 62 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:45:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:45:37,516 INFO L93 Difference]: Finished difference Result 36878 states and 41887 transitions. [2023-02-14 01:45:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-02-14 01:45:37,517 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.625) internal successors, (231), 23 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2023-02-14 01:45:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:45:37,551 INFO L225 Difference]: With dead ends: 36878 [2023-02-14 01:45:37,551 INFO L226 Difference]: Without dead ends: 36878 [2023-02-14 01:45:37,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 317 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 4796 ImplicationChecksByTransitivity, 95.6s TimeCoverageRelationStatistics Valid=1562, Invalid=11996, Unknown=34, NotChecked=1170, Total=14762 [2023-02-14 01:45:37,554 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 2353 mSDsluCounter, 6294 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 98 mSolverCounterUnsat, 128 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2353 SdHoareTripleChecker+Valid, 6646 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 128 IncrementalHoareTripleChecker+Unknown, 965 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:45:37,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2353 Valid, 6646 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2863 Invalid, 128 Unknown, 965 Unchecked, 7.7s Time] [2023-02-14 01:45:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36878 states. [2023-02-14 01:45:37,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36878 to 15425. [2023-02-14 01:45:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15425 states, 15416 states have (on average 1.1480280228334199) internal successors, (17698), 15424 states have internal predecessors, (17698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:45:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15425 states to 15425 states and 17698 transitions. [2023-02-14 01:45:37,778 INFO L78 Accepts]: Start accepts. Automaton has 15425 states and 17698 transitions. Word has length 162 [2023-02-14 01:45:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:45:37,778 INFO L495 AbstractCegarLoop]: Abstraction has 15425 states and 17698 transitions. [2023-02-14 01:45:37,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.625) internal successors, (231), 23 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:45:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15425 states and 17698 transitions. [2023-02-14 01:45:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-02-14 01:45:37,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:45:37,784 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:45:37,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-02-14 01:45:37,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-02-14 01:45:37,991 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:45:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:45:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1850586310, now seen corresponding path program 2 times [2023-02-14 01:45:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:45:37,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473499747] [2023-02-14 01:45:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:45:37,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:45:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:45:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 104 proven. 685 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-14 01:45:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:45:38,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473499747] [2023-02-14 01:45:38,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473499747] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:45:38,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286256246] [2023-02-14 01:45:38,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:45:38,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:45:38,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:45:38,732 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:45:38,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-02-14 01:45:38,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:45:38,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:45:38,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-14 01:45:38,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:45:38,921 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 01:45:39,051 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 01:45:39,055 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 01:45:39,213 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:45:39,214 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 01:45:39,219 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 01:45:39,226 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 01:45:39,231 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 01:45:39,237 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 01:45:39,273 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 01:45:39,277 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 01:45:39,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 16 treesize of output 18 [2023-02-14 01:45:39,397 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 01:45:39,460 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 01:45:39,463 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 01:45:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 100 proven. 679 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-02-14 01:45:39,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:45:39,753 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~S~0.base) .cse0) 0)) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~S~0.base) .cse0))))) is different from false [2023-02-14 01:45:40,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:45:40,069 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 01:45:40,071 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 36 treesize of output 24 [2023-02-14 01:45:40,073 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 11 treesize of output 7 [2023-02-14 01:45:40,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:45:40,080 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 01:45:40,081 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:45:40,082 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 20 treesize of output 8 [2023-02-14 01:45:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 90 proven. 453 refuted. 5 times theorem prover too weak. 50 trivial. 231 not checked. [2023-02-14 01:45:40,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286256246] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:45:40,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:45:40,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2023-02-14 01:45:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543656204] [2023-02-14 01:45:40,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:45:40,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-14 01:45:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:45:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-14 01:45:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=441, Unknown=10, NotChecked=42, Total=552 [2023-02-14 01:45:40,314 INFO L87 Difference]: Start difference. First operand 15425 states and 17698 transitions. Second operand has 24 states, 24 states have (on average 9.958333333333334) internal successors, (239), 23 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:45:52,987 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 51 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:45:58,294 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 53 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:46:07,655 WARN L233 SmtUtils]: Spent 9.19s on a formula simplification. DAG size of input: 60 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:46:07,869 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~t4~0.offset 4)) (.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) 0) (forall ((v_~x1~0.base_32 Int)) (or (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_32) 0)))) (= c_~x1~0.offset 0) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~S~0.base) .cse0))) (= c_~t1~0.base 0) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) 0) (forall ((v_~x1~0.base_32 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_32) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~S~0.base) .cse0) 0)))))) is different from false [2023-02-14 01:46:17,320 WARN L233 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 58 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:46:27,826 WARN L233 SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 62 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:46:29,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (forall ((v_~x1~0.base_32 Int)) (or (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_32) 0)))) (= c_~x1~0.offset 0) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~S~0.base) .cse0))) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_32 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_32) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~S~0.base) .cse0) 0)))))) is different from false [2023-02-14 01:46:29,527 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (= c_~x4~0.offset 0) (= c_~x4~0.base 0) (forall ((v_~x1~0.base_32 Int)) (or (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_32) 0)))) (= c_~x1~0.offset 0) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~S~0.base) .cse0))) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_32 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_32) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~S~0.base) .cse0) 0)))))) is different from false [2023-02-14 01:46:29,543 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (= c_~t4~0.base 0) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (forall ((v_~x1~0.base_32 Int)) (or (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_32) 0)))) (= c_~x1~0.offset 0) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~S~0.base) .cse0))) (= c_~t1~0.base 0) (forall ((v_~x1~0.base_32 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_32) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~S~0.base) .cse0) 0)))))) is different from false [2023-02-14 01:46:38,811 WARN L233 SmtUtils]: Spent 9.19s on a formula simplification. DAG size of input: 64 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:46:47,991 WARN L233 SmtUtils]: Spent 9.14s on a formula simplification. DAG size of input: 54 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:46:57,444 WARN L233 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 66 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:47:03,493 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 39 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:47:03,729 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (= c_~x1~0.offset 0) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~S~0.base) .cse0))) (= c_~t1~0.base 0))) is different from false [2023-02-14 01:47:10,359 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 49 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:47:13,063 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~t4~0.offset 4)) (.cse0 (+ c_~S~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1471) c_~S~0.base) .cse0) 0)) (= c_~t1~0.offset 0) (= c_~x4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) 0) (forall ((v_~x1~0.base_32 Int)) (or (forall ((v_ArrVal_1472 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_32 v_ArrVal_1472) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_32) 0)))) (= c_~x1~0.offset 0) (forall ((v_ArrVal_1472 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1472) c_~S~0.base) .cse0))) (= c_~t1~0.base 0) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) 0) (forall ((v_~x1~0.base_32 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_32) 0)) (forall ((v_ArrVal_1471 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_32 v_ArrVal_1471) c_~S~0.base) .cse0) 0)))))) is different from false [2023-02-14 01:47:22,348 WARN L233 SmtUtils]: Spent 9.24s on a formula simplification. DAG size of input: 62 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:47:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:47:22,762 INFO L93 Difference]: Finished difference Result 88197 states and 99981 transitions. [2023-02-14 01:47:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2023-02-14 01:47:22,763 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.958333333333334) internal successors, (239), 23 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2023-02-14 01:47:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:47:22,855 INFO L225 Difference]: With dead ends: 88197 [2023-02-14 01:47:22,855 INFO L226 Difference]: Without dead ends: 88197 [2023-02-14 01:47:22,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 317 SyntacticMatches, 6 SemanticMatches, 202 ConstructedPredicates, 7 IntricatePredicates, 6 DeprecatedPredicates, 16328 ImplicationChecksByTransitivity, 99.9s TimeCoverageRelationStatistics Valid=3949, Invalid=34533, Unknown=158, NotChecked=2772, Total=41412 [2023-02-14 01:47:22,860 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 3410 mSDsluCounter, 6178 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 210 mSolverCounterUnsat, 157 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3410 SdHoareTripleChecker+Valid, 6537 SdHoareTripleChecker+Invalid, 4367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 157 IncrementalHoareTripleChecker+Unknown, 1509 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:47:22,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3410 Valid, 6537 Invalid, 4367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2491 Invalid, 157 Unknown, 1509 Unchecked, 2.3s Time] [2023-02-14 01:47:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88197 states. [2023-02-14 01:47:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88197 to 43974. [2023-02-14 01:47:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43974 states, 43965 states have (on average 1.1433640395769362) internal successors, (50268), 43973 states have internal predecessors, (50268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:47:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43974 states to 43974 states and 50268 transitions. [2023-02-14 01:47:23,465 INFO L78 Accepts]: Start accepts. Automaton has 43974 states and 50268 transitions. Word has length 162 [2023-02-14 01:47:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:47:23,466 INFO L495 AbstractCegarLoop]: Abstraction has 43974 states and 50268 transitions. [2023-02-14 01:47:23,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.958333333333334) internal successors, (239), 23 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:47:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 43974 states and 50268 transitions. [2023-02-14 01:47:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-02-14 01:47:23,476 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:47:23,476 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:47:23,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-02-14 01:47:23,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-02-14 01:47:23,681 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-14 01:47:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:47:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1229648570, now seen corresponding path program 3 times [2023-02-14 01:47:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:47:23,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180973543] [2023-02-14 01:47:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:47:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:47:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:47:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 104 proven. 681 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-02-14 01:47:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:47:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180973543] [2023-02-14 01:47:24,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180973543] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:47:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73315055] [2023-02-14 01:47:24,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 01:47:24,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:47:24,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:47:24,457 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 01:47:24,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-02-14 01:47:24,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-02-14 01:47:24,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:47:24,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-14 01:47:24,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:47:24,807 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 01:47:24,925 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 01:47:24,930 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 01:47:25,154 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:47:25,154 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 01:47:25,188 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 01:47:25,192 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 01:47:25,199 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 01:47:25,204 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 01:47:25,241 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 01:47:25,245 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 01:47:25,329 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 01:47:25,333 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 01:47:25,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:47:25,408 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 17 treesize of output 19 [2023-02-14 01:47:25,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:47:25,419 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 17 treesize of output 19 [2023-02-14 01:47:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 134 proven. 617 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-02-14 01:47:25,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:47:25,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1601) c_~S~0.base) .cse0) 0)) (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1600) c_~S~0.base) .cse0) 0)))) is different from false [2023-02-14 01:47:26,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:47:26,241 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 01:47:26,243 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 36 treesize of output 24 [2023-02-14 01:47:26,245 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 11 treesize of output 7 [2023-02-14 01:47:26,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:47:26,252 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 01:47:26,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:47:26,254 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 20 treesize of output 8 [2023-02-14 01:47:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 90 proven. 421 refuted. 0 times theorem prover too weak. 78 trivial. 240 not checked. [2023-02-14 01:47:26,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73315055] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:47:26,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:47:26,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2023-02-14 01:47:26,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058178599] [2023-02-14 01:47:26,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:47:26,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-14 01:47:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:47:26,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-14 01:47:26,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=579, Unknown=1, NotChecked=48, Total=702 [2023-02-14 01:47:26,446 INFO L87 Difference]: Start difference. First operand 43974 states and 50268 transitions. Second operand has 27 states, 27 states have (on average 10.333333333333334) internal successors, (279), 26 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:47:36,068 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~S~0.offset 4)) (.cse0 (+ c_~t4~0.offset 4))) (and (= (select |c_#valid| c_~t4~0.base) 1) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse0) 0) (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1601) c_~S~0.base) .cse1) 0)) (or (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| 0) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| 0)) (not (= c_~S~0.base c_~t4~0.base)) (not (= c_~S~0.offset c_~t4~0.offset))) (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1600) c_~S~0.base) .cse1) 0)) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse0) 0) (or (not (= c_~S~0.offset c_~t1~0.offset)) (not (= c_~t1~0.base c_~S~0.base)) (let ((.cse2 (+ 4 c_~x1~0.offset))) (and (forall ((v_~x1~0.base_34 Int)) (or (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_34 v_ArrVal_1600) c_~x1~0.base) .cse2) 0)) (not (= (select |c_#valid| v_~x1~0.base_34) 0)))) (forall ((v_~x1~0.base_34 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_34) 0)) (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_34 v_ArrVal_1601) c_~x1~0.base) .cse2) 0))))))) (not (= c_~x1~0.base c_~t4~0.base)))) is different from false [2023-02-14 01:47:36,385 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4)) (.cse1 (+ c_~t4~0.offset 4))) (and (forall ((v_~x1~0.base_34 Int)) (or (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_34 v_ArrVal_1600) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_34) 0)))) (forall ((v_~x1~0.base_34 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_34) 0)) (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_34 v_ArrVal_1601) c_~S~0.base) .cse0) 0)))) (= (select |c_#valid| c_~t4~0.base) 1) (= c_~x4~0.offset 0) (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) 0) (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1601) c_~S~0.base) .cse0) 0)) (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1600) c_~S~0.base) .cse0) 0)) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) 0) (not (= c_~x1~0.base c_~t4~0.base)))) is different from false [2023-02-14 01:47:41,602 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (forall ((v_~x1~0.base_34 Int)) (or (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_34 v_ArrVal_1600) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| v_~x1~0.base_34) 0)))) (forall ((v_~x1~0.base_34 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_34) 0)) (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_34 v_ArrVal_1601) c_~S~0.base) .cse0) 0)))) (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1601) c_~S~0.base) .cse0) 0)) (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1600) c_~S~0.base) .cse0) 0)))) is different from false [2023-02-14 01:47:41,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_1601) c_~S~0.base) .cse0) 0)) (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_1600) c_~S~0.base) .cse0) 0)) (or (not (= c_~S~0.offset c_~t1~0.offset)) (not (= c_~t1~0.base c_~S~0.base)) (let ((.cse1 (+ 4 c_~x1~0.offset))) (and (forall ((v_~x1~0.base_34 Int)) (or (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_34 v_ArrVal_1600) c_~x1~0.base) .cse1) 0)) (not (= (select |c_#valid| v_~x1~0.base_34) 0)))) (forall ((v_~x1~0.base_34 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_34) 0)) (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_34 v_ArrVal_1601) c_~x1~0.base) .cse1) 0))))))))) is different from false