./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.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/list-simple/dll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:43:06,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:43:06,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:43:06,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:43:06,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:43:06,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:43:06,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:43:06,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:43:06,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:43:06,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:43:06,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:43:06,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:43:06,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:43:06,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:43:06,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:43:06,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:43:06,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:43:06,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:43:06,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:43:06,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:43:06,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:43:06,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:43:06,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:43:06,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:43:06,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:43:06,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:43:06,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:43:06,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:43:06,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:43:06,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:43:06,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:43:06,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:43:06,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:43:06,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:43:06,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:43:06,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:43:06,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:43:06,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:43:06,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:43:06,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:43:06,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:43:06,988 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:43:07,011 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:43:07,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:43:07,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:43:07,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:43:07,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:43:07,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:43:07,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:43:07,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:43:07,014 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:43:07,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:43:07,015 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:43:07,015 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:43:07,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:43:07,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:43:07,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:43:07,015 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:43:07,015 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:43:07,015 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:43:07,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:43:07,016 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:43:07,016 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:43:07,016 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:43:07,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:43:07,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:43:07,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:43:07,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:43:07,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:43:07,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:43:07,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:43:07,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:43:07,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:43:07,018 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:43:07,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:43:07,018 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:43:07,018 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2023-02-16 03:43:07,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:43:07,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:43:07,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:43:07,277 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:43:07,277 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:43:07,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-02-16 03:43:08,466 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:43:08,678 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:43:08,685 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-02-16 03:43:08,694 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd8ac657/4a5faa763cb34539a773fb8435960803/FLAG57d78e846 [2023-02-16 03:43:08,703 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd8ac657/4a5faa763cb34539a773fb8435960803 [2023-02-16 03:43:08,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:43:08,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:43:08,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:43:08,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:43:08,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:43:08,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d0b035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08, skipping insertion in model container [2023-02-16 03:43:08,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:43:08,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:43:08,896 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2023-02-16 03:43:08,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:43:08,904 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:43:08,929 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2023-02-16 03:43:08,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:43:08,947 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:43:08,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08 WrapperNode [2023-02-16 03:43:08,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:43:08,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:43:08,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:43:08,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:43:08,952 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:43:08" (1/1) ... [2023-02-16 03:43:08,961 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:43:08" (1/1) ... [2023-02-16 03:43:08,975 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-02-16 03:43:08,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:43:08,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:43:08,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:43:08,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:43:08,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,991 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:43:08,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:43:08,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:43:08,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:43:08,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (1/1) ... [2023-02-16 03:43:08,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:43:09,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:09,027 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:43:09,069 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:43:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:43:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:43:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 03:43:09,096 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 03:43:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:43:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:43:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:43:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:43:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:43:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:43:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:43:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:43:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:43:09,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:43:09,233 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:43:09,234 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:43:09,516 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:43:09,529 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:43:09,529 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 03:43:09,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:43:09 BoogieIcfgContainer [2023-02-16 03:43:09,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:43:09,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:43:09,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:43:09,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:43:09,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:43:08" (1/3) ... [2023-02-16 03:43:09,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd83365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:43:09, skipping insertion in model container [2023-02-16 03:43:09,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:43:08" (2/3) ... [2023-02-16 03:43:09,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd83365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:43:09, skipping insertion in model container [2023-02-16 03:43:09,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:43:09" (3/3) ... [2023-02-16 03:43:09,543 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2023-02-16 03:43:09,554 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:43:09,554 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-02-16 03:43:09,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:43:09,585 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;@47f9e42b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:43:09,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-02-16 03:43:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:43:09,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:09,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:43:09,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:09,596 INFO L85 PathProgramCache]: Analyzing trace with hash 895303154, now seen corresponding path program 1 times [2023-02-16 03:43:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:09,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156268868] [2023-02-16 03:43:09,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,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:43:09,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:09,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156268868] [2023-02-16 03:43:09,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156268868] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:09,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:09,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:43:09,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327287431] [2023-02-16 03:43:09,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:09,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:43:09,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:43:09,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:43:09,831 INFO L87 Difference]: Start difference. First operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:43:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:09,950 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2023-02-16 03:43:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:43:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:43:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:09,957 INFO L225 Difference]: With dead ends: 127 [2023-02-16 03:43:09,957 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 03:43:09,958 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:43:09,960 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:09,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 03:43:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-02-16 03:43:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 63 states have (on average 2.0) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2023-02-16 03:43:09,985 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2023-02-16 03:43:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:09,986 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2023-02-16 03:43:09,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:43:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2023-02-16 03:43:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:43:09,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:09,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:43:09,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:43:09,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash 895303155, now seen corresponding path program 1 times [2023-02-16 03:43:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386032996] [2023-02-16 03:43:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,044 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:43:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:10,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386032996] [2023-02-16 03:43:10,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386032996] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:10,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:10,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:43:10,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62615723] [2023-02-16 03:43:10,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:10,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:43:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:10,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:43:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:43:10,047 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:43:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:10,107 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2023-02-16 03:43:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:43:10,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:43:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:10,108 INFO L225 Difference]: With dead ends: 121 [2023-02-16 03:43:10,108 INFO L226 Difference]: Without dead ends: 121 [2023-02-16 03:43:10,109 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:43:10,110 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:10,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-16 03:43:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-16 03:43:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-16 03:43:10,132 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 6 [2023-02-16 03:43:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:10,133 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-16 03:43:10,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:43:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-16 03:43:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:43:10,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:10,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:10,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:43:10,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1495162356, now seen corresponding path program 1 times [2023-02-16 03:43:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:10,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100342445] [2023-02-16 03:43:10,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,223 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:43:10,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:10,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100342445] [2023-02-16 03:43:10,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100342445] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:10,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:10,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:43:10,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754637865] [2023-02-16 03:43:10,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:10,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:43:10,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:43:10,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:43:10,225 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:43:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:10,313 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2023-02-16 03:43:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:43:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-16 03:43:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:10,315 INFO L225 Difference]: With dead ends: 132 [2023-02-16 03:43:10,315 INFO L226 Difference]: Without dead ends: 132 [2023-02-16 03:43:10,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:43:10,316 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:10,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-16 03:43:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2023-02-16 03:43:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-16 03:43:10,323 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2023-02-16 03:43:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:10,323 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-16 03:43:10,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:43:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-16 03:43:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:43:10,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:10,324 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:10,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:43:10,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192736, now seen corresponding path program 1 times [2023-02-16 03:43:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:10,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453206868] [2023-02-16 03:43:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:10,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:10,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453206868] [2023-02-16 03:43:10,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453206868] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:10,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:10,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:10,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262520803] [2023-02-16 03:43:10,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:10,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:10,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:10,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:10,503 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:43:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:10,696 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-02-16 03:43:10,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:10,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-16 03:43:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:10,698 INFO L225 Difference]: With dead ends: 122 [2023-02-16 03:43:10,698 INFO L226 Difference]: Without dead ends: 122 [2023-02-16 03:43:10,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:10,699 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:10,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 394 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:43:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-16 03:43:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2023-02-16 03:43:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 64 states have (on average 1.921875) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-16 03:43:10,703 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2023-02-16 03:43:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:10,703 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-16 03:43:10,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:43:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-16 03:43:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:43:10,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:10,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:10,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:43:10,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192737, now seen corresponding path program 1 times [2023-02-16 03:43:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:10,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873161869] [2023-02-16 03:43:10,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:10,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:10,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873161869] [2023-02-16 03:43:10,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873161869] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:10,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:10,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585295260] [2023-02-16 03:43:10,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:10,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:10,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:10,907 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:43:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:11,100 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2023-02-16 03:43:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-16 03:43:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:11,101 INFO L225 Difference]: With dead ends: 121 [2023-02-16 03:43:11,101 INFO L226 Difference]: Without dead ends: 121 [2023-02-16 03:43:11,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:11,102 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 19 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:11,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 418 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:43:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-16 03:43:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2023-02-16 03:43:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.90625) internal successors, (122), 115 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2023-02-16 03:43:11,106 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 24 [2023-02-16 03:43:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:11,106 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2023-02-16 03:43:11,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:43:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2023-02-16 03:43:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:43:11,106 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:11,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:11,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:43:11,107 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash -408475519, now seen corresponding path program 1 times [2023-02-16 03:43:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:11,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618235536] [2023-02-16 03:43:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:11,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618235536] [2023-02-16 03:43:11,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618235536] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:11,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280136132] [2023-02-16 03:43:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:11,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:11,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:11,339 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:43:11,344 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:43:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:43:11,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:11,464 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:43:11,534 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:43:11,599 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:11,600 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:43:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-16 03:43:11,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:11,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280136132] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:11,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:11,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-16 03:43:11,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964831786] [2023-02-16 03:43:11,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:11,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:43:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:11,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:43:11,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-16 03:43:11,674 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:11,955 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2023-02-16 03:43:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:11,956 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-02-16 03:43:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:11,956 INFO L225 Difference]: With dead ends: 145 [2023-02-16 03:43:11,956 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 03:43:11,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-02-16 03:43:11,958 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 98 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:11,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 352 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 451 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2023-02-16 03:43:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 03:43:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2023-02-16 03:43:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:43:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2023-02-16 03:43:11,963 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 26 [2023-02-16 03:43:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:11,963 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2023-02-16 03:43:11,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2023-02-16 03:43:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:43:11,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:11,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:11,970 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:43:12,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-16 03:43:12,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash -408475518, now seen corresponding path program 1 times [2023-02-16 03:43:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:12,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022213273] [2023-02-16 03:43:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:12,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:12,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022213273] [2023-02-16 03:43:12,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022213273] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:12,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155175023] [2023-02-16 03:43:12,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:12,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:12,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:12,530 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:43:12,531 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:43:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:12,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-16 03:43:12,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:12,646 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:43:12,649 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:43:12,767 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_494 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_494))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:43:12,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:12,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:12,809 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:43:12,809 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:43:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-16 03:43:12,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:14,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155175023] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:14,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:14,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2023-02-16 03:43:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126312630] [2023-02-16 03:43:14,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:14,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 03:43:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 03:43:14,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2023-02-16 03:43:14,964 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:43:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:15,386 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-16 03:43:15,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:43:15,386 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-02-16 03:43:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:15,387 INFO L225 Difference]: With dead ends: 127 [2023-02-16 03:43:15,387 INFO L226 Difference]: Without dead ends: 127 [2023-02-16 03:43:15,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=73, Invalid=350, Unknown=1, NotChecked=38, Total=462 [2023-02-16 03:43:15,388 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 7 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:15,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 548 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 719 Invalid, 0 Unknown, 123 Unchecked, 0.3s Time] [2023-02-16 03:43:15,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-16 03:43:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-02-16 03:43:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 119 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:43:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2023-02-16 03:43:15,391 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 26 [2023-02-16 03:43:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:15,392 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2023-02-16 03:43:15,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:43:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2023-02-16 03:43:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:43:15,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:15,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:15,398 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:43:15,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-16 03:43:15,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1702795689, now seen corresponding path program 1 times [2023-02-16 03:43:15,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:15,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082170704] [2023-02-16 03:43:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:15,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:15,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:15,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:15,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:15,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082170704] [2023-02-16 03:43:15,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082170704] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:15,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628994257] [2023-02-16 03:43:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:15,704 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:43:15,728 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:43:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:15,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:43:15,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:15,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:15,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628994257] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:43:15,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:43:15,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-16 03:43:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144267999] [2023-02-16 03:43:15,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:15,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:15,885 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:43:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:15,989 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2023-02-16 03:43:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-16 03:43:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:15,990 INFO L225 Difference]: With dead ends: 126 [2023-02-16 03:43:15,990 INFO L226 Difference]: Without dead ends: 126 [2023-02-16 03:43:15,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:15,991 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:15,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 612 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-16 03:43:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2023-02-16 03:43:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 119 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:43:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2023-02-16 03:43:15,994 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 28 [2023-02-16 03:43:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:15,994 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2023-02-16 03:43:15,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:43:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2023-02-16 03:43:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:43:15,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:15,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:16,015 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:43:16,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:16,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839470, now seen corresponding path program 1 times [2023-02-16 03:43:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:16,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33813253] [2023-02-16 03:43:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:16,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:43:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:16,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33813253] [2023-02-16 03:43:16,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33813253] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:16,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937625498] [2023-02-16 03:43:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:16,283 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:43:16,285 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:43:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:16,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:43:16,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:43:16,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:16,406 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:43:16,407 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 12 treesize of output 11 [2023-02-16 03:43:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:43:16,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937625498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:43:16,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:43:16,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-16 03:43:16,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062377811] [2023-02-16 03:43:16,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:16,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:43:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:16,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:43:16,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:43:16,422 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:16,566 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2023-02-16 03:43:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:16,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-16 03:43:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:16,567 INFO L225 Difference]: With dead ends: 130 [2023-02-16 03:43:16,567 INFO L226 Difference]: Without dead ends: 130 [2023-02-16 03:43:16,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:16,568 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 11 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:16,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 398 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-16 03:43:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2023-02-16 03:43:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 122 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:43:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2023-02-16 03:43:16,571 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 29 [2023-02-16 03:43:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:16,571 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2023-02-16 03:43:16,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2023-02-16 03:43:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:43:16,572 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:16,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:16,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 03:43:16,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:16,782 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839469, now seen corresponding path program 1 times [2023-02-16 03:43:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:16,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630215233] [2023-02-16 03:43:16,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:16,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630215233] [2023-02-16 03:43:16,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630215233] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:16,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439834327] [2023-02-16 03:43:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:16,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:16,950 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:43:16,952 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:43:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:17,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:43:17,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:17,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:17,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:43:17,140 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 20 treesize of output 24 [2023-02-16 03:43:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:17,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439834327] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:43:17,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:43:17,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2023-02-16 03:43:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494121971] [2023-02-16 03:43:17,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:17,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:43:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:17,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:43:17,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:43:17,227 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:43:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:17,422 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2023-02-16 03:43:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:43:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-02-16 03:43:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:17,423 INFO L225 Difference]: With dead ends: 135 [2023-02-16 03:43:17,423 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 03:43:17,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:43:17,424 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 27 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:17,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 971 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:43:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 03:43:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2023-02-16 03:43:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:43:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2023-02-16 03:43:17,427 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 29 [2023-02-16 03:43:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:17,427 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2023-02-16 03:43:17,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:43:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2023-02-16 03:43:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:43:17,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:17,427 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:17,435 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:43:17,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-16 03:43:17,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:17,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:17,634 INFO L85 PathProgramCache]: Analyzing trace with hash -152317901, now seen corresponding path program 1 times [2023-02-16 03:43:17,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:17,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957428310] [2023-02-16 03:43:17,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:17,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:17,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:17,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957428310] [2023-02-16 03:43:17,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957428310] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:17,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:17,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:43:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129440110] [2023-02-16 03:43:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:17,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:43:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:17,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:43:17,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:17,763 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:43:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:17,957 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2023-02-16 03:43:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:43:17,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-16 03:43:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:17,959 INFO L225 Difference]: With dead ends: 128 [2023-02-16 03:43:17,959 INFO L226 Difference]: Without dead ends: 128 [2023-02-16 03:43:17,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:43:17,959 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 24 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:17,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 438 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:43:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-16 03:43:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2023-02-16 03:43:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:43:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2023-02-16 03:43:17,962 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2023-02-16 03:43:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:17,962 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-16 03:43:17,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:43:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2023-02-16 03:43:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:43:17,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:17,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:17,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:43:17,962 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:17,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash -152317900, now seen corresponding path program 1 times [2023-02-16 03:43:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:17,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612919098] [2023-02-16 03:43:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:18,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612919098] [2023-02-16 03:43:18,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612919098] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:18,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:18,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:43:18,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114853323] [2023-02-16 03:43:18,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:18,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:43:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:18,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:43:18,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:18,170 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:43:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:18,398 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2023-02-16 03:43:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:43:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-16 03:43:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:18,399 INFO L225 Difference]: With dead ends: 126 [2023-02-16 03:43:18,399 INFO L226 Difference]: Without dead ends: 126 [2023-02-16 03:43:18,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:43:18,400 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 20 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:18,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:43:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-16 03:43:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-02-16 03:43:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.8028169014084507) internal successors, (128), 120 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:43:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-02-16 03:43:18,402 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 30 [2023-02-16 03:43:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:18,402 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-02-16 03:43:18,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:43:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-02-16 03:43:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:43:18,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:18,403 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:18,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:43:18,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1115824007, now seen corresponding path program 1 times [2023-02-16 03:43:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:18,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447570322] [2023-02-16 03:43:18,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-16 03:43:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 03:43:18,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447570322] [2023-02-16 03:43:18,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447570322] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:18,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496612619] [2023-02-16 03:43:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:18,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:18,495 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:43:18,497 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:43:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:43:18,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:43:18,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:43:18,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496612619] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:18,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:43:18,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-16 03:43:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621362356] [2023-02-16 03:43:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:18,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:43:18,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:43:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:43:18,652 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:18,659 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2023-02-16 03:43:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:43:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-16 03:43:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:18,661 INFO L225 Difference]: With dead ends: 114 [2023-02-16 03:43:18,661 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 03:43:18,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:43:18,662 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 144 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:43:18,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:43:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 03:43:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-16 03:43:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.78125) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2023-02-16 03:43:18,666 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 41 [2023-02-16 03:43:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:18,666 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2023-02-16 03:43:18,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2023-02-16 03:43:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:43:18,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:18,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:18,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:18,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:18,875 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195673, now seen corresponding path program 1 times [2023-02-16 03:43:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:18,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289870548] [2023-02-16 03:43:18,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:18,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:19,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:19,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 03:43:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:19,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289870548] [2023-02-16 03:43:19,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289870548] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:19,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123542630] [2023-02-16 03:43:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:19,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:19,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:19,183 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:43:19,185 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:43:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:19,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-16 03:43:19,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:19,342 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:43:19,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:19,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:19,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-02-16 03:43:19,431 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-16 03:43:19,451 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:19,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:19,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:19,556 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-16 03:43:19,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2023-02-16 03:43:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2023-02-16 03:43:19,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:19,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123542630] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:19,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:19,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2023-02-16 03:43:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125888832] [2023-02-16 03:43:19,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:19,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 03:43:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 03:43:19,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2023-02-16 03:43:19,708 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:20,081 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2023-02-16 03:43:20,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:43:20,081 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2023-02-16 03:43:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:20,082 INFO L225 Difference]: With dead ends: 124 [2023-02-16 03:43:20,082 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 03:43:20,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=487, Unknown=1, NotChecked=46, Total=650 [2023-02-16 03:43:20,083 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 342 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:20,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 333 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 491 Invalid, 0 Unknown, 105 Unchecked, 0.3s Time] [2023-02-16 03:43:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 03:43:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2023-02-16 03:43:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.65625) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2023-02-16 03:43:20,085 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 43 [2023-02-16 03:43:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:20,085 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2023-02-16 03:43:20,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2023-02-16 03:43:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:43:20,085 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:20,085 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:20,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:20,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:20,290 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195672, now seen corresponding path program 1 times [2023-02-16 03:43:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:20,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497988245] [2023-02-16 03:43:20,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:20,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:20,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:20,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497988245] [2023-02-16 03:43:20,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497988245] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:20,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331079559] [2023-02-16 03:43:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:20,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:20,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:20,759 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:43:20,760 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:43:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:20,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:43:20,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:20,926 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:43:20,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:20,954 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1821 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1821))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:43:20,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:20,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:21,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:21,013 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:43:21,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:21,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:21,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:21,088 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:43:21,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:21,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-16 03:43:21,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:23,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331079559] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:23,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:23,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2023-02-16 03:43:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624414868] [2023-02-16 03:43:23,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:23,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 03:43:23,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 03:43:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=287, Unknown=3, NotChecked=108, Total=462 [2023-02-16 03:43:23,217 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:23,530 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2023-02-16 03:43:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:43:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2023-02-16 03:43:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:23,531 INFO L225 Difference]: With dead ends: 116 [2023-02-16 03:43:23,531 INFO L226 Difference]: Without dead ends: 116 [2023-02-16 03:43:23,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=110, Invalid=451, Unknown=3, NotChecked=138, Total=702 [2023-02-16 03:43:23,532 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 488 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:23,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 146 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 348 Unchecked, 0.2s Time] [2023-02-16 03:43:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-16 03:43:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2023-02-16 03:43:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.53125) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2023-02-16 03:43:23,534 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 43 [2023-02-16 03:43:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:23,534 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2023-02-16 03:43:23,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2023-02-16 03:43:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:43:23,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:23,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:23,543 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:43:23,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 03:43:23,741 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 226108014, now seen corresponding path program 1 times [2023-02-16 03:43:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715095361] [2023-02-16 03:43:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:23,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-16 03:43:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715095361] [2023-02-16 03:43:23,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715095361] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:23,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:23,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185089430] [2023-02-16 03:43:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:23,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:23,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:23,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:23,850 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:23,985 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2023-02-16 03:43:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:23,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-02-16 03:43:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:23,986 INFO L225 Difference]: With dead ends: 112 [2023-02-16 03:43:23,986 INFO L226 Difference]: Without dead ends: 112 [2023-02-16 03:43:23,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:23,986 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:23,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 259 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-16 03:43:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2023-02-16 03:43:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.46875) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2023-02-16 03:43:23,988 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 46 [2023-02-16 03:43:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:23,989 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2023-02-16 03:43:23,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2023-02-16 03:43:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:43:23,989 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:23,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:23,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 03:43:23,989 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:23,989 INFO L85 PathProgramCache]: Analyzing trace with hash 226108015, now seen corresponding path program 1 times [2023-02-16 03:43:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:23,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949713161] [2023-02-16 03:43:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 03:43:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949713161] [2023-02-16 03:43:24,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949713161] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:24,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:24,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385258638] [2023-02-16 03:43:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:24,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:24,196 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:24,320 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2023-02-16 03:43:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:24,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-02-16 03:43:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:24,321 INFO L225 Difference]: With dead ends: 90 [2023-02-16 03:43:24,321 INFO L226 Difference]: Without dead ends: 90 [2023-02-16 03:43:24,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:24,322 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 67 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:24,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 270 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-16 03:43:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-16 03:43:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.40625) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-16 03:43:24,323 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2023-02-16 03:43:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:24,324 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-16 03:43:24,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-16 03:43:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:43:24,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:24,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:24,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 03:43:24,324 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:24,325 INFO L85 PathProgramCache]: Analyzing trace with hash 226118937, now seen corresponding path program 1 times [2023-02-16 03:43:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:24,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712123837] [2023-02-16 03:43:24,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 03:43:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:24,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712123837] [2023-02-16 03:43:24,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712123837] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:24,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63395096] [2023-02-16 03:43:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:24,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:24,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:24,806 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:43:24,808 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:43:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-16 03:43:24,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:25,012 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:43:25,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-16 03:43:25,233 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2367 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2367))))) is different from true [2023-02-16 03:43:25,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:25,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:43:25,256 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-16 03:43:25,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:43:25,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:43:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:43:25,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:25,374 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2373 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_52| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_52| v_ArrVal_2373) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_52| |c_#StackHeapBarrier|)))) is different from false [2023-02-16 03:43:25,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63395096] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:25,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:25,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-02-16 03:43:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499747259] [2023-02-16 03:43:25,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:25,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-16 03:43:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:25,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-16 03:43:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=573, Unknown=3, NotChecked=98, Total=756 [2023-02-16 03:43:25,376 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:25,910 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2023-02-16 03:43:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:43:25,911 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-16 03:43:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:25,911 INFO L225 Difference]: With dead ends: 107 [2023-02-16 03:43:25,911 INFO L226 Difference]: Without dead ends: 107 [2023-02-16 03:43:25,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=952, Unknown=5, NotChecked=130, Total=1260 [2023-02-16 03:43:25,912 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 389 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:25,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 452 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 715 Invalid, 3 Unknown, 111 Unchecked, 0.4s Time] [2023-02-16 03:43:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-16 03:43:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2023-02-16 03:43:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.390625) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-16 03:43:25,914 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2023-02-16 03:43:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:25,914 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-16 03:43:25,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-16 03:43:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:43:25,914 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:25,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:25,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:26,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-16 03:43:26,121 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash 226118938, now seen corresponding path program 1 times [2023-02-16 03:43:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364076832] [2023-02-16 03:43:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:26,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:26,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:27,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:27,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364076832] [2023-02-16 03:43:27,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364076832] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:27,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102427681] [2023-02-16 03:43:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:27,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:27,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:27,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:43:27,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 03:43:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:27,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-16 03:43:27,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:27,292 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:43:27,296 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:43:27,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:43:27,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:43:27,729 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2614 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2613 (Array Int Int))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2614)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2613)))) is different from true [2023-02-16 03:43:27,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:27,756 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:43:27,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:27,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-16 03:43:27,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:27,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-16 03:43:27,772 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 03:43:27,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-16 03:43:27,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:43:27,825 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 24 treesize of output 12 [2023-02-16 03:43:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:43:27,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102427681] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:28,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:28,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2023-02-16 03:43:28,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204559377] [2023-02-16 03:43:28,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:28,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:43:28,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:43:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=896, Unknown=1, NotChecked=60, Total=1056 [2023-02-16 03:43:28,554 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:29,739 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-02-16 03:43:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:43:29,739 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-16 03:43:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:29,743 INFO L225 Difference]: With dead ends: 88 [2023-02-16 03:43:29,743 INFO L226 Difference]: Without dead ends: 88 [2023-02-16 03:43:29,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=199, Invalid=1526, Unknown=1, NotChecked=80, Total=1806 [2023-02-16 03:43:29,744 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 105 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:29,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 814 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1185 Invalid, 0 Unknown, 91 Unchecked, 0.7s Time] [2023-02-16 03:43:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-16 03:43:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-16 03:43:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.375) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-16 03:43:29,768 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 46 [2023-02-16 03:43:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:29,768 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-16 03:43:29,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-16 03:43:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:43:29,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:29,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:29,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:29,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:29,976 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash 280709232, now seen corresponding path program 1 times [2023-02-16 03:43:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:29,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88407166] [2023-02-16 03:43:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:30,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:30,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:30,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88407166] [2023-02-16 03:43:30,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88407166] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:30,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638092163] [2023-02-16 03:43:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:30,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:30,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:30,425 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:43:30,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 03:43:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:30,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-16 03:43:30,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:30,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:43:30,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:30,956 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 26 treesize of output 19 [2023-02-16 03:43:31,002 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:43:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:31,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:31,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638092163] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:31,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:31,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2023-02-16 03:43:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158031570] [2023-02-16 03:43:31,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:31,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-16 03:43:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-16 03:43:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=717, Unknown=3, NotChecked=0, Total=812 [2023-02-16 03:43:31,117 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 27 states, 25 states have (on average 2.64) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:31,530 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-02-16 03:43:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:43:31,530 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.64) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-16 03:43:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:31,531 INFO L225 Difference]: With dead ends: 85 [2023-02-16 03:43:31,531 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:43:31,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=1138, Unknown=3, NotChecked=0, Total=1332 [2023-02-16 03:43:31,531 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 541 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:31,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 525 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:43:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:43:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-16 03:43:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-02-16 03:43:31,533 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 51 [2023-02-16 03:43:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:31,533 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-02-16 03:43:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.64) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-02-16 03:43:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 03:43:31,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:31,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:31,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:31,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:31,735 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:31,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 869466270, now seen corresponding path program 1 times [2023-02-16 03:43:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:31,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53426] [2023-02-16 03:43:31,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:31,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:43:31,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:31,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53426] [2023-02-16 03:43:31,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53426] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:31,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:31,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:31,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463884859] [2023-02-16 03:43:31,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:31,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:31,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:31,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:31,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:31,836 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:31,941 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-02-16 03:43:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:43:31,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2023-02-16 03:43:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:31,942 INFO L225 Difference]: With dead ends: 102 [2023-02-16 03:43:31,942 INFO L226 Difference]: Without dead ends: 102 [2023-02-16 03:43:31,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:43:31,942 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 51 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:31,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 282 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-16 03:43:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2023-02-16 03:43:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.360655737704918) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-16 03:43:31,944 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2023-02-16 03:43:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:31,944 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-16 03:43:31,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-16 03:43:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 03:43:31,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:31,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:31,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-16 03:43:31,945 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 869466271, now seen corresponding path program 1 times [2023-02-16 03:43:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:31,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899616343] [2023-02-16 03:43:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:43:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:32,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899616343] [2023-02-16 03:43:32,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899616343] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:32,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:32,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318002573] [2023-02-16 03:43:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:32,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:32,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:32,108 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:32,218 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-16 03:43:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:43:32,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2023-02-16 03:43:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:32,220 INFO L225 Difference]: With dead ends: 83 [2023-02-16 03:43:32,220 INFO L226 Difference]: Without dead ends: 83 [2023-02-16 03:43:32,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:43:32,221 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 54 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:32,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 292 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-16 03:43:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-16 03:43:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-16 03:43:32,223 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 52 [2023-02-16 03:43:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:32,223 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-16 03:43:32,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-16 03:43:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 03:43:32,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:32,223 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:32,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 03:43:32,223 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650644, now seen corresponding path program 1 times [2023-02-16 03:43:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:32,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180471957] [2023-02-16 03:43:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:33,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:33,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180471957] [2023-02-16 03:43:33,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180471957] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:33,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741246123] [2023-02-16 03:43:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:33,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:33,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:33,386 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:43:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 03:43:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:33,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-16 03:43:33,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:33,695 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:43:33,871 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:43:33,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:43:33,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2023-02-16 03:43:33,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-02-16 03:43:33,991 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:43:33,991 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 7 [2023-02-16 03:43:34,140 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3496)) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3497)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|)) |c_#valid|))) is different from true [2023-02-16 03:43:34,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:34,171 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:34,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-02-16 03:43:34,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:34,176 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 26 treesize of output 28 [2023-02-16 03:43:34,199 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-02-16 03:43:34,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2023-02-16 03:43:34,346 INFO L321 Elim1Store]: treesize reduction 71, result has 26.0 percent of original size [2023-02-16 03:43:34,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 44 [2023-02-16 03:43:34,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:43:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:43:34,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:34,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741246123] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:34,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:34,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 37 [2023-02-16 03:43:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677275892] [2023-02-16 03:43:34,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:34,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 03:43:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:34,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 03:43:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1442, Unknown=1, NotChecked=76, Total=1640 [2023-02-16 03:43:34,609 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 38 states, 35 states have (on average 2.2) internal successors, (77), 33 states have internal predecessors, (77), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:43:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:36,193 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-16 03:43:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 03:43:36,194 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.2) internal successors, (77), 33 states have internal predecessors, (77), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2023-02-16 03:43:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:36,194 INFO L225 Difference]: With dead ends: 100 [2023-02-16 03:43:36,194 INFO L226 Difference]: Without dead ends: 100 [2023-02-16 03:43:36,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=395, Invalid=2914, Unknown=1, NotChecked=112, Total=3422 [2023-02-16 03:43:36,195 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 450 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:36,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 712 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1127 Invalid, 0 Unknown, 84 Unchecked, 0.5s Time] [2023-02-16 03:43:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-16 03:43:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2023-02-16 03:43:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 77 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-16 03:43:36,197 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 53 [2023-02-16 03:43:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:36,198 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-16 03:43:36,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.2) internal successors, (77), 33 states have internal predecessors, (77), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:43:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-16 03:43:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 03:43:36,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:36,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:36,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:36,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-16 03:43:36,405 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650645, now seen corresponding path program 1 times [2023-02-16 03:43:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:36,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870428226] [2023-02-16 03:43:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:37,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:37,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 03:43:37,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:37,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870428226] [2023-02-16 03:43:37,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870428226] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:37,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752743891] [2023-02-16 03:43:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:37,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:37,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:37,903 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:43:37,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 03:43:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:38,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 119 conjunts are in the unsatisfiable core [2023-02-16 03:43:38,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:38,206 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:43:38,209 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:43:38,502 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:38,502 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:43:38,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:38,721 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:43:38,728 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:43:38,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:43:38,898 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2023-02-16 03:43:38,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:43:38,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:43:38,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:39,061 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3792 (Array Int Int)) (v_ArrVal_3793 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3792)) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3793)))) is different from true [2023-02-16 03:43:39,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:39,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:39,090 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:43:39,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-16 03:43:39,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:39,101 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:39,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2023-02-16 03:43:39,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:39,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-02-16 03:43:39,118 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:43:39,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 03:43:39,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:43:39,233 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-16 03:43:39,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 31 [2023-02-16 03:43:39,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:43:39,318 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2023-02-16 03:43:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:43:39,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:39,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752743891] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:39,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:39,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2023-02-16 03:43:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191996357] [2023-02-16 03:43:39,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:39,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-16 03:43:39,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:39,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-16 03:43:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2369, Unknown=1, NotChecked=98, Total=2652 [2023-02-16 03:43:39,693 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 47 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:43:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:41,413 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2023-02-16 03:43:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 03:43:41,413 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-02-16 03:43:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:41,413 INFO L225 Difference]: With dead ends: 99 [2023-02-16 03:43:41,414 INFO L226 Difference]: Without dead ends: 99 [2023-02-16 03:43:41,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=474, Invalid=4085, Unknown=1, NotChecked=132, Total=4692 [2023-02-16 03:43:41,415 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 583 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:41,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 627 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1303 Invalid, 0 Unknown, 83 Unchecked, 0.7s Time] [2023-02-16 03:43:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-16 03:43:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2023-02-16 03:43:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-16 03:43:41,417 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 53 [2023-02-16 03:43:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:41,417 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-16 03:43:41,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:43:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-16 03:43:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-16 03:43:41,418 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:41,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:41,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:41,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-16 03:43:41,626 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:41,627 INFO L85 PathProgramCache]: Analyzing trace with hash -939292314, now seen corresponding path program 1 times [2023-02-16 03:43:41,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:41,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102648124] [2023-02-16 03:43:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:42,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:42,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:42,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:42,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102648124] [2023-02-16 03:43:42,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102648124] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:42,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:42,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-02-16 03:43:42,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871217794] [2023-02-16 03:43:42,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:42,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 03:43:42,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:42,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 03:43:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2023-02-16 03:43:42,550 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:43,405 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2023-02-16 03:43:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 03:43:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2023-02-16 03:43:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:43,406 INFO L225 Difference]: With dead ends: 102 [2023-02-16 03:43:43,406 INFO L226 Difference]: Without dead ends: 102 [2023-02-16 03:43:43,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2023-02-16 03:43:43,407 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 582 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:43,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 468 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:43:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-16 03:43:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2023-02-16 03:43:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-02-16 03:43:43,409 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 58 [2023-02-16 03:43:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:43,409 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-02-16 03:43:43,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-02-16 03:43:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-16 03:43:43,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:43,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:43,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-16 03:43:43,410 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:43,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -939292313, now seen corresponding path program 1 times [2023-02-16 03:43:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:43,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596691896] [2023-02-16 03:43:43,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:43,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:44,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:45,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596691896] [2023-02-16 03:43:45,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596691896] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:45,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692414905] [2023-02-16 03:43:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:45,164 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:43:45,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 03:43:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:45,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 132 conjunts are in the unsatisfiable core [2023-02-16 03:43:45,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:45,444 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:43:45,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:45,587 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:45,588 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:43:45,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:45,767 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:45,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:43:45,958 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:43:46,135 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-16 03:43:46,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 17 [2023-02-16 03:43:46,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:43:46,199 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:43:46,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:46,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-02-16 03:43:46,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:46,517 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:46,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 46 [2023-02-16 03:43:46,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:46,530 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 03:43:46,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-02-16 03:43:47,125 INFO L321 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2023-02-16 03:43:47,126 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 42 [2023-02-16 03:43:47,133 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 25 treesize of output 17 [2023-02-16 03:43:47,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:47,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:47,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:47,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2023-02-16 03:43:47,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 03:43:47,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:47,307 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 7 treesize of output 3 [2023-02-16 03:43:47,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:47,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:47,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:47,441 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 39 treesize of output 38 [2023-02-16 03:43:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:47,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:43:47,510 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 26 treesize of output 14 [2023-02-16 03:43:47,513 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:43:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 7 refuted. 7 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:47,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:47,759 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4297) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4297 (Array Int Int)) (v_ArrVal_4298 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4297) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4298) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-16 03:44:15,960 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 388 treesize of output 326 [2023-02-16 03:44:16,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692414905] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:16,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:44:16,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 62 [2023-02-16 03:44:16,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247042678] [2023-02-16 03:44:16,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:44:16,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-02-16 03:44:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:16,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-02-16 03:44:16,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5502, Unknown=102, NotChecked=150, Total=6006 [2023-02-16 03:44:16,407 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 63 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 54 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:44:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:22,770 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2023-02-16 03:44:22,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-16 03:44:22,770 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 54 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2023-02-16 03:44:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:22,771 INFO L225 Difference]: With dead ends: 104 [2023-02-16 03:44:22,771 INFO L226 Difference]: Without dead ends: 104 [2023-02-16 03:44:22,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=878, Invalid=9734, Unknown=104, NotChecked=204, Total=10920 [2023-02-16 03:44:22,773 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1110 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 69 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:22,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 870 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2107 Invalid, 2 Unknown, 0 Unchecked, 1.7s Time] [2023-02-16 03:44:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-16 03:44:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2023-02-16 03:44:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:44:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-16 03:44:22,775 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2023-02-16 03:44:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:22,776 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-16 03:44:22,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 54 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:44:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-16 03:44:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 03:44:22,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:22,776 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:22,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-16 03:44:22,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:22,982 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:44:22,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash -716779287, now seen corresponding path program 1 times [2023-02-16 03:44:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:22,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938468537] [2023-02-16 03:44:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:25,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:25,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 03:44:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938468537] [2023-02-16 03:44:25,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938468537] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127251809] [2023-02-16 03:44:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:25,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:25,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:44:25,860 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:44:25,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-16 03:44:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:26,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 156 conjunts are in the unsatisfiable core [2023-02-16 03:44:26,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:44:26,232 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:44:26,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:44:26,612 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:26,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:44:26,954 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:44:27,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:44:27,267 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 20 [2023-02-16 03:44:27,273 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:44:27,273 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 7 [2023-02-16 03:44:27,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:44:27,505 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:44:27,707 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-02-16 03:44:27,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 03:44:28,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:28,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:28,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:28,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:44:28,743 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2023-02-16 03:44:28,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 55 [2023-02-16 03:44:28,752 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 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-16 03:44:28,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:28,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:28,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:28,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:44:28,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:28,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:28,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2023-02-16 03:44:29,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:29,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-02-16 03:44:29,012 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 19 treesize of output 13 [2023-02-16 03:44:29,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:29,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:29,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:29,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:29,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:44:29,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:29,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:29,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:29,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:29,291 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-16 03:44:29,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 79 [2023-02-16 03:44:29,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:29,297 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 37 treesize of output 32 [2023-02-16 03:44:29,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:29,301 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 18 treesize of output 20 [2023-02-16 03:44:29,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:29,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-02-16 03:44:29,454 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:44:29,640 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:44:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:44:29,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:44:29,869 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4633 Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:29,883 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4633 Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:29,904 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4633 Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4625))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:29,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4625))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:29,942 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4625))) (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:29,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4625))) (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:29,969 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) .cse2 v_ArrVal_4626) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse3 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) .cse2 v_ArrVal_4625))) (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4627) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:30,424 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) .cse2 v_ArrVal_4626) .cse3 v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) .cse2 v_ArrVal_4625))) (store .cse4 .cse3 (store (select .cse4 .cse3) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4627) .cse3 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:30,466 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_4622))) .cse2 v_ArrVal_4626) .cse3 v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4623) .cse2 v_ArrVal_4625))) (store .cse4 .cse3 (store (select .cse4 .cse3) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4627) .cse3 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:30,509 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4622 Int) (v_ArrVal_4633 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4630 (Array Int Int)) (v_ArrVal_4623 (Array Int Int)) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4624 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4625 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4616 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (= (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4616))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_4622))) .cse2 v_ArrVal_4626) .cse3 v_ArrVal_4630))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4) v_ArrVal_4633))) (select (select (store (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4623) .cse2 v_ArrVal_4625))) (store .cse4 .cse3 (store (select .cse4 .cse3) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4627) .cse3 v_ArrVal_4629) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4635) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:30,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:44:30,621 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 324 treesize of output 301 [2023-02-16 03:44:30,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:44:30,781 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 46027806 treesize of output 45495895 [2023-02-16 03:44:32,447 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 47691222 treesize of output 45512150 [2023-02-16 03:44:33,995 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 52098518 treesize of output 46691798 [2023-02-16 03:44:35,472 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 47809750 treesize of output 47125718