./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:32:30,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:32:30,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:32:30,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:32:30,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:32:30,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:32:30,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:32:30,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:32:30,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:32:30,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:32:30,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:32:30,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:32:30,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:32:30,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:32:30,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:32:30,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:32:30,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:32:30,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:32:30,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:32:30,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:32:30,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:32:30,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:32:30,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:32:30,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:32:30,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:32:30,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:32:30,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:32:30,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:32:30,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:32:30,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:32:30,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:32:30,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:32:30,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:32:30,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:32:30,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:32:30,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:32:30,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:32:30,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:32:30,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:32:30,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:32:30,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:32:30,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:32:30,971 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:32:30,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:32:30,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:32:30,973 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:32:30,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:32:30,974 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:32:30,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:32:30,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:32:30,975 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:32:30,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:32:30,976 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:32:30,976 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:32:30,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:32:30,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:32:30,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:32:30,976 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:32:30,977 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:32:30,977 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:32:30,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:32:30,977 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:32:30,977 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:32:30,977 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:32:30,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:32:30,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:32:30,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:32:30,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:32:30,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:32:30,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:32:30,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:32:30,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:32:30,979 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:32:30,979 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:32:30,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:32:30,979 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:32:30,980 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2023-02-16 03:32:31,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:32:31,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:32:31,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:32:31,183 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:32:31,183 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:32:31,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-02-16 03:32:32,256 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:32:32,418 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:32:32,418 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-02-16 03:32:32,429 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73aff87a/142ea4383b704cd68df0a134ca13ee0c/FLAGd1bc77e9d [2023-02-16 03:32:32,439 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73aff87a/142ea4383b704cd68df0a134ca13ee0c [2023-02-16 03:32:32,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:32:32,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:32:32,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:32:32,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:32:32,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:32:32,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160b66d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32, skipping insertion in model container [2023-02-16 03:32:32,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:32:32,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:32:32,634 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2023-02-16 03:32:32,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:32:32,647 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:32:32,701 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2023-02-16 03:32:32,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:32:32,722 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:32:32,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32 WrapperNode [2023-02-16 03:32:32,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:32:32,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:32:32,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:32:32,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:32:32,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,755 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2023-02-16 03:32:32,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:32:32,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:32:32,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:32:32,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:32:32,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,774 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:32:32,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:32:32,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:32:32,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:32:32,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (1/1) ... [2023-02-16 03:32:32,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:32:32,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:32:32,823 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-16 03:32:32,831 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-16 03:32:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:32:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:32:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:32:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:32:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:32:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:32:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:32:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:32:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:32:32,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:32:32,975 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:32:32,976 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:32:33,294 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:32:33,299 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:32:33,300 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-16 03:32:33,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:32:33 BoogieIcfgContainer [2023-02-16 03:32:33,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:32:33,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:32:33,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:32:33,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:32:33,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:32:32" (1/3) ... [2023-02-16 03:32:33,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa6638c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:32:33, skipping insertion in model container [2023-02-16 03:32:33,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:32:32" (2/3) ... [2023-02-16 03:32:33,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa6638c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:32:33, skipping insertion in model container [2023-02-16 03:32:33,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:32:33" (3/3) ... [2023-02-16 03:32:33,309 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2023-02-16 03:32:33,321 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:32:33,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2023-02-16 03:32:33,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:32:33,375 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;@7845d949, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:32:33,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-02-16 03:32:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 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-16 03:32:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:32:33,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:33,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:32:33,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-16 03:32:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:33,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583504080] [2023-02-16 03:32:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:33,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:33,578 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-16 03:32:33,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:33,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583504080] [2023-02-16 03:32:33,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583504080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:33,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:33,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:32:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761060250] [2023-02-16 03:32:33,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:33,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:32:33,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:33,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:32:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:32:33,612 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:33,770 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2023-02-16 03:32:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:32:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:32:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:33,781 INFO L225 Difference]: With dead ends: 154 [2023-02-16 03:32:33,781 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:32:33,782 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-16 03:32:33,784 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:33,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 87 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:32:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-16 03:32:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.9024390243902438) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 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-16 03:32:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2023-02-16 03:32:33,812 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 3 [2023-02-16 03:32:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:33,812 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2023-02-16 03:32:33,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2023-02-16 03:32:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:32:33,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:33,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:32:33,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:32:33,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-16 03:32:33,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:33,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030360009] [2023-02-16 03:32:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:33,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:33,867 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-16 03:32:33,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:33,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030360009] [2023-02-16 03:32:33,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030360009] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:33,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:33,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:32:33,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969357131] [2023-02-16 03:32:33,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:33,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:32:33,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:33,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:32:33,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:32:33,870 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:33,961 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2023-02-16 03:32:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:32:33,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:32:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:33,963 INFO L225 Difference]: With dead ends: 139 [2023-02-16 03:32:33,963 INFO L226 Difference]: Without dead ends: 139 [2023-02-16 03:32:33,963 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-16 03:32:33,964 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 113 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:33,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 100 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-16 03:32:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2023-02-16 03:32:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-02-16 03:32:33,970 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2023-02-16 03:32:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:33,970 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-02-16 03:32:33,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-02-16 03:32:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:32:33,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:33,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:33,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:32:33,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2023-02-16 03:32:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:33,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181004257] [2023-02-16 03:32:33,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:34,108 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-16 03:32:34,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181004257] [2023-02-16 03:32:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181004257] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:34,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:34,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101253300] [2023-02-16 03:32:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:34,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:32:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:34,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:32:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:34,111 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:34,277 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2023-02-16 03:32:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:32:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-16 03:32:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:34,281 INFO L225 Difference]: With dead ends: 179 [2023-02-16 03:32:34,281 INFO L226 Difference]: Without dead ends: 179 [2023-02-16 03:32:34,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:34,287 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 52 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:34,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 330 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-16 03:32:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2023-02-16 03:32:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-16 03:32:34,303 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 12 [2023-02-16 03:32:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:34,304 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-16 03:32:34,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-16 03:32:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:32:34,305 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:34,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:34,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:32:34,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:34,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:34,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2023-02-16 03:32:34,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:34,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207705623] [2023-02-16 03:32:34,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:34,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:34,555 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-16 03:32:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:34,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207705623] [2023-02-16 03:32:34,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207705623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:34,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:34,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12134587] [2023-02-16 03:32:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:34,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:32:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:32:34,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:34,559 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:34,682 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-02-16 03:32:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:32:34,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-16 03:32:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:34,684 INFO L225 Difference]: With dead ends: 133 [2023-02-16 03:32:34,684 INFO L226 Difference]: Without dead ends: 133 [2023-02-16 03:32:34,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:34,691 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:34,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 366 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-16 03:32:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-02-16 03:32:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7682926829268293) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-16 03:32:34,703 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 12 [2023-02-16 03:32:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:34,704 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-16 03:32:34,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-16 03:32:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:32:34,705 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:34,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:34,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:32:34,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2023-02-16 03:32:34,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:34,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141990260] [2023-02-16 03:32:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:34,786 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-16 03:32:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:34,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141990260] [2023-02-16 03:32:34,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141990260] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:34,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:34,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:32:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617556157] [2023-02-16 03:32:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:34,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:32:34,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:32:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:32:34,789 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:34,893 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2023-02-16 03:32:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:32:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 03:32:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:34,894 INFO L225 Difference]: With dead ends: 134 [2023-02-16 03:32:34,895 INFO L226 Difference]: Without dead ends: 134 [2023-02-16 03:32:34,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 03:32:34,895 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 186 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:34,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 75 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-16 03:32:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2023-02-16 03:32:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 124 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2023-02-16 03:32:34,904 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 13 [2023-02-16 03:32:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:34,904 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2023-02-16 03:32:34,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2023-02-16 03:32:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:32:34,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:34,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:34,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:32:34,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:34,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2023-02-16 03:32:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:34,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375112038] [2023-02-16 03:32:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:35,076 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-16 03:32:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:35,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375112038] [2023-02-16 03:32:35,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375112038] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:35,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:35,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:32:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484555809] [2023-02-16 03:32:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:35,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:32:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:35,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:32:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:32:35,079 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:35,243 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2023-02-16 03:32:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:32:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 03:32:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:35,245 INFO L225 Difference]: With dead ends: 183 [2023-02-16 03:32:35,245 INFO L226 Difference]: Without dead ends: 183 [2023-02-16 03:32:35,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:35,246 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 234 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:35,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 114 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-16 03:32:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2023-02-16 03:32:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 155 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-16 03:32:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2023-02-16 03:32:35,249 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 13 [2023-02-16 03:32:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:35,250 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2023-02-16 03:32:35,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2023-02-16 03:32:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:32:35,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:35,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:35,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:32:35,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2023-02-16 03:32:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:35,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398778433] [2023-02-16 03:32:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:35,358 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-16 03:32:35,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:35,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398778433] [2023-02-16 03:32:35,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398778433] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:35,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:35,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:35,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761726661] [2023-02-16 03:32:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:35,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:32:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:35,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:32:35,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:35,360 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:35,467 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2023-02-16 03:32:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:32:35,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:32:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:35,468 INFO L225 Difference]: With dead ends: 155 [2023-02-16 03:32:35,468 INFO L226 Difference]: Without dead ends: 155 [2023-02-16 03:32:35,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:35,469 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 10 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:35,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 308 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-16 03:32:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2023-02-16 03:32:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 154 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2023-02-16 03:32:35,471 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 16 [2023-02-16 03:32:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:35,472 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2023-02-16 03:32:35,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2023-02-16 03:32:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:32:35,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:35,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:35,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:32:35,473 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2023-02-16 03:32:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:35,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565045680] [2023-02-16 03:32:35,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:35,579 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-16 03:32:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565045680] [2023-02-16 03:32:35,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565045680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:35,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:35,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:35,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768558608] [2023-02-16 03:32:35,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:35,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:32:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:32:35,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:35,581 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:35,691 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2023-02-16 03:32:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:32:35,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:32:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:35,692 INFO L225 Difference]: With dead ends: 154 [2023-02-16 03:32:35,692 INFO L226 Difference]: Without dead ends: 154 [2023-02-16 03:32:35,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:35,693 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:35,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 299 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-16 03:32:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-02-16 03:32:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.504201680672269) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2023-02-16 03:32:35,696 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 16 [2023-02-16 03:32:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:35,696 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2023-02-16 03:32:35,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2023-02-16 03:32:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:32:35,697 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:35,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:35,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:32:35,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1504363226, now seen corresponding path program 1 times [2023-02-16 03:32:35,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:35,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479423855] [2023-02-16 03:32:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:35,726 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-16 03:32:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:35,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479423855] [2023-02-16 03:32:35,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479423855] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:35,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:35,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:35,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684752541] [2023-02-16 03:32:35,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:35,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:32:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:35,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:32:35,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:32:35,728 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 03:32:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:35,800 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2023-02-16 03:32:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:32:35,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-02-16 03:32:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:35,801 INFO L225 Difference]: With dead ends: 173 [2023-02-16 03:32:35,801 INFO L226 Difference]: Without dead ends: 173 [2023-02-16 03:32:35,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:32:35,802 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 173 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:35,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 163 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-16 03:32:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2023-02-16 03:32:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 153 states have internal predecessors, (177), 0 states have call successors, (0), 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-16 03:32:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2023-02-16 03:32:35,805 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 18 [2023-02-16 03:32:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:35,805 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2023-02-16 03:32:35,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 03:32:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2023-02-16 03:32:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:32:35,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:35,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:35,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:32:35,806 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:35,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394517, now seen corresponding path program 1 times [2023-02-16 03:32:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:35,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092318558] [2023-02-16 03:32:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:35,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:35,970 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-16 03:32:35,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:35,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092318558] [2023-02-16 03:32:35,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092318558] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:35,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:35,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:32:35,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995598590] [2023-02-16 03:32:35,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:35,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:32:35,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:35,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:32:35,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:32:35,971 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 03:32:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:36,214 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2023-02-16 03:32:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:32:36,215 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-02-16 03:32:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:36,215 INFO L225 Difference]: With dead ends: 155 [2023-02-16 03:32:36,215 INFO L226 Difference]: Without dead ends: 155 [2023-02-16 03:32:36,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:32:36,216 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 179 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:36,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 257 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:32:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-16 03:32:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2023-02-16 03:32:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 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-16 03:32:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2023-02-16 03:32:36,218 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 20 [2023-02-16 03:32:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:36,218 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2023-02-16 03:32:36,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 03:32:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2023-02-16 03:32:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:32:36,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:36,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:36,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 03:32:36,219 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:36,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394518, now seen corresponding path program 1 times [2023-02-16 03:32:36,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:36,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684028570] [2023-02-16 03:32:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:36,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:36,456 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-16 03:32:36,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:36,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684028570] [2023-02-16 03:32:36,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684028570] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:36,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:36,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:32:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021672] [2023-02-16 03:32:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:36,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:32:36,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:32:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:32:36,458 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 03:32:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:36,870 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2023-02-16 03:32:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:32:36,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-02-16 03:32:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:36,871 INFO L225 Difference]: With dead ends: 146 [2023-02-16 03:32:36,871 INFO L226 Difference]: Without dead ends: 146 [2023-02-16 03:32:36,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-16 03:32:36,871 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 176 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:36,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 352 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:32:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-16 03:32:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2023-02-16 03:32:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 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-16 03:32:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2023-02-16 03:32:36,874 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2023-02-16 03:32:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:36,874 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2023-02-16 03:32:36,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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-16 03:32:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2023-02-16 03:32:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:32:36,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:36,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:36,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:32:36,874 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1737058081, now seen corresponding path program 1 times [2023-02-16 03:32:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:36,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158305302] [2023-02-16 03:32:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:36,904 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-16 03:32:36,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:36,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158305302] [2023-02-16 03:32:36,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158305302] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:36,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:36,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:36,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058438651] [2023-02-16 03:32:36,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:36,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:32:36,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:36,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:32:36,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:32:36,905 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 03:32:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:36,918 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2023-02-16 03:32:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:32:36,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-02-16 03:32:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:36,919 INFO L225 Difference]: With dead ends: 160 [2023-02-16 03:32:36,919 INFO L226 Difference]: Without dead ends: 160 [2023-02-16 03:32:36,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:36,920 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:36,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 316 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:32:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-16 03:32:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2023-02-16 03:32:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.391304347826087) internal successors, (160), 137 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 03:32:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2023-02-16 03:32:36,924 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 21 [2023-02-16 03:32:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:36,924 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2023-02-16 03:32:36,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 03:32:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2023-02-16 03:32:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:32:36,926 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:36,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:36,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:32:36,926 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1420838518, now seen corresponding path program 1 times [2023-02-16 03:32:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:36,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059787000] [2023-02-16 03:32:36,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:36,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:36,948 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-16 03:32:36,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:36,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059787000] [2023-02-16 03:32:36,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059787000] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:36,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:36,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:32:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325928962] [2023-02-16 03:32:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:36,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:32:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:32:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:32:36,949 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:36,954 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2023-02-16 03:32:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:32:36,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-16 03:32:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:36,954 INFO L225 Difference]: With dead ends: 140 [2023-02-16 03:32:36,954 INFO L226 Difference]: Without dead ends: 140 [2023-02-16 03:32:36,954 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-16 03:32:36,955 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:36,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:32:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-16 03:32:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-02-16 03:32:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 139 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2023-02-16 03:32:36,957 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 23 [2023-02-16 03:32:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:36,957 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2023-02-16 03:32:36,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2023-02-16 03:32:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:32:36,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:36,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:36,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 03:32:36,958 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:36,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462334, now seen corresponding path program 1 times [2023-02-16 03:32:36,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:36,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243421812] [2023-02-16 03:32:36,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:36,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:37,126 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-16 03:32:37,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:37,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243421812] [2023-02-16 03:32:37,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243421812] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:37,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:37,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:32:37,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105528693] [2023-02-16 03:32:37,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:37,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:32:37,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:37,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:32:37,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:32:37,127 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:37,373 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2023-02-16 03:32:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:32:37,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-16 03:32:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:37,374 INFO L225 Difference]: With dead ends: 265 [2023-02-16 03:32:37,374 INFO L226 Difference]: Without dead ends: 265 [2023-02-16 03:32:37,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:32:37,375 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 281 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:37,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 384 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:32:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-02-16 03:32:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 154. [2023-02-16 03:32:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 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-16 03:32:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2023-02-16 03:32:37,378 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 23 [2023-02-16 03:32:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:37,379 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2023-02-16 03:32:37,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2023-02-16 03:32:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:32:37,379 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:37,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:37,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 03:32:37,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462335, now seen corresponding path program 1 times [2023-02-16 03:32:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:37,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462668990] [2023-02-16 03:32:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:37,532 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-16 03:32:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:37,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462668990] [2023-02-16 03:32:37,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462668990] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:37,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:37,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:32:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087625764] [2023-02-16 03:32:37,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:37,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:32:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:32:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:32:37,534 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:37,785 INFO L93 Difference]: Finished difference Result 235 states and 268 transitions. [2023-02-16 03:32:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:32:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-16 03:32:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:37,786 INFO L225 Difference]: With dead ends: 235 [2023-02-16 03:32:37,786 INFO L226 Difference]: Without dead ends: 235 [2023-02-16 03:32:37,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:32:37,786 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 263 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:37,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 397 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:32:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-02-16 03:32:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 150. [2023-02-16 03:32:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 149 states have internal predecessors, (174), 0 states have call successors, (0), 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-16 03:32:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2023-02-16 03:32:37,789 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 23 [2023-02-16 03:32:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:37,789 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2023-02-16 03:32:37,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2023-02-16 03:32:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:32:37,789 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:37,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:37,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 03:32:37,790 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash 375423567, now seen corresponding path program 1 times [2023-02-16 03:32:37,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:37,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600805733] [2023-02-16 03:32:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:37,938 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-16 03:32:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:37,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600805733] [2023-02-16 03:32:37,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600805733] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:37,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:37,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:32:37,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979961245] [2023-02-16 03:32:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:37,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:32:37,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:37,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:32:37,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:37,941 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) 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-16 03:32:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:38,163 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2023-02-16 03:32:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:32:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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 25 [2023-02-16 03:32:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:38,165 INFO L225 Difference]: With dead ends: 225 [2023-02-16 03:32:38,165 INFO L226 Difference]: Without dead ends: 225 [2023-02-16 03:32:38,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:32:38,165 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 235 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:38,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 360 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-16 03:32:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2023-02-16 03:32:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 155 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2023-02-16 03:32:38,167 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 25 [2023-02-16 03:32:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:38,168 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2023-02-16 03:32:38,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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-16 03:32:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2023-02-16 03:32:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:32:38,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:38,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:38,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 03:32:38,168 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 729704446, now seen corresponding path program 1 times [2023-02-16 03:32:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:38,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338552272] [2023-02-16 03:32:38,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:38,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:38,284 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-16 03:32:38,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:38,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338552272] [2023-02-16 03:32:38,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338552272] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:38,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:38,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:32:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272242494] [2023-02-16 03:32:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:38,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:32:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:32:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:32:38,285 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-16 03:32:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:38,651 INFO L93 Difference]: Finished difference Result 318 states and 365 transitions. [2023-02-16 03:32:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:32:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-16 03:32:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:38,652 INFO L225 Difference]: With dead ends: 318 [2023-02-16 03:32:38,652 INFO L226 Difference]: Without dead ends: 318 [2023-02-16 03:32:38,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-02-16 03:32:38,653 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 353 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:38,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 497 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:32:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-02-16 03:32:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 169. [2023-02-16 03:32:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.356164383561644) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2023-02-16 03:32:38,656 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 27 [2023-02-16 03:32:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:38,656 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2023-02-16 03:32:38,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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-16 03:32:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2023-02-16 03:32:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:32:38,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:38,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:38,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 03:32:38,656 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:38,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:38,657 INFO L85 PathProgramCache]: Analyzing trace with hash 729704447, now seen corresponding path program 1 times [2023-02-16 03:32:38,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:38,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296164133] [2023-02-16 03:32:38,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:38,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:38,904 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-16 03:32:38,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:38,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296164133] [2023-02-16 03:32:38,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296164133] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:38,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:38,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:32:38,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56226020] [2023-02-16 03:32:38,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:38,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:32:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:38,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:32:38,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:32:38,906 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-16 03:32:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:39,319 INFO L93 Difference]: Finished difference Result 251 states and 287 transitions. [2023-02-16 03:32:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:32:39,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-16 03:32:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:39,320 INFO L225 Difference]: With dead ends: 251 [2023-02-16 03:32:39,320 INFO L226 Difference]: Without dead ends: 251 [2023-02-16 03:32:39,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:32:39,321 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 302 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:39,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 524 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:32:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-16 03:32:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 169. [2023-02-16 03:32:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2023-02-16 03:32:39,325 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 27 [2023-02-16 03:32:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:39,325 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2023-02-16 03:32:39,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-16 03:32:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2023-02-16 03:32:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:32:39,325 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:39,326 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:39,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 03:32:39,326 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1443803627, now seen corresponding path program 1 times [2023-02-16 03:32:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:39,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156947593] [2023-02-16 03:32:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:39,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:39,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156947593] [2023-02-16 03:32:39,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156947593] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:39,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:39,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414340074] [2023-02-16 03:32:39,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:39,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:32:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:39,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:32:39,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:32:39,352 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-16 03:32:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:39,365 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2023-02-16 03:32:39,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:32:39,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-16 03:32:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:39,366 INFO L225 Difference]: With dead ends: 181 [2023-02-16 03:32:39,367 INFO L226 Difference]: Without dead ends: 181 [2023-02-16 03:32:39,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:39,367 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 317 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-16 03:32:39,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 317 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:32:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-16 03:32:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2023-02-16 03:32:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 172 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2023-02-16 03:32:39,370 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 27 [2023-02-16 03:32:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:39,370 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2023-02-16 03:32:39,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-16 03:32:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2023-02-16 03:32:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:32:39,371 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:39,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:39,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-16 03:32:39,371 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash 17756513, now seen corresponding path program 1 times [2023-02-16 03:32:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:39,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337492592] [2023-02-16 03:32:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:39,441 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-16 03:32:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:39,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337492592] [2023-02-16 03:32:39,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337492592] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:39,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:39,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443095124] [2023-02-16 03:32:39,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:39,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:32:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:32:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:39,443 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-16 03:32:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:39,537 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2023-02-16 03:32:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:32:39,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-16 03:32:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:39,538 INFO L225 Difference]: With dead ends: 182 [2023-02-16 03:32:39,538 INFO L226 Difference]: Without dead ends: 182 [2023-02-16 03:32:39,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:39,538 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 11 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:39,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-16 03:32:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2023-02-16 03:32:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 171 states have internal predecessors, (199), 0 states have call successors, (0), 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-16 03:32:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2023-02-16 03:32:39,540 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 28 [2023-02-16 03:32:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:39,540 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2023-02-16 03:32:39,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-16 03:32:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2023-02-16 03:32:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:32:39,541 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:39,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:39,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-16 03:32:39,541 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash 17756514, now seen corresponding path program 1 times [2023-02-16 03:32:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:39,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320162221] [2023-02-16 03:32:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:39,654 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-16 03:32:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:39,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320162221] [2023-02-16 03:32:39,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320162221] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:39,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:39,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:32:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764787507] [2023-02-16 03:32:39,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:39,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:32:39,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:32:39,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:39,655 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-16 03:32:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:39,764 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2023-02-16 03:32:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:32:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-16 03:32:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:39,765 INFO L225 Difference]: With dead ends: 171 [2023-02-16 03:32:39,765 INFO L226 Difference]: Without dead ends: 171 [2023-02-16 03:32:39,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:39,765 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:39,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 282 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-16 03:32:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-02-16 03:32:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.32) internal successors, (198), 170 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2023-02-16 03:32:39,768 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 28 [2023-02-16 03:32:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:39,768 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2023-02-16 03:32:39,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-16 03:32:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2023-02-16 03:32:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:32:39,768 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:39,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:39,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-16 03:32:39,769 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash -42480305, now seen corresponding path program 1 times [2023-02-16 03:32:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:39,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425290167] [2023-02-16 03:32:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:39,935 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-16 03:32:39,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:39,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425290167] [2023-02-16 03:32:39,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425290167] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:39,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:39,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:32:39,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129319582] [2023-02-16 03:32:39,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:39,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:32:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:39,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:32:39,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:32:39,936 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:40,296 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2023-02-16 03:32:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 03:32:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 03:32:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:40,299 INFO L225 Difference]: With dead ends: 251 [2023-02-16 03:32:40,299 INFO L226 Difference]: Without dead ends: 251 [2023-02-16 03:32:40,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-02-16 03:32:40,299 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 304 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:40,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 636 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:32:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-16 03:32:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2023-02-16 03:32:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 170 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2023-02-16 03:32:40,302 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 29 [2023-02-16 03:32:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:40,302 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2023-02-16 03:32:40,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2023-02-16 03:32:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:32:40,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:40,302 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:40,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 03:32:40,302 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:40,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash 439757914, now seen corresponding path program 1 times [2023-02-16 03:32:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:40,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246612888] [2023-02-16 03:32:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:40,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246612888] [2023-02-16 03:32:40,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246612888] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:32:40,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950508909] [2023-02-16 03:32:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:40,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:32:40,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:32:40,447 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-16 03:32:40,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 03:32:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:40,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 03:32:40,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:32:40,612 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-16 03:32:40,616 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-16 03:32:40,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:40,634 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 21 treesize of output 20 [2023-02-16 03:32:40,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:40,651 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 21 treesize of output 20 [2023-02-16 03:32:40,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:40,674 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 21 treesize of output 20 [2023-02-16 03:32:40,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:40,681 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 21 treesize of output 20 [2023-02-16 03:32:40,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:40,694 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 21 treesize of output 20 [2023-02-16 03:32:40,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:40,700 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 21 treesize of output 20 [2023-02-16 03:32:40,779 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:32:40,779 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:32:40,783 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:32:40,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:32:40,785 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 15 treesize of output 10 [2023-02-16 03:32:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:40,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:32:41,126 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 10 treesize of output 8 [2023-02-16 03:32:41,137 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 14 treesize of output 12 [2023-02-16 03:32:41,148 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 10 treesize of output 8 [2023-02-16 03:32:41,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:32:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:41,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950508909] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:32:41,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:32:41,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-02-16 03:32:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646667821] [2023-02-16 03:32:41,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:32:41,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:32:41,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:32:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:32:41,161 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 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-16 03:32:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:41,460 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2023-02-16 03:32:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:32:41,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 03:32:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:41,461 INFO L225 Difference]: With dead ends: 212 [2023-02-16 03:32:41,461 INFO L226 Difference]: Without dead ends: 212 [2023-02-16 03:32:41,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:32:41,462 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:41,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 517 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:32:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-16 03:32:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 184. [2023-02-16 03:32:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.3006134969325154) internal successors, (212), 183 states have internal predecessors, (212), 0 states have call successors, (0), 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-16 03:32:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2023-02-16 03:32:41,464 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2023-02-16 03:32:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:41,464 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2023-02-16 03:32:41,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 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-16 03:32:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2023-02-16 03:32:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:32:41,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:41,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:41,473 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-16 03:32:41,670 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,SelfDestructingSolverStorable22 [2023-02-16 03:32:41,670 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:41,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:41,670 INFO L85 PathProgramCache]: Analyzing trace with hash -469775188, now seen corresponding path program 1 times [2023-02-16 03:32:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:41,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922460456] [2023-02-16 03:32:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:41,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:41,789 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-16 03:32:41,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:41,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922460456] [2023-02-16 03:32:41,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922460456] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:41,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:41,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:32:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009445664] [2023-02-16 03:32:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:41,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:32:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:32:41,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:32:41,790 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:42,036 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2023-02-16 03:32:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:32:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 03:32:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:42,037 INFO L225 Difference]: With dead ends: 232 [2023-02-16 03:32:42,037 INFO L226 Difference]: Without dead ends: 232 [2023-02-16 03:32:42,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:32:42,038 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 71 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:42,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 455 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:32:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-16 03:32:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2023-02-16 03:32:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 189 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-16 03:32:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2023-02-16 03:32:42,041 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 31 [2023-02-16 03:32:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:42,041 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2023-02-16 03:32:42,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:32:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2023-02-16 03:32:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 03:32:42,042 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:42,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:42,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-16 03:32:42,042 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 605010984, now seen corresponding path program 1 times [2023-02-16 03:32:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:42,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886349676] [2023-02-16 03:32:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:42,415 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-16 03:32:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:42,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886349676] [2023-02-16 03:32:42,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886349676] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:42,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:42,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-16 03:32:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521523484] [2023-02-16 03:32:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:42,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:32:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:32:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:32:42,417 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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-16 03:32:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:43,058 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2023-02-16 03:32:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:32:43,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-16 03:32:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:43,059 INFO L225 Difference]: With dead ends: 223 [2023-02-16 03:32:43,059 INFO L226 Difference]: Without dead ends: 223 [2023-02-16 03:32:43,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2023-02-16 03:32:43,060 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 189 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:43,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 691 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:32:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-16 03:32:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 187. [2023-02-16 03:32:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 186 states have internal predecessors, (214), 0 states have call successors, (0), 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-16 03:32:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2023-02-16 03:32:43,062 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 34 [2023-02-16 03:32:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:43,062 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2023-02-16 03:32:43,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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-16 03:32:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2023-02-16 03:32:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:32:43,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:43,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:43,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-16 03:32:43,062 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:43,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1443725027, now seen corresponding path program 1 times [2023-02-16 03:32:43,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:43,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484463395] [2023-02-16 03:32:43,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:43,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:32:43,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:43,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484463395] [2023-02-16 03:32:43,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484463395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:43,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:43,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:32:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259562961] [2023-02-16 03:32:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:43,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:32:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:32:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:32:43,164 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:32:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:43,304 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2023-02-16 03:32:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:32:43,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-02-16 03:32:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:43,305 INFO L225 Difference]: With dead ends: 234 [2023-02-16 03:32:43,306 INFO L226 Difference]: Without dead ends: 234 [2023-02-16 03:32:43,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:32:43,306 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 149 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:43,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 335 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-16 03:32:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 204. [2023-02-16 03:32:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 203 states have internal predecessors, (232), 0 states have call successors, (0), 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-16 03:32:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2023-02-16 03:32:43,309 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 36 [2023-02-16 03:32:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:43,309 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2023-02-16 03:32:43,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:32:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2023-02-16 03:32:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:32:43,309 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:43,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:43,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-16 03:32:43,310 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1443714042, now seen corresponding path program 1 times [2023-02-16 03:32:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:43,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968628224] [2023-02-16 03:32:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:32:43,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:43,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968628224] [2023-02-16 03:32:43,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968628224] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:43,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:32:43,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:32:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449470151] [2023-02-16 03:32:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:43,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:32:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:43,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:32:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:32:43,366 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:32:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:43,456 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2023-02-16 03:32:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:32:43,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-02-16 03:32:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:43,457 INFO L225 Difference]: With dead ends: 221 [2023-02-16 03:32:43,457 INFO L226 Difference]: Without dead ends: 221 [2023-02-16 03:32:43,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:32:43,458 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 125 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:43,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 136 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:32:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-02-16 03:32:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2023-02-16 03:32:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 205 states have internal predecessors, (234), 0 states have call successors, (0), 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-16 03:32:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2023-02-16 03:32:43,460 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 36 [2023-02-16 03:32:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:43,461 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2023-02-16 03:32:43,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:32:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2023-02-16 03:32:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:32:43,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:43,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:43,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-16 03:32:43,462 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1805802628, now seen corresponding path program 1 times [2023-02-16 03:32:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800482753] [2023-02-16 03:32:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:43,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800482753] [2023-02-16 03:32:43,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800482753] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:32:43,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711402944] [2023-02-16 03:32:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:43,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:32:43,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:32:43,725 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-16 03:32:43,728 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-16 03:32:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:43,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:32:43,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:32:43,855 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-16 03:32:44,030 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-16 03:32:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:32:44,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:32:44,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711402944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:32:44,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:32:44,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2023-02-16 03:32:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401762399] [2023-02-16 03:32:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:32:44,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:32:44,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:44,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:32:44,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:32:44,044 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-16 03:32:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:44,302 INFO L93 Difference]: Finished difference Result 227 states and 255 transitions. [2023-02-16 03:32:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:32:44,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-02-16 03:32:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:44,304 INFO L225 Difference]: With dead ends: 227 [2023-02-16 03:32:44,304 INFO L226 Difference]: Without dead ends: 227 [2023-02-16 03:32:44,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:32:44,304 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 171 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:44,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 286 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:32:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-16 03:32:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 207. [2023-02-16 03:32:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 186 states have (on average 1.2634408602150538) internal successors, (235), 206 states have internal predecessors, (235), 0 states have call successors, (0), 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-16 03:32:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2023-02-16 03:32:44,307 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 37 [2023-02-16 03:32:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:44,307 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2023-02-16 03:32:44,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-16 03:32:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2023-02-16 03:32:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:32:44,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:44,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:44,315 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-16 03:32:44,508 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,SelfDestructingSolverStorable27 [2023-02-16 03:32:44,509 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash -145306369, now seen corresponding path program 1 times [2023-02-16 03:32:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:44,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897681517] [2023-02-16 03:32:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:44,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:44,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897681517] [2023-02-16 03:32:44,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897681517] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:32:44,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199254553] [2023-02-16 03:32:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:44,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:32:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:32:44,758 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-16 03:32:44,760 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-16 03:32:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:44,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-16 03:32:44,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:32:44,877 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-16 03:32:45,069 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-16 03:32:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:45,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:32:45,243 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2023-02-16 03:32:45,243 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 18 treesize of output 17 [2023-02-16 03:32:45,326 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-16 03:32:45,329 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 16 treesize of output 12 [2023-02-16 03:32:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:45,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199254553] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:32:45,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:32:45,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2023-02-16 03:32:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095347737] [2023-02-16 03:32:45,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:32:45,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 03:32:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:32:45,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 03:32:45,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2023-02-16 03:32:45,351 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 0 states have call successors, (0), 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-16 03:32:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:32:46,098 INFO L93 Difference]: Finished difference Result 303 states and 330 transitions. [2023-02-16 03:32:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 03:32:46,099 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 0 states have call successors, (0), 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 38 [2023-02-16 03:32:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:32:46,100 INFO L225 Difference]: With dead ends: 303 [2023-02-16 03:32:46,100 INFO L226 Difference]: Without dead ends: 303 [2023-02-16 03:32:46,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2023-02-16 03:32:46,101 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 525 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:32:46,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1061 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:32:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-02-16 03:32:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 237. [2023-02-16 03:32:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 216 states have (on average 1.2916666666666667) internal successors, (279), 236 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-16 03:32:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 279 transitions. [2023-02-16 03:32:46,105 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 279 transitions. Word has length 38 [2023-02-16 03:32:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:32:46,105 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 279 transitions. [2023-02-16 03:32:46,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 0 states have call successors, (0), 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-16 03:32:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2023-02-16 03:32:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:32:46,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:32:46,105 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:32:46,121 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-16 03:32:46,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-16 03:32:46,306 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:32:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:32:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858598, now seen corresponding path program 1 times [2023-02-16 03:32:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:32:46,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149510076] [2023-02-16 03:32:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:32:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:32:46,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149510076] [2023-02-16 03:32:46,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149510076] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:32:46,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006722368] [2023-02-16 03:32:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:32:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:32:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:32:46,780 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-16 03:32:46,782 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-16 03:32:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:32:46,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-16 03:32:46,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:32:46,898 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-16 03:32:46,913 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-16 03:32:46,917 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-16 03:32:46,987 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:32:46,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:32:47,047 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-16 03:32:47,047 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 1 case distinctions, treesize of input 21 treesize of output 26 [2023-02-16 03:32:47,072 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-16 03:32:47,073 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 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:32:47,224 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:32:47,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2023-02-16 03:32:47,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-16 03:32:47,417 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:32:47,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2023-02-16 03:32:47,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:32:47,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2023-02-16 03:32:47,512 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:32:47,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2023-02-16 03:32:47,521 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:32:47,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2023-02-16 03:32:47,551 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:32:47,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2023-02-16 03:32:47,560 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:32:47,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2023-02-16 03:32:47,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:32:47,776 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 76 treesize of output 70 [2023-02-16 03:32:48,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-16 03:32:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:32:48,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:32:48,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1097 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1097) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1098 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) 1))) (forall ((v_ArrVal_1098 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (or (= (select |c_#valid| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)))))) is different from false [2023-02-16 03:32:48,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1098 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) 1)) (forall ((v_ArrVal_1097 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1097) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1098 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (or (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse1) 1)))))) is different from false [2023-02-16 03:32:48,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1092))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1098)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)))) (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1091 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1092))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1098 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse3 .cse4 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) 1)) (forall ((v_ArrVal_1097 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1091) .cse4 v_ArrVal_1097) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-02-16 03:32:48,351 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1091 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1092))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1097 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1091) .cse1 v_ArrVal_1097) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1098 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse3 .cse1 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) 1)))))) (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1092))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1098)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse4) 1)))))) is different from false [2023-02-16 03:32:48,374 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1091 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1092))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1097 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1091) .cse0 v_ArrVal_1097) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1098 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse2 .cse0 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1)))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1092))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1098)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse4) 1)))))) is different from false [2023-02-16 03:32:48,636 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-02-16 03:32:48,636 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 2 case distinctions, treesize of input 48 treesize of output 61 [2023-02-16 03:32:48,650 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-16 03:32:48,652 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 2 case distinctions, treesize of input 89 treesize of output 68 [2023-02-16 03:32:48,662 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:32:48,663 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 368 treesize of output 246 [2023-02-16 03:32:48,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:32:48,675 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 53 treesize of output 53 [2023-02-16 03:32:48,679 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 44 treesize of output 36 [2023-02-16 03:32:48,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:32:48,686 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 109 treesize of output 95 [2023-02-16 03:32:48,689 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-16 03:32:48,692 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 12 treesize of output 8 [2023-02-16 03:32:48,745 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-16 03:32:48,746 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 2 case distinctions, treesize of input 102 treesize of output 68 [2023-02-16 03:32:48,751 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:32:48,752 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 535 treesize of output 357 [2023-02-16 03:32:48,762 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 339 treesize of output 307 [2023-02-16 03:32:48,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:32:48,769 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 307 treesize of output 277 [2023-02-16 03:33:25,193 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 32 DAG size of output: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:33:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:33:25,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006722368] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:33:25,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:33:25,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 43 [2023-02-16 03:33:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328226007] [2023-02-16 03:33:25,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:33:25,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-16 03:33:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:33:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-16 03:33:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1260, Unknown=17, NotChecked=390, Total=1892 [2023-02-16 03:33:25,210 INFO L87 Difference]: Start difference. First operand 237 states and 279 transitions. Second operand has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 44 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-16 03:33:54,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:33:56,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:33:58,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:34:00,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:34:02,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:34:04,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:34:06,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:34:08,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:34:10,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:34:12,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:34:14,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:34:16,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 03:34:18,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:34:20,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:35:13,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:35:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:25,678 INFO L93 Difference]: Finished difference Result 593 states and 691 transitions. [2023-02-16 03:35:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-16 03:35:25,679 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 44 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 38 [2023-02-16 03:35:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:25,681 INFO L225 Difference]: With dead ends: 593 [2023-02-16 03:35:25,681 INFO L226 Difference]: Without dead ends: 593 [2023-02-16 03:35:25,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 96.7s TimeCoverageRelationStatistics Valid=1708, Invalid=6441, Unknown=61, NotChecked=910, Total=9120 [2023-02-16 03:35:25,683 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 1276 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 171 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 3841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 1520 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:25,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1469 Invalid, 3841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2087 Invalid, 63 Unknown, 1520 Unchecked, 36.7s Time] [2023-02-16 03:35:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-02-16 03:35:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 289. [2023-02-16 03:35:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 268 states have (on average 1.2723880597014925) internal successors, (341), 288 states have internal predecessors, (341), 0 states have call successors, (0), 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-16 03:35:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 341 transitions. [2023-02-16 03:35:25,687 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 341 transitions. Word has length 38 [2023-02-16 03:35:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:25,687 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 341 transitions. [2023-02-16 03:35:25,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.441860465116279) internal successors, (105), 44 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-16 03:35:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 341 transitions. [2023-02-16 03:35:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:35:25,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:25,688 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:25,705 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-16 03:35:25,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:25,889 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 117734209, now seen corresponding path program 1 times [2023-02-16 03:35:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:25,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645676135] [2023-02-16 03:35:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:26,304 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-16 03:35:26,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:26,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645676135] [2023-02-16 03:35:26,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645676135] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:26,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338780818] [2023-02-16 03:35:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:26,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:26,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:26,306 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-16 03:35:26,307 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-16 03:35:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:26,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-16 03:35:26,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:27,119 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:27,120 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:35:27,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:27,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:27,131 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 15 treesize of output 10 [2023-02-16 03:35:27,184 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-16 03:35:27,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:35:27,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:27,714 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 42 treesize of output 45 [2023-02-16 03:35:27,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:27,760 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 38 treesize of output 41 [2023-02-16 03:35:28,456 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-16 03:35:28,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338780818] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:35:28,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:35:28,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-02-16 03:35:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105832347] [2023-02-16 03:35:28,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:35:28,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 03:35:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 03:35:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:35:28,472 INFO L87 Difference]: Start difference. First operand 289 states and 341 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 03:35:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:31,406 INFO L93 Difference]: Finished difference Result 401 states and 466 transitions. [2023-02-16 03:35:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 03:35:31,406 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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 39 [2023-02-16 03:35:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:31,407 INFO L225 Difference]: With dead ends: 401 [2023-02-16 03:35:31,407 INFO L226 Difference]: Without dead ends: 401 [2023-02-16 03:35:31,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2023-02-16 03:35:31,409 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 646 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 76 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:31,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 859 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 876 Invalid, 3 Unknown, 0 Unchecked, 2.1s Time] [2023-02-16 03:35:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-02-16 03:35:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 316. [2023-02-16 03:35:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 295 states have (on average 1.271186440677966) internal successors, (375), 315 states have internal predecessors, (375), 0 states have call successors, (0), 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-16 03:35:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 375 transitions. [2023-02-16 03:35:31,413 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 375 transitions. Word has length 39 [2023-02-16 03:35:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:31,413 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 375 transitions. [2023-02-16 03:35:31,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 03:35:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 375 transitions. [2023-02-16 03:35:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:35:31,414 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:31,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:31,421 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-16 03:35:31,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:31,619 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash -645207573, now seen corresponding path program 1 times [2023-02-16 03:35:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:31,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592085542] [2023-02-16 03:35:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:31,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:31,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592085542] [2023-02-16 03:35:31,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592085542] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:31,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691973732] [2023-02-16 03:35:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:31,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:31,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:31,821 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-16 03:35:31,829 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-16 03:35:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:31,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:35:31,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:32,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 15 treesize of output 14 [2023-02-16 03:35:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:32,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:35:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:32,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691973732] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:35:32,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:35:32,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-16 03:35:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101141664] [2023-02-16 03:35:32,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:35:32,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:32,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:32,716 INFO L87 Difference]: Start difference. First operand 316 states and 375 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:33,387 INFO L93 Difference]: Finished difference Result 328 states and 386 transitions. [2023-02-16 03:35:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:35:33,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-16 03:35:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:33,388 INFO L225 Difference]: With dead ends: 328 [2023-02-16 03:35:33,388 INFO L226 Difference]: Without dead ends: 298 [2023-02-16 03:35:33,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:33,389 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 31 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:33,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 294 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:35:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-02-16 03:35:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-02-16 03:35:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 277 states have (on average 1.2815884476534296) internal successors, (355), 297 states have internal predecessors, (355), 0 states have call successors, (0), 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-16 03:35:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 355 transitions. [2023-02-16 03:35:33,392 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 355 transitions. Word has length 40 [2023-02-16 03:35:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:33,392 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 355 transitions. [2023-02-16 03:35:33,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 355 transitions. [2023-02-16 03:35:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:35:33,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:33,392 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:33,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-16 03:35:33,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:33,597 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:33,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1766771785, now seen corresponding path program 1 times [2023-02-16 03:35:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:33,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117924668] [2023-02-16 03:35:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:33,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:35,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:35,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117924668] [2023-02-16 03:35:35,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117924668] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:35,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620794149] [2023-02-16 03:35:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:35,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:35,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:35,755 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-16 03:35:35,755 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-16 03:35:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:35,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-16 03:35:35,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:35,890 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-16 03:35:36,001 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-16 03:35:36,015 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-16 03:35:36,258 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:35:36,258 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-16 03:35:36,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:35:36,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:35:36,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:35:36,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:35:36,690 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:36,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-16 03:35:36,708 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 27 treesize of output 27 [2023-02-16 03:35:37,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:35:37,035 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 23 treesize of output 23 [2023-02-16 03:35:37,064 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:37,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-16 03:35:37,244 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:37,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-16 03:35:37,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:35:37,260 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 23 treesize of output 23 [2023-02-16 03:35:37,334 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:37,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-16 03:35:37,342 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 27 treesize of output 27 [2023-02-16 03:35:37,849 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:37,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:35:37,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2023-02-16 03:35:37,880 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2023-02-16 03:35:37,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 27 [2023-02-16 03:35:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:37,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:35:38,215 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1340 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:35:38,287 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1340 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-16 03:35:38,304 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1341) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1340 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1340) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:35:38,332 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1341)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1335) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1340) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:35:38,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1341)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1335) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1334) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1340) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:35:38,389 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1341)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1335) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1340) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:35:40,815 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:40,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:40,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2023-02-16 03:35:40,836 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:40,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:40,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-02-16 03:35:40,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:40,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2023-02-16 03:35:40,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:40,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:40,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 100 [2023-02-16 03:35:40,879 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 62 treesize of output 54 [2023-02-16 03:35:40,886 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 54 treesize of output 50 [2023-02-16 03:35:40,892 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 72 treesize of output 60 [2023-02-16 03:35:40,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:40,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:40,937 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-16 03:35:40,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2023-02-16 03:35:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:41,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620794149] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:35:41,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:35:41,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 38 [2023-02-16 03:35:41,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467578365] [2023-02-16 03:35:41,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:35:41,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 03:35:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 03:35:41,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=838, Unknown=10, NotChecked=390, Total=1406 [2023-02-16 03:35:41,026 INFO L87 Difference]: Start difference. First operand 298 states and 355 transitions. Second operand has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 states have internal predecessors, (112), 0 states have call successors, (0), 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-16 03:35:44,673 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse7 (= (select .cse0 .cse3) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse10 (= (select .cse9 .cse3) |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (= 0 (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_13|))) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_13|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1334))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1341)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.base|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1334))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1341)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1335) (select (select (store .cse5 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1340) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.offset|)) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7) (exists ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (let ((.cse8 (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~x~0#1.base| .cse8) (= (select .cse0 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.offset|) (not (<= (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse8))))) .cse10 .cse7 (= (select .cse6 .cse11) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select .cse2 .cse11) |c_ULTIMATE.start_main_~x~0#1.base|) (or (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1335) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_13|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1334) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1340) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_13|))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) is different from false [2023-02-16 03:35:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:48,971 INFO L93 Difference]: Finished difference Result 950 states and 1126 transitions. [2023-02-16 03:35:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-02-16 03:35:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 states have internal predecessors, (112), 0 states have call successors, (0), 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 40 [2023-02-16 03:35:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:48,974 INFO L225 Difference]: With dead ends: 950 [2023-02-16 03:35:48,974 INFO L226 Difference]: Without dead ends: 950 [2023-02-16 03:35:48,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=858, Invalid=3448, Unknown=12, NotChecked=938, Total=5256 [2023-02-16 03:35:48,975 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 918 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1685 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:48,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1413 Invalid, 3408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1592 Invalid, 0 Unknown, 1685 Unchecked, 3.9s Time] [2023-02-16 03:35:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2023-02-16 03:35:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 334. [2023-02-16 03:35:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 313 states have (on average 1.2715654952076678) internal successors, (398), 333 states have internal predecessors, (398), 0 states have call successors, (0), 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-16 03:35:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 398 transitions. [2023-02-16 03:35:49,008 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 398 transitions. Word has length 40 [2023-02-16 03:35:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:49,009 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 398 transitions. [2023-02-16 03:35:49,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 states have internal predecessors, (112), 0 states have call successors, (0), 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-16 03:35:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 398 transitions. [2023-02-16 03:35:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:35:49,009 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:49,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:49,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-16 03:35:49,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:49,212 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1739978080, now seen corresponding path program 1 times [2023-02-16 03:35:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:49,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348119093] [2023-02-16 03:35:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:49,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348119093] [2023-02-16 03:35:49,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348119093] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:49,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:49,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:35:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581790012] [2023-02-16 03:35:49,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:49,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:35:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:35:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:35:49,654 INFO L87 Difference]: Start difference. First operand 334 states and 398 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-16 03:35:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:50,877 INFO L93 Difference]: Finished difference Result 363 states and 426 transitions. [2023-02-16 03:35:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:35:50,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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 42 [2023-02-16 03:35:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:50,879 INFO L225 Difference]: With dead ends: 363 [2023-02-16 03:35:50,879 INFO L226 Difference]: Without dead ends: 358 [2023-02-16 03:35:50,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:35:50,879 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 185 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:50,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 368 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 03:35:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-02-16 03:35:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 330. [2023-02-16 03:35:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 309 states have (on average 1.2718446601941749) internal successors, (393), 329 states have internal predecessors, (393), 0 states have call successors, (0), 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-16 03:35:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 393 transitions. [2023-02-16 03:35:50,883 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 393 transitions. Word has length 42 [2023-02-16 03:35:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:50,884 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 393 transitions. [2023-02-16 03:35:50,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-16 03:35:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 393 transitions. [2023-02-16 03:35:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:35:50,884 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:50,884 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:50,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-16 03:35:50,885 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:50,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 25746790, now seen corresponding path program 1 times [2023-02-16 03:35:50,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:50,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716121865] [2023-02-16 03:35:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:50,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:52,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:52,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716121865] [2023-02-16 03:35:52,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716121865] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:52,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575028919] [2023-02-16 03:35:52,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:52,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:52,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:52,067 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-16 03:35:52,067 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-16 03:35:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:52,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-16 03:35:52,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:52,205 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-16 03:35:52,292 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:35:52,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:35:52,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:35:52,503 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:52,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-16 03:35:52,747 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-16 03:35:52,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2023-02-16 03:35:52,902 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-16 03:35:52,903 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 1 case distinctions, treesize of input 43 treesize of output 36 [2023-02-16 03:35:53,388 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:53,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 79 [2023-02-16 03:35:54,020 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:54,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 100 [2023-02-16 03:35:54,391 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:54,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 100 [2023-02-16 03:35:54,560 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:54,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 100 [2023-02-16 03:35:55,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-16 03:35:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:55,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:35:55,521 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-16 03:35:55,563 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-16 03:35:55,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1519)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-16 03:35:55,879 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1516 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1519 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1519)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-16 03:35:55,900 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1516 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (v_ArrVal_1519 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_1516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1519)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2023-02-16 03:35:55,933 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1516 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (v_ArrVal_1519 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_1516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1519)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2023-02-16 03:35:55,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1516 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1512 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (v_ArrVal_1519 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1512))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_1516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1519)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2023-02-16 03:35:56,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:56,096 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 95 treesize of output 66 [2023-02-16 03:35:56,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:56,122 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 96 treesize of output 92 [2023-02-16 03:35:56,136 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 51 treesize of output 47 [2023-02-16 03:35:56,144 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 90 treesize of output 82 [2023-02-16 03:35:56,157 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 57 treesize of output 49 [2023-02-16 03:35:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:35:58,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575028919] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:35:58,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:35:58,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 38 [2023-02-16 03:35:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111493293] [2023-02-16 03:35:58,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:35:58,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-16 03:35:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:58,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-16 03:35:58,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=819, Unknown=21, NotChecked=462, Total=1482 [2023-02-16 03:35:58,965 INFO L87 Difference]: Start difference. First operand 330 states and 393 transitions. Second operand has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 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-16 03:36:03,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (= 1 .cse0) (forall ((v_ArrVal_1516 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1519 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1516))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1519)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 1)) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc7#1.base| .cse4)) (= (select |c_#valid| (select .cse2 .cse3)) 1) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse3)) (= (select |c_#valid| (select .cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) 1) (not (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= .cse0 1) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) is different from false [2023-02-16 03:36:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:12,532 INFO L93 Difference]: Finished difference Result 693 states and 823 transitions. [2023-02-16 03:36:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-16 03:36:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 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 42 [2023-02-16 03:36:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:12,534 INFO L225 Difference]: With dead ends: 693 [2023-02-16 03:36:12,535 INFO L226 Difference]: Without dead ends: 693 [2023-02-16 03:36:12,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 58 SyntacticMatches, 15 SemanticMatches, 66 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=632, Invalid=2918, Unknown=22, NotChecked=984, Total=4556 [2023-02-16 03:36:12,536 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 539 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 4186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2250 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:12,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1450 Invalid, 4186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1842 Invalid, 0 Unknown, 2250 Unchecked, 6.6s Time] [2023-02-16 03:36:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-02-16 03:36:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 347. [2023-02-16 03:36:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 326 states have (on average 1.2668711656441718) internal successors, (413), 346 states have internal predecessors, (413), 0 states have call successors, (0), 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-16 03:36:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 413 transitions. [2023-02-16 03:36:12,543 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 413 transitions. Word has length 42 [2023-02-16 03:36:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:12,543 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 413 transitions. [2023-02-16 03:36:12,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 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-16 03:36:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 413 transitions. [2023-02-16 03:36:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:36:12,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:12,544 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:36:12,551 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-16 03:36:12,750 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,SelfDestructingSolverStorable34 [2023-02-16 03:36:12,751 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:36:12,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash 25746791, now seen corresponding path program 1 times [2023-02-16 03:36:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:12,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872314113] [2023-02-16 03:36:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:16,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872314113] [2023-02-16 03:36:16,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872314113] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:16,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881820036] [2023-02-16 03:36:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:16,326 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-16 03:36:16,327 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-16 03:36:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:16,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-16 03:36:16,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:16,468 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-16 03:36:16,661 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-16 03:36:16,758 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:36:16,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:36:16,945 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-16 03:36:16,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:36:17,494 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:17,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2023-02-16 03:36:17,523 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 22 treesize of output 24 [2023-02-16 03:36:17,960 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-02-16 03:36:17,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:36:18,111 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-16 03:36:18,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:36:18,409 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-16 03:36:18,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:36:18,520 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-16 03:36:18,521 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 1 case distinctions, treesize of input 43 treesize of output 36 [2023-02-16 03:36:19,500 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:19,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 87 [2023-02-16 03:36:19,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-16 03:36:20,658 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:20,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 107 [2023-02-16 03:36:20,706 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:20,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2023-02-16 03:36:21,260 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:21,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 107 [2023-02-16 03:36:21,308 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:21,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2023-02-16 03:36:21,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:21,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 107 [2023-02-16 03:36:21,544 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:21,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2023-02-16 03:36:22,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:36:22,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-16 03:36:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:23,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:23,718 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1672) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1673 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-02-16 03:36:23,853 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1673 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1672) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2023-02-16 03:36:24,358 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1666))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1667) .cse0 v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1672) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1667) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1666) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2023-02-16 03:36:24,392 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1667) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1666) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1666))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1667) .cse2 v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1672) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))))) is different from false [2023-02-16 03:36:24,450 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1667) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1666) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1666))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1667) .cse3 v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1672) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) is different from false [2023-02-16 03:36:32,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:32,956 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 184 treesize of output 175 [2023-02-16 03:36:32,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:32,976 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 164 treesize of output 115 [2023-02-16 03:36:32,990 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:32,995 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 376 treesize of output 372 [2023-02-16 03:36:33,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:33,008 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 438 treesize of output 428 [2023-02-16 03:36:33,020 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 498 treesize of output 482 [2023-02-16 03:36:33,043 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 328 treesize of output 308 [2023-02-16 03:36:33,055 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 544 treesize of output 524 [2023-02-16 03:36:33,066 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 524 treesize of output 492 [2023-02-16 03:36:33,077 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 573 treesize of output 549 [2023-02-16 03:36:33,116 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 320 treesize of output 300 [2023-02-16 03:36:33,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:33,972 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 90 treesize of output 81 [2023-02-16 03:36:33,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:33,992 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 70 treesize of output 61 [2023-02-16 03:36:34,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:34,010 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 160 treesize of output 156 [2023-02-16 03:36:34,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:34,022 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 126 treesize of output 120 [2023-02-16 03:36:34,042 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 77 treesize of output 69 [2023-02-16 03:36:34,052 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 122 treesize of output 114 [2023-02-16 03:36:34,071 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 63 treesize of output 59 [2023-02-16 03:36:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:37,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881820036] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:37,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:37,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 45 [2023-02-16 03:36:37,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048962298] [2023-02-16 03:36:37,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:37,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-16 03:36:37,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:37,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-16 03:36:37,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1409, Unknown=33, NotChecked=410, Total=2070 [2023-02-16 03:36:37,749 INFO L87 Difference]: Start difference. First operand 347 states and 413 transitions. Second operand has 46 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 46 states have internal predecessors, (124), 0 states have call successors, (0), 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-16 03:36:41,021 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse7 (select .cse5 .cse2)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1667) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1666) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1666))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1667) .cse3 v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1672) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (= 0 (select .cse5 |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_19| Int)) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse5 |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1667) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1666) |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|))))) (<= 0 .cse7) (<= (+ .cse7 4) (select |c_#length| (select .cse6 .cse2))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_19| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1666))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse5 |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1667) .cse8 v_ArrVal_1673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_19| 16) (select (select (store .cse9 .cse8 v_ArrVal_1672) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) is different from false