./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS --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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:34:07,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:34:07,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:34:07,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:34:07,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:34:07,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:34:07,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:34:07,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:34:07,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:34:07,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:34:07,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:34:07,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:34:07,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:34:07,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:34:07,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:34:07,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:34:07,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:34:07,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:34:07,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:34:07,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:34:07,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:34:07,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:34:07,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:34:07,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:34:07,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:34:07,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:34:07,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:34:07,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:34:07,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:34:07,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:34:07,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:34:07,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:34:07,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:34:07,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:34:07,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:34:07,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:34:07,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:34:07,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:34:07,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:34:07,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:34:07,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:34:07,864 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 02:34:07,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:34:07,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:34:07,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:34:07,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:34:07,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:34:07,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:34:07,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:34:07,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:34:07,916 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:34:07,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:34:07,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:34:07,918 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:34:07,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:34:07,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:34:07,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:34:07,919 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:34:07,919 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:34:07,919 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:34:07,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:34:07,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:34:07,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:34:07,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:34:07,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:34:07,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:34:07,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:34:07,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:34:07,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:34:07,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:34:07,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:34:07,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:34:07,922 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:34:07,923 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:34:07,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:34:07,923 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2022-11-23 02:34:08,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:34:08,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:34:08,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:34:08,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:34:08,320 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:34:08,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-11-23 02:34:12,201 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:34:12,489 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:34:12,490 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-11-23 02:34:12,506 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/data/b7b4c0862/c05144a100154d029542974b7c1ddc75/FLAG344ce7358 [2022-11-23 02:34:12,538 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/data/b7b4c0862/c05144a100154d029542974b7c1ddc75 [2022-11-23 02:34:12,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:34:12,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:34:12,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:34:12,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:34:12,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:34:12,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:34:12" (1/1) ... [2022-11-23 02:34:12,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157450a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:12, skipping insertion in model container [2022-11-23 02:34:12,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:34:12" (1/1) ... [2022-11-23 02:34:12,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:34:12,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:34:12,959 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-11-23 02:34:12,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:34:12,975 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:34:13,077 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-11-23 02:34:13,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:34:13,120 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:34:13,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13 WrapperNode [2022-11-23 02:34:13,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:34:13,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:34:13,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:34:13,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:34:13,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,213 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2022-11-23 02:34:13,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:34:13,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:34:13,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:34:13,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:34:13,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,274 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:34:13,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:34:13,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:34:13,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:34:13,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (1/1) ... [2022-11-23 02:34:13,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:34:13,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:34:13,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:34:13,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:34:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 02:34:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:34:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-23 02:34:13,412 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-23 02:34:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 02:34:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:34:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:34:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 02:34:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 02:34:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:34:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 02:34:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:34:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:34:13,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:34:13,591 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:34:13,610 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:34:14,045 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:34:14,054 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:34:14,054 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-23 02:34:14,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:14 BoogieIcfgContainer [2022-11-23 02:34:14,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:34:14,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:34:14,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:34:14,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:34:14,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:34:12" (1/3) ... [2022-11-23 02:34:14,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369e2b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:34:14, skipping insertion in model container [2022-11-23 02:34:14,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:13" (2/3) ... [2022-11-23 02:34:14,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369e2b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:34:14, skipping insertion in model container [2022-11-23 02:34:14,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:14" (3/3) ... [2022-11-23 02:34:14,079 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2022-11-23 02:34:14,115 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:34:14,116 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-11-23 02:34:14,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:34:14,207 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;@59fce173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:34:14,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-11-23 02:34:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 02:34:14,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:14,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:14,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073593, now seen corresponding path program 1 times [2022-11-23 02:34:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:14,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926624935] [2022-11-23 02:34:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:34:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:14,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926624935] [2022-11-23 02:34:14,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926624935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:14,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:14,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:34:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331621957] [2022-11-23 02:34:14,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:14,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:34:14,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:34:14,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:34:14,708 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:14,842 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-23 02:34:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:34:14,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-23 02:34:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:14,857 INFO L225 Difference]: With dead ends: 71 [2022-11-23 02:34:14,858 INFO L226 Difference]: Without dead ends: 68 [2022-11-23 02:34:14,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:34:14,864 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:14,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:34:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-23 02:34:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-23 02:34:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.7) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-11-23 02:34:14,919 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2022-11-23 02:34:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:14,920 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-11-23 02:34:14,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-11-23 02:34:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 02:34:14,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:14,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:34:14,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073594, now seen corresponding path program 1 times [2022-11-23 02:34:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:14,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783042552] [2022-11-23 02:34:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:34:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:15,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783042552] [2022-11-23 02:34:15,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783042552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:15,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:15,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:34:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713804478] [2022-11-23 02:34:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:15,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:34:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:34:15,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:34:15,153 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:15,246 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-11-23 02:34:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:34:15,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-23 02:34:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:15,251 INFO L225 Difference]: With dead ends: 66 [2022-11-23 02:34:15,251 INFO L226 Difference]: Without dead ends: 66 [2022-11-23 02:34:15,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:34:15,253 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:15,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:34:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-23 02:34:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-23 02:34:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-11-23 02:34:15,265 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-11-23 02:34:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:15,266 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-11-23 02:34:15,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-11-23 02:34:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 02:34:15,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:15,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:15,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:34:15,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:15,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584192, now seen corresponding path program 1 times [2022-11-23 02:34:15,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:15,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783608991] [2022-11-23 02:34:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:15,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:34:15,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:15,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783608991] [2022-11-23 02:34:15,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783608991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:15,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:15,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:34:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728606704] [2022-11-23 02:34:15,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:15,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:34:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:15,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:34:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:34:15,682 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:34:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:15,952 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-23 02:34:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:34:15,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-23 02:34:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:15,956 INFO L225 Difference]: With dead ends: 70 [2022-11-23 02:34:15,956 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 02:34:15,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:34:15,958 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:15,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 249 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:34:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 02:34:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-11-23 02:34:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.625) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-23 02:34:15,970 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 13 [2022-11-23 02:34:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:15,971 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-23 02:34:15,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:34:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-23 02:34:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 02:34:15,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:15,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:15,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:34:15,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584193, now seen corresponding path program 1 times [2022-11-23 02:34:15,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:15,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964891184] [2022-11-23 02:34:15,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:15,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:16,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:34:16,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:16,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964891184] [2022-11-23 02:34:16,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964891184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:16,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:16,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:34:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662430882] [2022-11-23 02:34:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:16,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:34:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:34:16,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:34:16,495 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:34:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:16,744 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-23 02:34:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:34:16,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-23 02:34:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:16,749 INFO L225 Difference]: With dead ends: 69 [2022-11-23 02:34:16,749 INFO L226 Difference]: Without dead ends: 69 [2022-11-23 02:34:16,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:34:16,761 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:16,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:34:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-23 02:34:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-11-23 02:34:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-11-23 02:34:16,769 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2022-11-23 02:34:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:16,769 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-11-23 02:34:16,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:34:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-11-23 02:34:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 02:34:16,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:16,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:16,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:34:16,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:16,778 INFO L85 PathProgramCache]: Analyzing trace with hash 869381824, now seen corresponding path program 1 times [2022-11-23 02:34:16,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:16,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470756326] [2022-11-23 02:34:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:16,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-23 02:34:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:34:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:16,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470756326] [2022-11-23 02:34:16,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470756326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:16,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:16,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:34:16,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583052280] [2022-11-23 02:34:16,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:16,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:34:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:34:16,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:34:16,897 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:34:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:16,982 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-23 02:34:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:34:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-11-23 02:34:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:16,990 INFO L225 Difference]: With dead ends: 70 [2022-11-23 02:34:16,990 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 02:34:16,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:34:16,997 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:16,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 159 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:34:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 02:34:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-11-23 02:34:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-23 02:34:17,007 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 15 [2022-11-23 02:34:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:17,008 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-23 02:34:17,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:34:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-23 02:34:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 02:34:17,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:17,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:17,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:34:17,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -206453950, now seen corresponding path program 1 times [2022-11-23 02:34:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:17,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14244192] [2022-11-23 02:34:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 02:34:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:34:17,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14244192] [2022-11-23 02:34:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14244192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:34:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883889647] [2022-11-23 02:34:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:17,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:34:17,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:34:17,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:34:17,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 02:34:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:17,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:34:17,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:34:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:34:17,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:34:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:34:17,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883889647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:34:17,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:34:17,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-23 02:34:17,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69875252] [2022-11-23 02:34:17,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:34:17,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:34:17,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:34:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:34:17,582 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 02:34:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:17,694 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-23 02:34:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:34:17,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-23 02:34:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:17,696 INFO L225 Difference]: With dead ends: 71 [2022-11-23 02:34:17,696 INFO L226 Difference]: Without dead ends: 71 [2022-11-23 02:34:17,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:34:17,699 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:17,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 158 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:34:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-23 02:34:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-23 02:34:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-11-23 02:34:17,724 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-11-23 02:34:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:17,724 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-11-23 02:34:17,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 02:34:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-11-23 02:34:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 02:34:17,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:17,726 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:17,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:34:17,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:34:17,935 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:17,935 INFO L85 PathProgramCache]: Analyzing trace with hash 400923136, now seen corresponding path program 2 times [2022-11-23 02:34:17,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:17,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048491811] [2022-11-23 02:34:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:17,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:18,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-23 02:34:18,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:18,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048491811] [2022-11-23 02:34:18,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048491811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:18,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:18,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:34:18,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548856091] [2022-11-23 02:34:18,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:18,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:34:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:18,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:34:18,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:34:18,784 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:19,014 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-23 02:34:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:34:19,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-23 02:34:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:19,016 INFO L225 Difference]: With dead ends: 79 [2022-11-23 02:34:19,016 INFO L226 Difference]: Without dead ends: 79 [2022-11-23 02:34:19,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:34:19,018 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 87 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:19,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 147 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:34:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-23 02:34:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2022-11-23 02:34:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.434782608695652) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-11-23 02:34:19,037 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 41 [2022-11-23 02:34:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:19,040 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-11-23 02:34:19,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-11-23 02:34:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 02:34:19,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:19,048 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:19,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:34:19,049 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash 400923137, now seen corresponding path program 1 times [2022-11-23 02:34:19,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:19,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917603421] [2022-11-23 02:34:19,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:19,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 02:34:20,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:20,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917603421] [2022-11-23 02:34:20,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917603421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:34:20,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267663919] [2022-11-23 02:34:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:20,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:34:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:34:20,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:34:20,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 02:34:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:20,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 02:34:20,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:34:20,509 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 [2022-11-23 02:34:20,580 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 [2022-11-23 02:34:20,636 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-11-23 02:34:20,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:20,785 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 [2022-11-23 02:34:20,842 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 [2022-11-23 02:34:20,855 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-11-23 02:34:20,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:20,921 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 [2022-11-23 02:34:21,033 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 [2022-11-23 02:34:21,055 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-11-23 02:34:21,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:21,147 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 [2022-11-23 02:34:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-23 02:34:21,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:34:21,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267663919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:34:21,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:34:21,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2022-11-23 02:34:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456208721] [2022-11-23 02:34:21,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:34:21,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 02:34:21,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 02:34:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2022-11-23 02:34:21,335 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:34:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:21,830 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-11-23 02:34:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:34:21,832 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-23 02:34:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:21,833 INFO L225 Difference]: With dead ends: 75 [2022-11-23 02:34:21,833 INFO L226 Difference]: Without dead ends: 75 [2022-11-23 02:34:21,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552 [2022-11-23 02:34:21,834 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 258 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:21,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 144 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 177 Invalid, 0 Unknown, 162 Unchecked, 0.3s Time] [2022-11-23 02:34:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-23 02:34:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-11-23 02:34:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-11-23 02:34:21,839 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 41 [2022-11-23 02:34:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:21,846 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-11-23 02:34:21,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:34:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-11-23 02:34:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-23 02:34:21,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:21,849 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:21,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:34:22,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:34:22,057 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash -456284671, now seen corresponding path program 1 times [2022-11-23 02:34:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:22,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26242012] [2022-11-23 02:34:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 02:34:22,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:22,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26242012] [2022-11-23 02:34:22,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26242012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:22,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:22,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:34:22,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377720799] [2022-11-23 02:34:22,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:22,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:34:22,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:22,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:34:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:34:22,440 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:34:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:22,586 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-11-23 02:34:22,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:34:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 42 [2022-11-23 02:34:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:22,588 INFO L225 Difference]: With dead ends: 62 [2022-11-23 02:34:22,588 INFO L226 Difference]: Without dead ends: 62 [2022-11-23 02:34:22,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:34:22,589 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:22,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 181 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:34:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-23 02:34:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-23 02:34:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-11-23 02:34:22,593 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 42 [2022-11-23 02:34:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:22,594 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-11-23 02:34:22,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:34:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-11-23 02:34:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-23 02:34:22,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:22,596 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:22,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:34:22,596 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:22,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -456284672, now seen corresponding path program 1 times [2022-11-23 02:34:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:22,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951830840] [2022-11-23 02:34:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 02:34:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:22,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951830840] [2022-11-23 02:34:22,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951830840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:22,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:22,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:34:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379292957] [2022-11-23 02:34:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:22,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:34:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:34:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:34:22,786 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:34:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:22,949 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-11-23 02:34:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:34:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 42 [2022-11-23 02:34:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:22,951 INFO L225 Difference]: With dead ends: 73 [2022-11-23 02:34:22,951 INFO L226 Difference]: Without dead ends: 73 [2022-11-23 02:34:22,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:34:22,952 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:22,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 174 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:34:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-23 02:34:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-11-23 02:34:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-11-23 02:34:22,957 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 42 [2022-11-23 02:34:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:22,957 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-11-23 02:34:22,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:34:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-11-23 02:34:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 02:34:22,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:22,959 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:22,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:34:22,960 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash 866562379, now seen corresponding path program 1 times [2022-11-23 02:34:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:22,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682721373] [2022-11-23 02:34:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:23,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 02:34:23,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:23,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682721373] [2022-11-23 02:34:23,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682721373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:23,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:23,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 02:34:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940489963] [2022-11-23 02:34:23,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:23,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:34:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:34:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:34:23,396 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:23,683 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-11-23 02:34:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:34:23,684 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-11-23 02:34:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:23,685 INFO L225 Difference]: With dead ends: 92 [2022-11-23 02:34:23,685 INFO L226 Difference]: Without dead ends: 92 [2022-11-23 02:34:23,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-23 02:34:23,686 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 192 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:23,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 215 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:34:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-23 02:34:23,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2022-11-23 02:34:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-11-23 02:34:23,690 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 49 [2022-11-23 02:34:23,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:23,691 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-11-23 02:34:23,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-11-23 02:34:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 02:34:23,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:23,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:23,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:34:23,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:23,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:23,694 INFO L85 PathProgramCache]: Analyzing trace with hash 866562380, now seen corresponding path program 1 times [2022-11-23 02:34:23,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:23,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666924617] [2022-11-23 02:34:23,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:23,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:24,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 02:34:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:24,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666924617] [2022-11-23 02:34:24,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666924617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:24,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:24,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 02:34:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763852288] [2022-11-23 02:34:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:24,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:34:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:34:24,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:34:24,349 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:24,675 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-23 02:34:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:34:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-11-23 02:34:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:24,677 INFO L225 Difference]: With dead ends: 84 [2022-11-23 02:34:24,677 INFO L226 Difference]: Without dead ends: 84 [2022-11-23 02:34:24,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-23 02:34:24,678 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 193 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:24,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 233 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:34:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-23 02:34:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2022-11-23 02:34:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.28) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-23 02:34:24,683 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 49 [2022-11-23 02:34:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:24,684 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-23 02:34:24,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-23 02:34:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 02:34:24,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:24,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:24,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 02:34:24,686 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:24,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1093628647, now seen corresponding path program 1 times [2022-11-23 02:34:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:24,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101685417] [2022-11-23 02:34:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 02:34:25,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:25,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101685417] [2022-11-23 02:34:25,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101685417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:25,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:25,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 02:34:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414743827] [2022-11-23 02:34:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:25,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:34:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:25,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:34:25,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:34:25,075 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:25,299 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-11-23 02:34:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:34:25,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-23 02:34:25,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:25,301 INFO L225 Difference]: With dead ends: 67 [2022-11-23 02:34:25,301 INFO L226 Difference]: Without dead ends: 67 [2022-11-23 02:34:25,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-23 02:34:25,302 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 86 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:25,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 291 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:34:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-23 02:34:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-11-23 02:34:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-23 02:34:25,307 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 50 [2022-11-23 02:34:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:25,308 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-23 02:34:25,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-23 02:34:25,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 02:34:25,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:25,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:25,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 02:34:25,310 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:25,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1290611022, now seen corresponding path program 1 times [2022-11-23 02:34:25,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:25,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754724587] [2022-11-23 02:34:25,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:25,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:26,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 02:34:26,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:26,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754724587] [2022-11-23 02:34:26,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754724587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:34:26,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:34:26,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 02:34:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047292577] [2022-11-23 02:34:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:34:26,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 02:34:26,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:26,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 02:34:26,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-23 02:34:26,352 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:26,869 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-23 02:34:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:34:26,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-23 02:34:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:26,871 INFO L225 Difference]: With dead ends: 65 [2022-11-23 02:34:26,871 INFO L226 Difference]: Without dead ends: 65 [2022-11-23 02:34:26,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-11-23 02:34:26,872 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 156 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:26,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 277 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:34:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-23 02:34:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-23 02:34:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-23 02:34:26,875 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 53 [2022-11-23 02:34:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:26,875 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-23 02:34:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:34:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-23 02:34:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-23 02:34:26,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:26,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:26,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 02:34:26,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235562, now seen corresponding path program 1 times [2022-11-23 02:34:26,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:26,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808622981] [2022-11-23 02:34:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:28,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:34:29,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:29,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808622981] [2022-11-23 02:34:29,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808622981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:34:29,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707556069] [2022-11-23 02:34:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:29,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:34:29,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:34:29,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:34:29,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 02:34:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:29,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-23 02:34:29,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:34:30,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-23 02:34:30,017 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 [2022-11-23 02:34:30,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:30,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:30,703 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 22 treesize of output 25 [2022-11-23 02:34:30,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:30,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:30,737 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 24 treesize of output 27 [2022-11-23 02:34:30,771 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-23 02:34:30,771 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 21 treesize of output 29 [2022-11-23 02:34:31,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:31,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:34:31,234 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2022-11-23 02:34:31,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:31,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:34:31,261 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-23 02:34:31,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:31,465 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-23 02:34:31,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:31,484 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-23 02:34:31,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:34:31,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:31,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:34:31,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 40 [2022-11-23 02:34:31,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:31,975 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:34:31,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-23 02:34:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:34:32,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:34:35,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707556069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:34:35,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:34:35,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2022-11-23 02:34:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057485399] [2022-11-23 02:34:35,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:34:35,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-23 02:34:35,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:35,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-23 02:34:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3687, Unknown=0, NotChecked=0, Total=3906 [2022-11-23 02:34:35,469 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:34:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:40,096 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-11-23 02:34:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 02:34:40,097 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-23 02:34:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:40,098 INFO L225 Difference]: With dead ends: 105 [2022-11-23 02:34:40,098 INFO L226 Difference]: Without dead ends: 105 [2022-11-23 02:34:40,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=659, Invalid=6651, Unknown=0, NotChecked=0, Total=7310 [2022-11-23 02:34:40,103 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 585 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:40,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 616 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 02:34:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-23 02:34:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2022-11-23 02:34:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-23 02:34:40,108 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 54 [2022-11-23 02:34:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:40,108 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-23 02:34:40,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:34:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-23 02:34:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-23 02:34:40,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:40,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:40,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 02:34:40,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:34:40,319 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235561, now seen corresponding path program 1 times [2022-11-23 02:34:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:40,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653133881] [2022-11-23 02:34:40,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 02:34:43,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:43,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653133881] [2022-11-23 02:34:43,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653133881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:34:43,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384774985] [2022-11-23 02:34:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:43,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:34:43,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:34:43,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:34:43,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 02:34:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:43,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-23 02:34:43,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:34:44,160 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 [2022-11-23 02:34:44,176 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 [2022-11-23 02:34:44,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:44,784 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 [2022-11-23 02:34:44,796 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:34:44,796 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 [2022-11-23 02:34:44,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:34:44,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:44,822 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 [2022-11-23 02:34:45,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:45,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-23 02:34:45,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:45,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-23 02:34:45,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:45,470 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-23 02:34:45,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:45,479 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-11-23 02:34:45,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:34:45,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:45,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:34:45,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 40 [2022-11-23 02:34:45,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:45,986 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:34:45,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-23 02:34:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:34:46,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:34:48,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384774985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:34:48,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:34:48,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2022-11-23 02:34:48,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540897703] [2022-11-23 02:34:48,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:34:48,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-23 02:34:48,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:34:48,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-23 02:34:48,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3468, Unknown=1, NotChecked=0, Total=3660 [2022-11-23 02:34:48,975 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:34:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:34:55,517 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-23 02:34:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 02:34:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-23 02:34:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:34:55,519 INFO L225 Difference]: With dead ends: 91 [2022-11-23 02:34:55,519 INFO L226 Difference]: Without dead ends: 91 [2022-11-23 02:34:55,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=572, Invalid=6735, Unknown=3, NotChecked=0, Total=7310 [2022-11-23 02:34:55,522 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 670 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:34:55,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 732 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1351 Invalid, 2 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 02:34:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-23 02:34:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2022-11-23 02:34:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:34:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-23 02:34:55,526 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 54 [2022-11-23 02:34:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:34:55,527 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-23 02:34:55,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:34:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-23 02:34:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-23 02:34:55,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:34:55,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:55,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:34:55,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 02:34:55,735 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:34:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 968369212, now seen corresponding path program 1 times [2022-11-23 02:34:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:34:55,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225700690] [2022-11-23 02:34:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:34:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:34:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:34:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:57,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:34:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 02:34:57,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:34:57,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225700690] [2022-11-23 02:34:57,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225700690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:34:57,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666656101] [2022-11-23 02:34:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:34:57,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:34:57,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:34:57,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:34:57,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 02:34:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:57,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-23 02:34:57,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:34:58,133 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 8 treesize of output 4 [2022-11-23 02:34:58,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:58,419 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 17 treesize of output 12 [2022-11-23 02:34:58,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:58,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-23 02:34:58,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:34:58,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:58,827 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-23 02:34:58,924 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 [2022-11-23 02:34:59,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:34:59,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:34:59,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:34:59,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 19 [2022-11-23 02:34:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:34:59,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:34:59,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2022-11-23 02:35:00,489 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (not .cse0) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (v_ArrVal_1695 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1695 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1695) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) 0)))) (not .cse3)) (or (and .cse0 .cse3) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (v_ArrVal_1695 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1695 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1695) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_55)) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (<= (+ v_arrayElimCell_55 1) 0)))))) is different from false [2022-11-23 02:35:00,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666656101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:35:00,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:35:00,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 42 [2022-11-23 02:35:00,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393485300] [2022-11-23 02:35:00,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:35:00,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 02:35:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:35:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 02:35:00,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2104, Unknown=1, NotChecked=92, Total=2352 [2022-11-23 02:35:00,502 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:35:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:35:02,694 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-11-23 02:35:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 02:35:02,695 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2022-11-23 02:35:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:35:02,696 INFO L225 Difference]: With dead ends: 72 [2022-11-23 02:35:02,696 INFO L226 Difference]: Without dead ends: 72 [2022-11-23 02:35:02,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=508, Invalid=4051, Unknown=1, NotChecked=132, Total=4692 [2022-11-23 02:35:02,698 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 463 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:35:02,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 639 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 02:35:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-23 02:35:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-11-23 02:35:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:35:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-23 02:35:02,703 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2022-11-23 02:35:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:35:02,704 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-23 02:35:02,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:35:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-23 02:35:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:35:02,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:35:02,705 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:35:02,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:35:02,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 02:35:02,920 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:35:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:35:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash -567858883, now seen corresponding path program 1 times [2022-11-23 02:35:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:35:02,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783716451] [2022-11-23 02:35:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:35:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:35:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:05,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:35:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:35:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:35:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 02:35:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:35:06,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783716451] [2022-11-23 02:35:06,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783716451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:35:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437706317] [2022-11-23 02:35:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:35:06,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:35:06,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:35:06,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:35:06,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 02:35:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:06,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-23 02:35:06,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:35:07,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:35:07,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:07,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:35:08,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 30 treesize of output 18 [2022-11-23 02:35:08,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 [2022-11-23 02:35:08,014 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 [2022-11-23 02:35:08,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:35:08,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:08,552 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 11 [2022-11-23 02:35:08,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:08,568 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 38 treesize of output 29 [2022-11-23 02:35:08,594 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-23 02:35:08,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-23 02:35:08,601 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 [2022-11-23 02:35:08,629 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:35:08,629 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 [2022-11-23 02:35:09,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:09,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2022-11-23 02:35:09,202 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 [2022-11-23 02:35:09,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:09,218 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-23 02:35:09,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:09,481 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2022-11-23 02:35:09,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:09,492 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 22 treesize of output 24 [2022-11-23 02:35:09,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:09,508 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-23 02:35:10,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:35:10,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:10,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:35:10,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 47 [2022-11-23 02:35:10,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:10,129 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:35:10,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-23 02:35:10,539 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 [2022-11-23 02:35:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:35:10,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:35:13,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437706317] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:35:13,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:35:13,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2022-11-23 02:35:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053919782] [2022-11-23 02:35:13,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:35:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-23 02:35:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:35:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-23 02:35:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3601, Unknown=0, NotChecked=0, Total=3782 [2022-11-23 02:35:13,760 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:35:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:35:18,899 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-23 02:35:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 02:35:18,900 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-11-23 02:35:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:35:18,901 INFO L225 Difference]: With dead ends: 70 [2022-11-23 02:35:18,901 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 02:35:18,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=458, Invalid=6682, Unknown=0, NotChecked=0, Total=7140 [2022-11-23 02:35:18,904 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 295 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:35:18,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 801 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 02:35:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 02:35:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-23 02:35:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:35:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-23 02:35:18,908 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2022-11-23 02:35:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:35:18,909 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-23 02:35:18,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 02:35:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-23 02:35:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-23 02:35:18,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:35:18,910 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:35:18,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:35:19,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 02:35:19,119 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:35:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:35:19,119 INFO L85 PathProgramCache]: Analyzing trace with hash -423755733, now seen corresponding path program 2 times [2022-11-23 02:35:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:35:19,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921644925] [2022-11-23 02:35:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:35:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:35:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:35:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:35:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:22,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:35:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:35:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:35:23,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921644925] [2022-11-23 02:35:23,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921644925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:35:23,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653487111] [2022-11-23 02:35:23,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:35:23,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:35:23,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:35:23,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:35:23,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 02:35:23,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:35:23,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:35:23,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-23 02:35:23,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:35:24,264 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-23 02:35:24,265 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 19 treesize of output 16 [2022-11-23 02:35:24,517 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 [2022-11-23 02:35:25,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:35:25,145 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 23 [2022-11-23 02:35:25,153 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 [2022-11-23 02:35:25,161 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 [2022-11-23 02:35:25,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:25,902 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 [2022-11-23 02:35:25,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:25,925 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:35:25,925 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 54 treesize of output 50 [2022-11-23 02:35:25,975 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-23 02:35:25,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2022-11-23 02:35:26,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:26,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-23 02:35:26,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:26,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:35:26,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:26,689 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:35:26,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 54 [2022-11-23 02:35:27,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:27,017 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:35:27,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 51 [2022-11-23 02:35:27,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:27,037 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-23 02:35:27,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:35:27,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:35:27,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-11-23 02:35:28,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:35:28,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:35:28,855 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-23 02:35:28,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 125 treesize of output 56 [2022-11-23 02:35:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:35:29,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:35:37,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653487111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:35:37,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:35:37,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32] total 66 [2022-11-23 02:35:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381359976] [2022-11-23 02:35:37,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:35:37,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-23 02:35:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:35:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-23 02:35:37,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=6205, Unknown=4, NotChecked=0, Total=6480 [2022-11-23 02:35:37,546 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:35:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:35:52,148 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-23 02:35:52,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 02:35:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 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 59 [2022-11-23 02:35:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:35:52,150 INFO L225 Difference]: With dead ends: 109 [2022-11-23 02:35:52,150 INFO L226 Difference]: Without dead ends: 109 [2022-11-23 02:35:52,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=1064, Invalid=11142, Unknown=4, NotChecked=0, Total=12210 [2022-11-23 02:35:52,156 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 846 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:35:52,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 747 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1913 Invalid, 2 Unknown, 0 Unchecked, 3.2s Time] [2022-11-23 02:35:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-23 02:35:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 72. [2022-11-23 02:35:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:35:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-23 02:35:52,160 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2022-11-23 02:35:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:35:52,161 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-23 02:35:52,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:35:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-23 02:35:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-23 02:35:52,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:35:52,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:35:52,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 02:35:52,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:35:52,371 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:35:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:35:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash -423755732, now seen corresponding path program 2 times [2022-11-23 02:35:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:35:52,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954220591] [2022-11-23 02:35:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:35:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:35:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:55,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:35:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:55,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:35:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:55,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:35:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:35:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:35:57,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:35:57,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954220591] [2022-11-23 02:35:57,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954220591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:35:57,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321244299] [2022-11-23 02:35:57,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:35:57,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:35:57,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:35:57,066 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:35:57,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 02:35:57,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:35:57,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:35:57,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-23 02:35:57,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:35:57,439 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 [2022-11-23 02:35:57,534 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 [2022-11-23 02:35:57,608 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2288 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2288))) is different from true [2022-11-23 02:35:57,621 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2288 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2288))) is different from true [2022-11-23 02:35:57,655 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:35:57,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 02:35:58,146 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 [2022-11-23 02:35:58,153 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:35:58,153 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 [2022-11-23 02:35:58,549 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 02:35:58,549 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 22 treesize of output 33 [2022-11-23 02:35:58,575 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 14 treesize of output 16 [2022-11-23 02:35:58,901 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 [2022-11-23 02:35:58,909 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 [2022-11-23 02:35:59,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:35:59,873 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 83 treesize of output 42 [2022-11-23 02:35:59,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-23 02:35:59,897 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:35:59,898 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 16 treesize of output 10 [2022-11-23 02:36:00,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:00,780 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:36:00,780 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 89 treesize of output 75 [2022-11-23 02:36:00,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:00,813 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:36:00,814 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 50 treesize of output 57 [2022-11-23 02:36:00,842 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-23 02:36:00,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 38 [2022-11-23 02:36:00,857 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 15 treesize of output 11 [2022-11-23 02:36:00,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:00,946 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-23 02:36:00,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-23 02:36:01,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:01,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:01,712 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:36:01,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 61 [2022-11-23 02:36:01,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:01,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2022-11-23 02:36:02,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:02,056 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:36:02,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 60 [2022-11-23 02:36:02,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:02,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:02,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2022-11-23 02:36:02,100 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 15 [2022-11-23 02:36:04,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:04,110 INFO L321 Elim1Store]: treesize reduction 63, result has 20.3 percent of original size [2022-11-23 02:36:04,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 196 treesize of output 102 [2022-11-23 02:36:04,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:36:04,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:36:04,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-11-23 02:36:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 12 refuted. 6 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-23 02:36:05,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:36:16,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321244299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:16,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:36:16,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 72 [2022-11-23 02:36:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10989538] [2022-11-23 02:36:16,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:36:16,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-23 02:36:16,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:16,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-23 02:36:16,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=7195, Unknown=15, NotChecked=342, Total=7832 [2022-11-23 02:36:16,341 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:36:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:36:38,549 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-11-23 02:36:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 02:36:38,550 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 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 59 [2022-11-23 02:36:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:36:38,551 INFO L225 Difference]: With dead ends: 124 [2022-11-23 02:36:38,551 INFO L226 Difference]: Without dead ends: 124 [2022-11-23 02:36:38,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=1004, Invalid=13509, Unknown=15, NotChecked=478, Total=15006 [2022-11-23 02:36:38,553 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1015 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:36:38,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1074 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2714 Invalid, 1 Unknown, 218 Unchecked, 5.1s Time] [2022-11-23 02:36:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-23 02:36:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2022-11-23 02:36:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:36:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-23 02:36:38,558 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2022-11-23 02:36:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:36:38,559 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-23 02:36:38,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:36:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-23 02:36:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 02:36:38,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:36:38,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:36:38,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-23 02:36:38,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:38,768 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:36:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:36:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash -251527161, now seen corresponding path program 2 times [2022-11-23 02:36:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:36:38,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561411457] [2022-11-23 02:36:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:36:38,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:36:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:41,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:36:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:36:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:36:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:36:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:36:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:36:42,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561411457] [2022-11-23 02:36:42,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561411457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:42,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268914906] [2022-11-23 02:36:42,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:36:42,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:36:42,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:36:42,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:36:42,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 02:36:43,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:36:43,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:36:43,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-23 02:36:43,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:36:43,159 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 [2022-11-23 02:36:43,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:36:43,309 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2497 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2497)))) is different from true [2022-11-23 02:36:43,329 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2497 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2497)))) is different from true [2022-11-23 02:36:43,362 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:36:43,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 02:36:43,789 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:36:43,789 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 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:36:43,990 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 02:36:43,990 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 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:36:44,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:36:44,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:36:44,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 46 treesize of output 21 [2022-11-23 02:36:44,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:36:45,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:45,471 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-23 02:36:45,471 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 54 treesize of output 43 [2022-11-23 02:36:45,493 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:36:45,494 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:36:45,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:45,509 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 16 treesize of output 11 [2022-11-23 02:36:46,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:46,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:36:46,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:46,092 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:36:46,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 43 [2022-11-23 02:36:46,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:46,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-23 02:36:46,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:46,348 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:36:46,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 40 [2022-11-23 02:36:46,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:46,366 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-23 02:36:46,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:46,934 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:36:46,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2022-11-23 02:36:47,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:36:47,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:36:47,657 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-23 02:36:47,657 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 34 [2022-11-23 02:36:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-23 02:36:47,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:36:50,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268914906] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:36:50,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:36:50,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 67 [2022-11-23 02:36:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411762803] [2022-11-23 02:36:50,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:36:50,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-23 02:36:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:36:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-23 02:36:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=5457, Unknown=2, NotChecked=298, Total=6006 [2022-11-23 02:36:50,160 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:37:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:37:00,964 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-11-23 02:37:00,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 02:37:00,965 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 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 60 [2022-11-23 02:37:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:37:00,966 INFO L225 Difference]: With dead ends: 93 [2022-11-23 02:37:00,966 INFO L226 Difference]: Without dead ends: 93 [2022-11-23 02:37:00,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2827 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=913, Invalid=10865, Unknown=2, NotChecked=430, Total=12210 [2022-11-23 02:37:00,968 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 476 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:37:00,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1027 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1916 Invalid, 0 Unknown, 176 Unchecked, 2.3s Time] [2022-11-23 02:37:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-23 02:37:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2022-11-23 02:37:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:37:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-23 02:37:00,973 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2022-11-23 02:37:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:37:00,973 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-23 02:37:00,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:37:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-23 02:37:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-23 02:37:00,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:37:00,975 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:37:00,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 02:37:01,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:01,183 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:37:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:37:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1512551826, now seen corresponding path program 2 times [2022-11-23 02:37:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:37:01,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790607814] [2022-11-23 02:37:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:37:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:05,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:37:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:05,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:37:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:37:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:37:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:37:07,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790607814] [2022-11-23 02:37:07,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790607814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:07,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736105242] [2022-11-23 02:37:07,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:37:07,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:07,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:37:07,114 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:37:07,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 02:37:07,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:37:07,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:37:07,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-23 02:37:07,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:37:07,499 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 [2022-11-23 02:37:07,624 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 [2022-11-23 02:37:07,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:37:08,197 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:37:08,197 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 [2022-11-23 02:37:08,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:08,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:37:08,855 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 [2022-11-23 02:37:09,510 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:37:09,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 02:37:09,518 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 [2022-11-23 02:37:09,558 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 02:37:09,559 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 16 treesize of output 18 [2022-11-23 02:37:09,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:37:09,915 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 20 treesize of output 22 [2022-11-23 02:37:09,939 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 [2022-11-23 02:37:10,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:37:10,902 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 72 treesize of output 35 [2022-11-23 02:37:10,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-23 02:37:10,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-23 02:37:11,064 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 [2022-11-23 02:37:11,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:11,965 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:37:11,966 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 78 treesize of output 66 [2022-11-23 02:37:11,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:12,010 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:37:12,010 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 38 [2022-11-23 02:37:12,053 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:37:12,053 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-23 02:37:12,089 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-23 02:37:12,090 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 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-23 02:37:12,098 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 [2022-11-23 02:37:13,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:13,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:37:13,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:13,113 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:37:13,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 61 [2022-11-23 02:37:13,154 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-23 02:37:13,154 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 1 case distinctions, treesize of input 34 treesize of output 48 [2022-11-23 02:37:13,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:13,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:13,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-11-23 02:37:13,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:13,588 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:37:13,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 58 [2022-11-23 02:37:13,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:13,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:13,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2022-11-23 02:37:13,623 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 46 treesize of output 48 [2022-11-23 02:37:17,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:37:17,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:17,362 INFO L321 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2022-11-23 02:37:17,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 194 treesize of output 104 [2022-11-23 02:37:17,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:37:17,401 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-23 02:37:17,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 39 [2022-11-23 02:37:18,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:37:18,504 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 13 treesize of output 17 [2022-11-23 02:37:18,761 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 [2022-11-23 02:37:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:37:18,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:37:25,121 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 706 treesize of output 562 [2022-11-23 02:37:27,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736105242] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:27,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:37:27,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 42] total 79 [2022-11-23 02:37:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850355044] [2022-11-23 02:37:27,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:37:27,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-23 02:37:27,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:37:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-23 02:37:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=8834, Unknown=11, NotChecked=0, Total=9120 [2022-11-23 02:37:27,713 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:37:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:37:51,708 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-11-23 02:37:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 02:37:51,709 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 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 63 [2022-11-23 02:37:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:37:51,710 INFO L225 Difference]: With dead ends: 91 [2022-11-23 02:37:51,710 INFO L226 Difference]: Without dead ends: 91 [2022-11-23 02:37:51,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=959, Invalid=16059, Unknown=12, NotChecked=0, Total=17030 [2022-11-23 02:37:51,711 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 473 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:37:51,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1110 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3187 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-11-23 02:37:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-23 02:37:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2022-11-23 02:37:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 02:37:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-11-23 02:37:51,716 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 63 [2022-11-23 02:37:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:37:51,717 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-11-23 02:37:51,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 02:37:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-11-23 02:37:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 02:37:51,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:37:51,718 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:37:51,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 02:37:51,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:51,924 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:37:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:37:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash -355533194, now seen corresponding path program 3 times [2022-11-23 02:37:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:37:51,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043320889] [2022-11-23 02:37:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:37:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:37:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:37:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:37:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:37:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:37:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:37:58,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:37:58,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043320889] [2022-11-23 02:37:58,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043320889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:37:58,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525980242] [2022-11-23 02:37:58,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:37:58,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:37:58,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:37:58,043 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:37:58,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 02:37:59,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 02:37:59,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:37:59,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-23 02:37:59,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:37:59,164 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 [2022-11-23 02:37:59,278 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 [2022-11-23 02:37:59,553 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:37:59,553 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 [2022-11-23 02:37:59,782 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 [2022-11-23 02:37:59,795 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 [2022-11-23 02:38:00,672 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:38:00,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 02:38:00,705 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-23 02:38:00,705 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 19 treesize of output 16 [2022-11-23 02:38:00,717 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 [2022-11-23 02:38:01,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 21 treesize of output 20 [2022-11-23 02:38:01,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 27 treesize of output 26 [2022-11-23 02:38:01,911 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-23 02:38:01,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 47 [2022-11-23 02:38:01,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:01,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 02:38:01,930 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 [2022-11-23 02:38:02,564 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 02:38:02,564 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 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 02:38:03,216 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2))) (.cse3 (not (= .cse6 .cse2))) (.cse4 (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (.cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0)) (.cse7 (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) .cse3 .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) .cse7) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse9) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (not (= .cse9 .cse10)) (<= (+ .cse9 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse9) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse10) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse10) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse8) (not (= .cse10 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse12 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse6) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse1 .cse3 .cse4 .cse5 .cse7)))))) is different from false [2022-11-23 02:38:03,224 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2))) (.cse3 (not (= .cse6 .cse2))) (.cse4 (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (.cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0)) (.cse7 (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) .cse3 .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) .cse7) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse9) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (not (= .cse9 .cse10)) (<= (+ .cse9 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse9) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse10) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse10) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse8) (not (= .cse10 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse12 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse6) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse1 .cse3 .cse4 .cse5 .cse7)))))) is different from true [2022-11-23 02:38:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:03,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:03,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2022-11-23 02:38:03,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:03,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:38:03,905 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-23 02:38:03,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 116 treesize of output 75 [2022-11-23 02:38:04,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:04,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:04,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:04,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2022-11-23 02:38:04,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:04,306 INFO L321 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-11-23 02:38:04,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 72 [2022-11-23 02:38:08,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:38:08,671 INFO L321 Elim1Store]: treesize reduction 218, result has 6.0 percent of original size [2022-11-23 02:38:08,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 246 treesize of output 113 [2022-11-23 02:38:08,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:08,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:38:08,712 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-11-23 02:38:08,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 36 [2022-11-23 02:38:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:38:08,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:38:31,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525980242] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:31,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:38:31,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 74 [2022-11-23 02:38:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855057211] [2022-11-23 02:38:31,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:38:31,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-23 02:38:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:31,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-23 02:38:31,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=7375, Unknown=6, NotChecked=172, Total=7832 [2022-11-23 02:38:31,877 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 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) [2022-11-23 02:38:36,421 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse13 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (.cse8 (not (= .cse4 .cse3))) (.cse11 (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10)) (.cse17 (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (<= (+ 1 .cse3) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) .cse7 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) .cse8 (not (= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse11 (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse12 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse6)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (let ((.cse14 (<= (+ 2 .cse3) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3))) (.cse16 (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse16 .cse11 .cse12 .cse17) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse19) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (not (= .cse19 .cse20)) (<= (+ .cse19 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse19) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse20) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse20) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse18) (not (= .cse20 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse19 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse21 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse22 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse22 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse3) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse4) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse22 (select |c_#memory_$Pointer$.offset| .cse22))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse15 .cse8 .cse16 .cse11 .cse17))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse9) 1) .cse17 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-11-23 02:38:36,430 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse13 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (.cse8 (not (= .cse4 .cse3))) (.cse11 (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10)) (.cse17 (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (<= (+ 1 .cse3) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) .cse7 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) .cse8 (not (= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse11 (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse12 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse6)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (let ((.cse14 (<= (+ 2 .cse3) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3))) (.cse16 (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse16 .cse11 .cse12 .cse17) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse19) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (not (= .cse19 .cse20)) (<= (+ .cse19 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse19) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse20) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse20) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse18) (not (= .cse20 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse19 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse21 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse22 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse22 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse3) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse4) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse22 (select |c_#memory_$Pointer$.offset| .cse22))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse15 .cse8 .cse16 .cse11 .cse17))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse9) 1) .cse17 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from true [2022-11-23 02:38:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:47,160 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-11-23 02:38:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 02:38:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 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 64 [2022-11-23 02:38:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:47,162 INFO L225 Difference]: With dead ends: 132 [2022-11-23 02:38:47,163 INFO L226 Difference]: Without dead ends: 132 [2022-11-23 02:38:47,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 115 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=587, Invalid=12523, Unknown=8, NotChecked=454, Total=13572 [2022-11-23 02:38:47,164 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 249 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:47,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1416 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2403 Invalid, 0 Unknown, 123 Unchecked, 5.3s Time] [2022-11-23 02:38:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-23 02:38:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 108. [2022-11-23 02:38:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 101 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-23 02:38:47,170 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 64 [2022-11-23 02:38:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:47,171 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-23 02:38:47,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 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) [2022-11-23 02:38:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-23 02:38:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-23 02:38:47,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:47,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:47,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 02:38:47,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 02:38:47,382 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:38:47,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1863371548, now seen corresponding path program 3 times [2022-11-23 02:38:47,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:47,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330230796] [2022-11-23 02:38:47,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:38:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:38:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:47,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:38:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 02:38:47,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:47,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330230796] [2022-11-23 02:38:47,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330230796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:47,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740324066] [2022-11-23 02:38:47,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:38:47,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:38:47,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:38:47,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:38:47,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 02:38:48,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 02:38:48,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:38:48,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 02:38:48,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:38:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-23 02:38:49,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:38:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-23 02:38:49,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740324066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:38:49,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:38:49,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-23 02:38:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780120550] [2022-11-23 02:38:49,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:38:49,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 02:38:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:49,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 02:38:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-23 02:38:49,223 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 02:38:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:49,383 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-23 02:38:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:38:49,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-11-23 02:38:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:49,385 INFO L225 Difference]: With dead ends: 119 [2022-11-23 02:38:49,385 INFO L226 Difference]: Without dead ends: 119 [2022-11-23 02:38:49,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-23 02:38:49,386 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 109 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:49,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 407 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:38:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-23 02:38:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2022-11-23 02:38:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 103 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-11-23 02:38:49,397 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 65 [2022-11-23 02:38:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:49,397 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-11-23 02:38:49,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 02:38:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-11-23 02:38:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 02:38:49,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:49,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:49,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-23 02:38:49,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-23 02:38:49,603 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:38:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash -749426673, now seen corresponding path program 1 times [2022-11-23 02:38:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:49,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748220795] [2022-11-23 02:38:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:38:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:38:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:38:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-23 02:38:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:49,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748220795] [2022-11-23 02:38:49,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748220795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:38:49,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:38:49,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 02:38:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274060083] [2022-11-23 02:38:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:38:49,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:38:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:49,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:38:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:38:49,956 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:38:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:50,282 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-11-23 02:38:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:38:50,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-23 02:38:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:50,284 INFO L225 Difference]: With dead ends: 119 [2022-11-23 02:38:50,284 INFO L226 Difference]: Without dead ends: 119 [2022-11-23 02:38:50,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-23 02:38:50,286 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 87 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:50,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 225 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:38:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-23 02:38:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-11-23 02:38:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 104 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-11-23 02:38:50,291 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 68 [2022-11-23 02:38:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:50,292 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-11-23 02:38:50,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:38:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-11-23 02:38:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 02:38:50,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:50,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:50,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-23 02:38:50,294 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:38:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash -749426672, now seen corresponding path program 1 times [2022-11-23 02:38:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:50,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095974673] [2022-11-23 02:38:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:50,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:38:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:50,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:38:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:38:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-23 02:38:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:50,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095974673] [2022-11-23 02:38:50,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095974673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:38:50,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:38:50,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 02:38:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571672606] [2022-11-23 02:38:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:38:50,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:38:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:38:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:38:50,749 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:38:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:51,070 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-23 02:38:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:38:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-23 02:38:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:51,072 INFO L225 Difference]: With dead ends: 119 [2022-11-23 02:38:51,072 INFO L226 Difference]: Without dead ends: 119 [2022-11-23 02:38:51,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-23 02:38:51,073 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 137 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:51,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 187 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:38:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-23 02:38:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-11-23 02:38:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.153061224489796) internal successors, (113), 106 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2022-11-23 02:38:51,088 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 68 [2022-11-23 02:38:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:51,091 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2022-11-23 02:38:51,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:38:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2022-11-23 02:38:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-23 02:38:51,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:51,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:51,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-23 02:38:51,095 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:38:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1757391830, now seen corresponding path program 1 times [2022-11-23 02:38:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:51,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173004088] [2022-11-23 02:38:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:38:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:38:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:38:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-23 02:38:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:51,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173004088] [2022-11-23 02:38:51,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173004088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:38:51,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:38:51,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 02:38:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792853762] [2022-11-23 02:38:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:38:51,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:38:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:38:51,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:38:51,381 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:38:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:51,612 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-23 02:38:51,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:38:51,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2022-11-23 02:38:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:51,614 INFO L225 Difference]: With dead ends: 116 [2022-11-23 02:38:51,614 INFO L226 Difference]: Without dead ends: 116 [2022-11-23 02:38:51,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-23 02:38:51,615 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 94 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:51,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 268 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:38:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-23 02:38:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-11-23 02:38:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 106 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-11-23 02:38:51,620 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 69 [2022-11-23 02:38:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:51,620 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-11-23 02:38:51,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:38:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-11-23 02:38:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-23 02:38:51,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:51,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:51,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-23 02:38:51,622 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:38:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash -929953077, now seen corresponding path program 1 times [2022-11-23 02:38:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:51,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873353982] [2022-11-23 02:38:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:38:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:38:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:38:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-23 02:38:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:51,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873353982] [2022-11-23 02:38:51,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873353982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:38:51,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:38:51,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 02:38:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331121621] [2022-11-23 02:38:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:38:51,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 02:38:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:38:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 02:38:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 02:38:51,978 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:38:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:38:52,260 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-23 02:38:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:38:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-11-23 02:38:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:38:52,262 INFO L225 Difference]: With dead ends: 114 [2022-11-23 02:38:52,262 INFO L226 Difference]: Without dead ends: 114 [2022-11-23 02:38:52,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-23 02:38:52,263 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 83 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:38:52,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 238 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:38:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-23 02:38:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-23 02:38:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 107 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 02:38:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-11-23 02:38:52,268 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 71 [2022-11-23 02:38:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:38:52,268 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-11-23 02:38:52,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:38:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-11-23 02:38:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-23 02:38:52,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:38:52,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:38:52,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-23 02:38:52,270 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-23 02:38:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:38:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1692934892, now seen corresponding path program 1 times [2022-11-23 02:38:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:38:52,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670410870] [2022-11-23 02:38:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:38:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-23 02:38:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:38:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-23 02:38:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 02:38:53,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:38:53,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670410870] [2022-11-23 02:38:53,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670410870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:38:53,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017684634] [2022-11-23 02:38:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:38:53,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:38:53,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:38:53,940 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:38:53,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44df059-de62-40f5-a143-d5ec40ebbf68/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 02:38:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:38:54,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-23 02:38:54,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:38:54,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:38:54,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:38:56,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:38:56,193 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 3 case distinctions, treesize of input 58 treesize of output 114 [2022-11-23 02:38:58,914 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 325 treesize of output 269 [2022-11-23 02:38:59,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:39:01,871 INFO L321 Elim1Store]: treesize reduction 72, result has 90.9 percent of original size [2022-11-23 02:39:01,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 22 new quantified variables, introduced 78 case distinctions, treesize of input 347 treesize of output 848