./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a --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 b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- 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-b5237d8 [2022-11-21 16:33:26,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:33:26,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:33:26,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:33:26,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:33:26,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:33:26,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:33:26,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:33:26,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:33:26,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:33:26,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:33:26,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:33:26,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:33:26,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:33:26,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:33:26,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:33:26,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:33:26,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:33:26,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:33:26,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:33:26,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:33:26,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:33:26,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:33:26,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:33:26,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:33:26,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:33:26,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:33:26,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:33:26,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:33:26,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:33:26,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:33:26,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:33:26,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:33:26,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:33:26,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:33:26,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:33:26,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:33:26,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:33:26,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:33:26,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:33:26,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:33:26,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:33:26,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:33:26,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:33:26,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:33:26,101 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:33:26,102 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:33:26,102 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:33:26,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:33:26,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:33:26,103 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:33:26,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:33:26,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:33:26,104 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:33:26,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:33:26,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:33:26,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:33:26,105 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:33:26,106 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:33:26,106 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:33:26,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:33:26,106 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:33:26,107 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:33:26,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:33:26,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:33:26,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:33:26,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:33:26,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:33:26,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:33:26,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:33:26,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:33:26,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:33:26,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/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_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2022-11-21 16:33:26,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:33:26,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:33:26,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:33:26,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:33:26,362 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:33:26,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-21 16:33:29,482 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:33:29,736 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:33:29,737 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-21 16:33:29,751 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/data/79e2ba133/8bade1e4f6af4212b638ad65d7cb45fe/FLAG4f46c70ae [2022-11-21 16:33:29,772 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/data/79e2ba133/8bade1e4f6af4212b638ad65d7cb45fe [2022-11-21 16:33:29,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:33:29,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:33:29,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:33:29,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:33:29,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:33:29,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:33:29" (1/1) ... [2022-11-21 16:33:29,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d15d3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:29, skipping insertion in model container [2022-11-21 16:33:29,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:33:29" (1/1) ... [2022-11-21 16:33:29,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:33:29,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:33:30,261 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_4811247c-d5dc-4a6f-933f-c3181c003529/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-21 16:33:30,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:33:30,275 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:33:30,337 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_4811247c-d5dc-4a6f-933f-c3181c003529/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-21 16:33:30,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:33:30,369 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:33:30,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30 WrapperNode [2022-11-21 16:33:30,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:33:30,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:33:30,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:33:30,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:33:30,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,442 INFO L138 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-11-21 16:33:30,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:33:30,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:33:30,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:33:30,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:33:30,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,487 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:33:30,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:33:30,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:33:30,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:33:30,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (1/1) ... [2022-11-21 16:33:30,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:33:30,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:30,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:33:30,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:33:30,572 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-21 16:33:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-21 16:33:30,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:33:30,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:33:30,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:33:30,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:33:30,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:33:30,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:33:30,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:33:30,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:33:30,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:33:30,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:33:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:33:30,736 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:33:30,745 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:33:30,804 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-21 16:33:31,055 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:33:31,062 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:33:31,062 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 16:33:31,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:33:31 BoogieIcfgContainer [2022-11-21 16:33:31,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:33:31,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:33:31,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:33:31,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:33:31,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:33:29" (1/3) ... [2022-11-21 16:33:31,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d4e166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:33:31, skipping insertion in model container [2022-11-21 16:33:31,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:33:30" (2/3) ... [2022-11-21 16:33:31,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d4e166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:33:31, skipping insertion in model container [2022-11-21 16:33:31,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:33:31" (3/3) ... [2022-11-21 16:33:31,074 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2022-11-21 16:33:31,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:33:31,095 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-21 16:33:31,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:33:31,156 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=FINITE_AUTOMATA, 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;@42f59774, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:33:31,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-21 16:33:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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-21 16:33:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:33:31,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:31,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:33:31,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-21 16:33:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:31,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953478891] [2022-11-21 16:33:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:31,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:31,458 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-21 16:33:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:31,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953478891] [2022-11-21 16:33:31,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953478891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:31,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:31,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:33:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469923120] [2022-11-21 16:33:31,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:31,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:33:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:31,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:33:31,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:33:31,512 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:31,653 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-11-21 16:33:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:33:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:33:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:31,663 INFO L225 Difference]: With dead ends: 86 [2022-11-21 16:33:31,663 INFO L226 Difference]: Without dead ends: 81 [2022-11-21 16:33:31,665 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-21 16:33:31,668 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:31,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:33:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-21 16:33:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2022-11-21 16:33:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-11-21 16:33:31,712 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 5 [2022-11-21 16:33:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:31,712 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-11-21 16:33:31,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-11-21 16:33:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:33:31,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:31,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:33:31,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:33:31,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-21 16:33:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127398845] [2022-11-21 16:33:31,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:31,969 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-21 16:33:31,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:31,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127398845] [2022-11-21 16:33:31,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127398845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:31,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:31,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:33:31,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187949439] [2022-11-21 16:33:31,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:31,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:33:31,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:31,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:33:31,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:33:31,974 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:32,051 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-11-21 16:33:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:33:32,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:33:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:32,053 INFO L225 Difference]: With dead ends: 85 [2022-11-21 16:33:32,053 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 16:33:32,053 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-21 16:33:32,055 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:32,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:33:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 16:33:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2022-11-21 16:33:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-21 16:33:32,062 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 5 [2022-11-21 16:33:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:32,063 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-21 16:33:32,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-21 16:33:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 16:33:32,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:32,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:32,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:33:32,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113076, now seen corresponding path program 1 times [2022-11-21 16:33:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:32,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299981205] [2022-11-21 16:33:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:32,121 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-21 16:33:32,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:32,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299981205] [2022-11-21 16:33:32,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299981205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:32,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:32,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:33:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115865232] [2022-11-21 16:33:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:32,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:33:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:33:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:33:32,124 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:32,135 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-21 16:33:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:33:32,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 16:33:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:32,137 INFO L225 Difference]: With dead ends: 58 [2022-11-21 16:33:32,137 INFO L226 Difference]: Without dead ends: 58 [2022-11-21 16:33:32,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:33:32,139 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:32,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:33:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-21 16:33:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2022-11-21 16:33:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-21 16:33:32,146 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 7 [2022-11-21 16:33:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:32,146 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-21 16:33:32,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-21 16:33:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:33:32,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:32,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:32,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:33:32,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:32,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:32,149 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-21 16:33:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:32,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821805147] [2022-11-21 16:33:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:32,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:32,245 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-21 16:33:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:32,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821805147] [2022-11-21 16:33:32,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821805147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:32,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:32,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:33:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616992907] [2022-11-21 16:33:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:32,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:33:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:32,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:33:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:33:32,248 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:32,275 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-11-21 16:33:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:33:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 16:33:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:32,281 INFO L225 Difference]: With dead ends: 55 [2022-11-21 16:33:32,281 INFO L226 Difference]: Without dead ends: 55 [2022-11-21 16:33:32,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:33:32,283 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:32,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:33:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-21 16:33:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-11-21 16:33:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-21 16:33:32,288 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 9 [2022-11-21 16:33:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:32,288 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-21 16:33:32,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-21 16:33:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:33:32,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:32,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:32,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:33:32,290 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:32,291 INFO L85 PathProgramCache]: Analyzing trace with hash -763066877, now seen corresponding path program 1 times [2022-11-21 16:33:32,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:32,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349383520] [2022-11-21 16:33:32,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:32,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:32,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349383520] [2022-11-21 16:33:32,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349383520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:32,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223194727] [2022-11-21 16:33:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:32,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:32,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:32,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:32,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:33:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:32,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:33:32,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:32,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:32,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223194727] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:33:32,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:33:32,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-21 16:33:32,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726337800] [2022-11-21 16:33:32,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:32,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:33:32,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:32,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:33:32,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:33:32,790 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:32,820 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-11-21 16:33:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:33:32,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:33:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:32,824 INFO L225 Difference]: With dead ends: 56 [2022-11-21 16:33:32,824 INFO L226 Difference]: Without dead ends: 56 [2022-11-21 16:33:32,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:33:32,830 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:32,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:33:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-21 16:33:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-21 16:33:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-11-21 16:33:32,844 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 14 [2022-11-21 16:33:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:32,845 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-11-21 16:33:32,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-11-21 16:33:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:33:32,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:32,846 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:32,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:33,047 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-21 16:33:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:33,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449470005] [2022-11-21 16:33:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:33,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449470005] [2022-11-21 16:33:33,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449470005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:33,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197424574] [2022-11-21 16:33:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:33,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:33,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:33,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:33,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:33:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:33,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 16:33:33,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:33,513 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-21 16:33:33,558 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:33:33,558 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-21 16:33:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:33,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:33,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197424574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:33:33,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:33:33,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-21 16:33:33,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681163355] [2022-11-21 16:33:33,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:33,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:33:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:33,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:33:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:33:33,716 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:33,904 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-21 16:33:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:33:33,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:33:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:33,909 INFO L225 Difference]: With dead ends: 82 [2022-11-21 16:33:33,910 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 16:33:33,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:33:33,913 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:33,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 123 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:33:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 16:33:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2022-11-21 16:33:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-21 16:33:33,927 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 16 [2022-11-21 16:33:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:33,927 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-21 16:33:33,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-21 16:33:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:33:33,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:33,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:33,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 16:33:34,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:34,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-21 16:33:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:34,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759484348] [2022-11-21 16:33:34,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:34,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759484348] [2022-11-21 16:33:34,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759484348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:34,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517747532] [2022-11-21 16:33:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:34,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:34,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:34,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:34,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:33:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:34,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 16:33:34,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:34,498 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-21 16:33:34,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:34,637 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-21 16:33:34,654 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:33:34,655 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-21 16:33:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:34,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:39,015 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 50 treesize of output 46 [2022-11-21 16:33:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:39,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517747532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:33:39,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:33:39,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-21 16:33:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948716695] [2022-11-21 16:33:39,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:39,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:33:39,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:33:39,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:33:39,111 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:39,344 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-21 16:33:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:33:39,345 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:33:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:39,346 INFO L225 Difference]: With dead ends: 81 [2022-11-21 16:33:39,346 INFO L226 Difference]: Without dead ends: 81 [2022-11-21 16:33:39,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:33:39,347 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 327 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:39,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 73 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:33:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-21 16:33:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2022-11-21 16:33:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-21 16:33:39,352 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 16 [2022-11-21 16:33:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:39,352 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-21 16:33:39,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-21 16:33:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:33:39,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:39,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:39,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:39,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 16:33:39,554 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:39,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:39,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957292, now seen corresponding path program 2 times [2022-11-21 16:33:39,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:39,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88336710] [2022-11-21 16:33:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:39,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88336710] [2022-11-21 16:33:39,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88336710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:39,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265472089] [2022-11-21 16:33:39,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:33:39,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:39,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:39,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:39,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:33:39,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:33:39,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:33:39,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:33:39,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:33:39,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:33:39,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265472089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:39,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:33:39,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-21 16:33:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110064975] [2022-11-21 16:33:39,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:39,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:33:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:33:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:33:39,796 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:39,818 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-21 16:33:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:33:39,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:33:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:39,824 INFO L225 Difference]: With dead ends: 80 [2022-11-21 16:33:39,824 INFO L226 Difference]: Without dead ends: 80 [2022-11-21 16:33:39,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:33:39,826 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 91 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:39,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 91 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:33:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-21 16:33:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2022-11-21 16:33:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-21 16:33:39,846 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 21 [2022-11-21 16:33:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:39,846 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-21 16:33:39,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:39,847 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-21 16:33:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:33:39,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:39,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:39,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:40,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 16:33:40,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2022-11-21 16:33:40,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:40,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22790287] [2022-11-21 16:33:40,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:40,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:40,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22790287] [2022-11-21 16:33:40,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22790287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:40,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959878860] [2022-11-21 16:33:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:40,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:40,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:40,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:40,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:33:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:40,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:33:40,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:40,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:40,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959878860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:33:40,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:33:40,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-21 16:33:40,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722622083] [2022-11-21 16:33:40,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:40,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:33:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:40,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:33:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:33:40,381 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:40,419 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-11-21 16:33:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:33:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:33:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:40,420 INFO L225 Difference]: With dead ends: 55 [2022-11-21 16:33:40,421 INFO L226 Difference]: Without dead ends: 55 [2022-11-21 16:33:40,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:33:40,423 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 81 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:40,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:33:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-21 16:33:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-21 16:33:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-21 16:33:40,432 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 21 [2022-11-21 16:33:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:40,433 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-21 16:33:40,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-21 16:33:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:33:40,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:40,435 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:40,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:40,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:40,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2022-11-21 16:33:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:40,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720076324] [2022-11-21 16:33:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:33:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720076324] [2022-11-21 16:33:40,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720076324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001417238] [2022-11-21 16:33:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:40,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:40,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:40,887 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:40,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:33:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:41,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 16:33:41,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:41,043 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-21 16:33:41,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:41,064 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-21 16:33:41,091 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:33:41,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 16:33:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 16:33:41,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 16:33:41,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001417238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:33:41,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:33:41,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-11-21 16:33:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903225151] [2022-11-21 16:33:41,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:41,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:33:41,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:33:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:33:41,195 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:41,309 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-21 16:33:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:33:41,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:33:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:41,310 INFO L225 Difference]: With dead ends: 72 [2022-11-21 16:33:41,310 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 16:33:41,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:33:41,311 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 158 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:41,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 77 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:33:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 16:33:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-11-21 16:33:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-11-21 16:33:41,314 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 22 [2022-11-21 16:33:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:41,314 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-11-21 16:33:41,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-11-21 16:33:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:33:41,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:41,315 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:41,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:41,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:41,516 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2022-11-21 16:33:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:41,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223065047] [2022-11-21 16:33:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:41,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223065047] [2022-11-21 16:33:41,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223065047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:41,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541793532] [2022-11-21 16:33:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:41,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:41,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:41,965 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:41,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:33:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:42,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 16:33:42,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:42,119 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-21 16:33:42,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:42,142 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-21 16:33:42,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:33:42,199 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-21 16:33:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:33:42,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:44,532 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_28| Int)) (or (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| Int) (v_ArrVal_613 Int)) (or (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_614 Int)) (<= (+ |c_ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_28| v_ArrVal_613) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_27| v_ArrVal_614) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2022-11-21 16:33:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 16:33:44,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541793532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:33:44,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:33:44,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 11 [2022-11-21 16:33:44,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122640446] [2022-11-21 16:33:44,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:44,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:33:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:33:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=75, Unknown=1, NotChecked=18, Total=132 [2022-11-21 16:33:44,554 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:44,709 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-21 16:33:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:33:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:33:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:44,710 INFO L225 Difference]: With dead ends: 66 [2022-11-21 16:33:44,710 INFO L226 Difference]: Without dead ends: 66 [2022-11-21 16:33:44,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=70, Invalid=115, Unknown=1, NotChecked=24, Total=210 [2022-11-21 16:33:44,711 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 176 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:44,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 35 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-11-21 16:33:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-21 16:33:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-11-21 16:33:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.358974358974359) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-11-21 16:33:44,713 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 22 [2022-11-21 16:33:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:44,714 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-11-21 16:33:44,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-11-21 16:33:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 16:33:44,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:44,715 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:44,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:44,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:44,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2022-11-21 16:33:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:44,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483239154] [2022-11-21 16:33:44,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:33:45,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:45,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483239154] [2022-11-21 16:33:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483239154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:45,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:45,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:33:45,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958852703] [2022-11-21 16:33:45,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:45,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:33:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:45,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:33:45,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:33:45,094 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:45,322 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-21 16:33:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:33:45,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-21 16:33:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:45,324 INFO L225 Difference]: With dead ends: 72 [2022-11-21 16:33:45,324 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 16:33:45,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:33:45,324 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 112 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:45,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 119 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:33:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 16:33:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2022-11-21 16:33:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.375) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-21 16:33:45,327 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2022-11-21 16:33:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:45,327 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-21 16:33:45,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-21 16:33:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 16:33:45,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:45,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:45,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:33:45,328 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2022-11-21 16:33:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:45,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910832382] [2022-11-21 16:33:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:33:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910832382] [2022-11-21 16:33:45,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910832382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:45,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:45,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:33:45,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822607543] [2022-11-21 16:33:45,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:45,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:33:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:45,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:33:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:33:45,587 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:45,839 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-21 16:33:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:33:45,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-21 16:33:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:45,841 INFO L225 Difference]: With dead ends: 66 [2022-11-21 16:33:45,841 INFO L226 Difference]: Without dead ends: 66 [2022-11-21 16:33:45,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:33:45,842 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 190 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:45,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 89 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:33:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-21 16:33:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-11-21 16:33:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-11-21 16:33:45,844 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 23 [2022-11-21 16:33:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:45,845 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-11-21 16:33:45,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-11-21 16:33:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 16:33:45,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:45,846 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] [2022-11-21 16:33:45,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:33:45,846 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116430, now seen corresponding path program 1 times [2022-11-21 16:33:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:45,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669450710] [2022-11-21 16:33:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:46,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:46,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669450710] [2022-11-21 16:33:46,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669450710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:46,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084476574] [2022-11-21 16:33:46,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:46,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:46,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:46,524 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:46,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:33:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:46,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-21 16:33:46,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:46,707 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-21 16:33:46,795 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:33:46,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 11 treesize of output 11 [2022-11-21 16:33:46,839 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-21 16:33:46,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:33:46,906 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:33:46,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-21 16:33:47,141 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 49 treesize of output 37 [2022-11-21 16:33:47,204 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-21 16:33:47,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-11-21 16:33:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:47,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:47,331 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 28 treesize of output 20 [2022-11-21 16:33:47,528 INFO L321 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-21 16:33:47,528 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 28 treesize of output 27 [2022-11-21 16:33:47,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)))))) is different from false [2022-11-21 16:33:47,565 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_810 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_810)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-21 16:33:47,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:47,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2022-11-21 16:33:47,634 INFO L321 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-11-21 16:33:47,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-11-21 16:33:47,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:47,649 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 108 treesize of output 104 [2022-11-21 16:33:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 16:33:47,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084476574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:33:47,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:33:47,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2022-11-21 16:33:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989009851] [2022-11-21 16:33:47,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:33:47,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-21 16:33:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:47,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-21 16:33:47,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1027, Unknown=2, NotChecked=130, Total=1260 [2022-11-21 16:33:47,845 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:50,064 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-21 16:33:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 16:33:50,065 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 16:33:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:50,067 INFO L225 Difference]: With dead ends: 84 [2022-11-21 16:33:50,067 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 16:33:50,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=436, Invalid=2020, Unknown=2, NotChecked=194, Total=2652 [2022-11-21 16:33:50,069 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 402 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:50,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 294 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 610 Invalid, 1 Unknown, 101 Unchecked, 0.7s Time] [2022-11-21 16:33:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 16:33:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2022-11-21 16:33:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.372093023255814) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-11-21 16:33:50,073 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 26 [2022-11-21 16:33:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:50,073 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-11-21 16:33:50,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:33:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-11-21 16:33:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 16:33:50,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:50,075 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] [2022-11-21 16:33:50,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:50,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:50,282 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:33:50,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116431, now seen corresponding path program 1 times [2022-11-21 16:33:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:50,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610108640] [2022-11-21 16:33:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610108640] [2022-11-21 16:33:51,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610108640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:33:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821946661] [2022-11-21 16:33:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:51,348 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:51,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:33:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:51,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-21 16:33:51,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:51,546 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-21 16:33:51,691 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:33:51,692 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 11 [2022-11-21 16:33:51,758 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-21 16:33:51,769 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-21 16:33:51,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:33:51,842 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 23 treesize of output 22 [2022-11-21 16:33:51,955 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:33:51,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2022-11-21 16:33:51,966 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 50 treesize of output 48 [2022-11-21 16:33:52,482 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-21 16:33:52,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 74 [2022-11-21 16:33:52,508 INFO L321 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-11-21 16:33:52,509 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 45 [2022-11-21 16:33:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:33:52,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:33:53,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:53,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 329 [2022-11-21 16:33:54,904 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse5 (select (select .cse3 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse1 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse5 4))) (or (= (select (select .cse0 .cse1) .cse2) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (< (select (select .cse3 .cse1) .cse2) .cse4))))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse7 (select (select .cse8 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse8 .cse7) (+ .cse9 4)))) (or (= .cse6 0) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7))))))) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse10 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse12 (select (select .cse17 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse15 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ 4 .cse12))) (let ((.cse11 (select (select .cse17 .cse13) .cse16))) (or (< .cse11 .cse4) (= .cse11 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse12)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13)) (= (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse14 (select (select .cse14 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse15 .cse13) .cse16)))))))) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse22 (select (select .cse21 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse19 (select (select .cse18 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (+ .cse22 4))) (or (= (select (select .cse18 .cse19) .cse20) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse19)) (< (select (select .cse21 .cse19) .cse20) .cse4) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse23 (select (select .cse23 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2)) (.cse27 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse26 (+ 4 .cse27)) (.cse25 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse24 .cse25) .cse26) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (= (select (select .cse28 .cse25) .cse26) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse25)))))))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse30 (select (select .cse33 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select (select .cse33 .cse30) (+ .cse31 4)))) (or (= .cse29 0) (= .cse29 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse30)) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse29 (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse32 (select (select .cse32 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse34 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse35 (select (select .cse40 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (+ 4 .cse39))) (let ((.cse38 (select (select .cse40 .cse35) .cse36))) (or (= (select (select .cse34 .cse35) .cse36) 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse37 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse38)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse39)) (= .cse38 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse35)))))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse43 (select (select .cse41 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse41 .cse42) (+ .cse43 4)) 8)) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse42 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (select (select .cse47 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse44 (select (select .cse47 .cse46) (+ 4 .cse45)))) (or (< .cse44 .cse4) (= .cse44 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse45)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse48 (select (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse53 (select (select .cse53 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse48 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse50 (select (select .cse51 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse49 (select (select .cse51 .cse50) (+ .cse52 4)))) (or (= .cse49 0) (= .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse50)) (= .cse49 .cse48)))))) (not (= .cse52 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse58 (select (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse61 (select (select .cse61 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse60 (select (select .cse56 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse55 (select (select .cse59 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (+ .cse60 4))) (let ((.cse54 (select (select .cse59 .cse55) .cse57))) (or (= .cse54 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse55)) (< (select (select .cse56 .cse55) .cse57) .cse4) (= .cse54 .cse58)))))) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse67 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse64 (select (select .cse63 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (+ 4 .cse67))) (let ((.cse62 (select (select .cse66 .cse64) .cse65))) (or (< .cse62 .cse4) (= .cse62 0) (= (select (select .cse63 .cse64) .cse65) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse67)))))))) is different from false [2022-11-21 16:33:55,790 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse70 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse70 0))) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse70 0)))) (and (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse8 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse1 (select (select .cse3 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select (select .cse9 .cse1) .cse4))) (or (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse0 .cse2) (= (select (select .cse3 .cse1) .cse4) (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse5 (select (select .cse5 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse10 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse10 (select (select .cse10 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse15 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse12 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse15 4))) (or (= (select (select .cse11 .cse12) .cse13) 0) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse14 .cse12) .cse13) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse18 (select (let ((.cse21 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse21 (select (select .cse21 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse20 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse19 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse17 (select (select .cse19 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse19 .cse17) (+ .cse20 4)))) (or (= .cse16 0) (= .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse18 .cse16)))))) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse26 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse24 (select (select .cse26 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (select (select .cse26 .cse24) (+ .cse23 4)))) (or (= .cse22 0) (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse25 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse25 (select (select .cse25 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse22)))))) (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse30 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse31 (select (select .cse30 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse27 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse29 (+ .cse31 4)) (.cse28 (select (select .cse27 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse27 .cse28) .cse29) 0) (< (select (select .cse30 .cse28) .cse29) .cse2) (not (= .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse32 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse35 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse34 (select (select .cse35 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (select (select .cse35 .cse34) (+ .cse32 4)))) (or (= .cse33 0) (= .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse36 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse36 (select (select .cse36 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse37 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse41 (select (select .cse40 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (+ .cse41 4)) (.cse38 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse37 .cse38) .cse39) 0) (< (select (select .cse40 .cse38) .cse39) .cse2) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse46 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse47 (select (select .cse46 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse44 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (+ .cse47 4))) (let ((.cse42 (select (select .cse46 .cse43) .cse45))) (or (= .cse42 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse42 .cse2) (= (select (select .cse44 .cse43) .cse45) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse48 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse50 (select (select .cse48 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse48 .cse49) (+ .cse50 4)) 8)) (not (= .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse51 (select (let ((.cse58 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse58 (select (select .cse58 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse53 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse57 (select (select .cse53 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse56 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse54 (select (select .cse56 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse55 (+ .cse57 4))) (let ((.cse52 (select (select .cse56 .cse54) .cse55))) (or (= .cse52 0) (< (select (select .cse53 .cse54) .cse55) .cse2) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse51 .cse52)))))) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse59 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse64 (select (select .cse59 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse60 (select (select .cse65 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (+ .cse64 4))) (let ((.cse62 (select (select .cse65 .cse60) .cse61))) (or (= (select (select .cse59 .cse60) .cse61) 0) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse62 (select (let ((.cse63 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse63 (select (select .cse63 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse62 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse69 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse67 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (select (select .cse69 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse66 (select (select .cse69 .cse67) (+ .cse68 4)))) (or (= .cse66 0) (not (= .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse66 .cse2) (not (= .cse68 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))) is different from false [2022-11-21 16:33:56,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:56,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 131 [2022-11-21 16:33:56,437 INFO L321 Elim1Store]: treesize reduction 232, result has 36.8 percent of original size [2022-11-21 16:33:56,438 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 10 new quantified variables, introduced 21 case distinctions, treesize of input 533 treesize of output 547 [2022-11-21 16:33:56,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:56,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 401 treesize of output 260 [2022-11-21 16:33:56,824 INFO L321 Elim1Store]: treesize reduction 200, result has 43.2 percent of original size [2022-11-21 16:33:56,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1547 treesize of output 1496 [2022-11-21 16:33:56,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:56,948 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 1215 treesize of output 1131 [2022-11-21 16:33:57,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:57,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1318 treesize of output 1194 [2022-11-21 16:33:57,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:33:57,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 473 treesize of output 467 [2022-11-21 16:34:03,483 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:03,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2022-11-21 16:34:03,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:03,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-11-21 16:34:03,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:03,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 60 [2022-11-21 16:34:03,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:34:03,688 INFO L321 Elim1Store]: treesize reduction 127, result has 43.6 percent of original size [2022-11-21 16:34:03,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 196 treesize of output 229 [2022-11-21 16:34:03,832 INFO L321 Elim1Store]: treesize reduction 4, result has 96.1 percent of original size [2022-11-21 16:34:03,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 155 [2022-11-21 16:34:03,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-21 16:34:03,864 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 161 treesize of output 137 [2022-11-21 16:34:05,703 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:05,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-21 16:34:05,716 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:05,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 465 treesize of output 1 [2022-11-21 16:34:05,727 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:05,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 1 [2022-11-21 16:34:05,740 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:05,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 1 [2022-11-21 16:34:05,752 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:05,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-21 16:34:05,764 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:05,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 381 treesize of output 1 [2022-11-21 16:34:05,776 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:05,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 379 treesize of output 1 [2022-11-21 16:34:05,787 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 16:34:05,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 1 [2022-11-21 16:34:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 16:34:06,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821946661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:34:06,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:34:06,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 42 [2022-11-21 16:34:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977430625] [2022-11-21 16:34:06,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:34:06,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-21 16:34:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-21 16:34:06,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1521, Unknown=2, NotChecked=158, Total=1806 [2022-11-21 16:34:06,016 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:06,475 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse49 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse73 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse48 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse74 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse48 .cse74 0))) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse73 .cse74 0))) (.cse50 (select .cse73 .cse49))) (and (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse8 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse1 (select (select .cse3 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse8 4))) (let ((.cse0 (select (select .cse9 .cse1) .cse4))) (or (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse0 .cse2) (= (select (select .cse3 .cse1) .cse4) (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse5 (select (select .cse5 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse10 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse10 (select (select .cse10 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse15 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse12 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse15 4))) (or (= (select (select .cse11 .cse12) .cse13) 0) (not (= .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse14 .cse12) .cse13) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse18 (select (let ((.cse21 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse21 (select (select .cse21 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse20 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse19 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse17 (select (select .cse19 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse19 .cse17) (+ .cse20 4)))) (or (= .cse16 0) (= .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse18 .cse16)))))) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse26 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse24 (select (select .cse26 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (select (select .cse26 .cse24) (+ .cse23 4)))) (or (= .cse22 0) (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse25 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse25 (select (select .cse25 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse22)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse30 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse31 (select (select .cse30 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse27 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse29 (+ .cse31 4)) (.cse28 (select (select .cse27 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse27 .cse28) .cse29) 0) (< (select (select .cse30 .cse28) .cse29) .cse2) (not (= .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse32 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse35 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse34 (select (select .cse35 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (select (select .cse35 .cse34) (+ .cse32 4)))) (or (= .cse33 0) (= .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse36 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse36 (select (select .cse36 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse37 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse41 (select (select .cse40 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (+ .cse41 4)) (.cse38 (select (select .cse37 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse37 .cse38) .cse39) 0) (< (select (select .cse40 .cse38) .cse39) .cse2) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse46 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse47 (select (select .cse46 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse44 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (+ .cse47 4))) (let ((.cse42 (select (select .cse46 .cse43) .cse45))) (or (= .cse42 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse42 .cse2) (= (select (select .cse44 .cse43) .cse45) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= (select .cse48 .cse49) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse50 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse51 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse53 (select (select .cse51 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse51 .cse52) (+ .cse53 4)) 8)) (not (= .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse52 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse54 (select (let ((.cse61 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse61 (select (select .cse61 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse54 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse56 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse60 (select (select .cse56 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse59 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse57 (select (select .cse59 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse58 (+ .cse60 4))) (let ((.cse55 (select (select .cse59 .cse57) .cse58))) (or (= .cse55 0) (< (select (select .cse56 .cse57) .cse58) .cse2) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse54 .cse55)))))) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse62 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse67 (select (select .cse62 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse63 (select (select .cse68 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (+ .cse67 4))) (let ((.cse65 (select (select .cse68 .cse63) .cse64))) (or (= (select (select .cse62 .cse63) .cse64) 0) (not (= .cse63 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse65 (select (let ((.cse66 (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse66 (select (select .cse66 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse72 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse70 (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse71 (select (select .cse72 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse69 (select (select .cse72 .cse70) (+ .cse71 4)))) (or (= .cse69 0) (not (= .cse70 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse69 .cse2) (not (= .cse71 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse50) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-21 16:34:08,994 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse58 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse52 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse79 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse51 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse80 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse38 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse78 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select .cse38 .cse78)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse51 .cse80 0))) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse79 .cse80 0))) (.cse54 (select .cse79 .cse52)) (.cse39 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse53 (select .cse58 .cse78))) (and (not (= .cse0 0)) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse9 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse2 (select (select .cse4 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse9 4))) (let ((.cse1 (select (select .cse10 .cse2) .cse5))) (or (= .cse1 0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse1 .cse3) (= (select (select .cse4 .cse2) .cse5) (select (let ((.cse6 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse6 (select (select .cse6 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse11 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse11 (select (select .cse11 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse12 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse16 (select (select .cse12 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse15 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ .cse16 4))) (or (= (select (select .cse12 .cse13) .cse14) 0) (not (= .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse15 .cse13) .cse14) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse19 (select (let ((.cse22 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse22 (select (select .cse22 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse21 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse20 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse18 (select (select .cse20 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select .cse20 .cse18) (+ .cse21 4)))) (or (= .cse17 0) (= .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse19 .cse17)))))) (not (= .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse27 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse25 (select (select .cse27 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (select (select .cse27 .cse25) (+ .cse24 4)))) (or (= .cse23 0) (= .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse26 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse26 (select (select .cse26 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse23)))))) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse31 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse32 (select (select .cse31 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse28 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse30 (+ .cse32 4)) (.cse29 (select (select .cse28 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse28 .cse29) .cse30) 0) (< (select (select .cse31 .cse29) .cse30) .cse3) (not (= .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse33 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse36 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse35 (select (select .cse36 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse36 .cse35) (+ .cse33 4)))) (or (= .cse34 0) (= .cse34 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse37 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse37 (select (select .cse37 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse38 .cse39) 0) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse43 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse44 (select (select .cse43 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (+ .cse44 4)) (.cse41 (select (select .cse40 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse40 .cse41) .cse42) 0) (< (select (select .cse43 .cse41) .cse42) .cse3) (not (= .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse49 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse50 (select (select .cse49 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse47 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse46 (select (select .cse47 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse48 (+ .cse50 4))) (let ((.cse45 (select (select .cse49 .cse46) .cse48))) (or (= .cse45 0) (not (= .cse46 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse45 .cse3) (= (select (select .cse47 .cse46) .cse48) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (not (= .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= (select .cse51 .cse52) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= (+ .cse53 12) (select |c_#length| .cse0)) (= .cse54 0) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse55 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse57 (select (select .cse55 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse55 .cse56) (+ .cse57 4)) 8)) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= (select |c_#length| (select .cse38 4)) 12) (= (select .cse58 4) 0) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse59 (select (let ((.cse66 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse66 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse59 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse61 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse65 (select (select .cse61 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse64 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse62 (select (select .cse64 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (+ .cse65 4))) (let ((.cse60 (select (select .cse64 .cse62) .cse63))) (or (= .cse60 0) (< (select (select .cse61 .cse62) .cse63) .cse3) (not (= .cse62 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse59 .cse60)))))) (not (= .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse67 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse72 (select (select .cse67 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse73 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse68 (select (select .cse73 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (+ .cse72 4))) (let ((.cse70 (select (select .cse73 .cse68) .cse69))) (or (= (select (select .cse67 .cse68) .cse69) 0) (not (= .cse68 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse70 (select (let ((.cse71 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse71 (select (select .cse71 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse70 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse77 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse75 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse76 (select (select .cse77 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse74 (select (select .cse77 .cse75) (+ .cse76 4)))) (or (= .cse74 0) (not (= .cse75 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< .cse74 .cse3) (not (= .cse76 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse54) (= (select .cse58 .cse39) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= .cse53 0)))) is different from false [2022-11-21 16:34:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:14,686 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2022-11-21 16:34:14,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-21 16:34:14,687 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 16:34:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:14,688 INFO L225 Difference]: With dead ends: 152 [2022-11-21 16:34:14,688 INFO L226 Difference]: Without dead ends: 152 [2022-11-21 16:34:14,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=653, Invalid=3914, Unknown=5, NotChecked=540, Total=5112 [2022-11-21 16:34:14,691 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 919 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:14,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 579 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 724 Invalid, 0 Unknown, 133 Unchecked, 1.2s Time] [2022-11-21 16:34:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-21 16:34:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 55. [2022-11-21 16:34:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-21 16:34:14,694 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 26 [2022-11-21 16:34:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:14,694 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-21 16:34:14,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-21 16:34:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 16:34:14,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:14,695 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-21 16:34:14,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:34:14,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 16:34:14,905 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:14,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash 687445232, now seen corresponding path program 1 times [2022-11-21 16:34:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:14,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455477202] [2022-11-21 16:34:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:34:15,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:15,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455477202] [2022-11-21 16:34:15,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455477202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:34:15,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:34:15,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:34:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467881962] [2022-11-21 16:34:15,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:34:15,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:34:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:34:15,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:34:15,216 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:15,379 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-11-21 16:34:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:34:15,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-21 16:34:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:15,381 INFO L225 Difference]: With dead ends: 63 [2022-11-21 16:34:15,381 INFO L226 Difference]: Without dead ends: 63 [2022-11-21 16:34:15,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:34:15,381 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 185 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:15,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 101 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:34:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-21 16:34:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-11-21 16:34:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-11-21 16:34:15,384 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 28 [2022-11-21 16:34:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:15,384 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-11-21 16:34:15,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-11-21 16:34:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 16:34:15,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:15,384 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, 1] [2022-11-21 16:34:15,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:34:15,385 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash -164034179, now seen corresponding path program 1 times [2022-11-21 16:34:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:15,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696206227] [2022-11-21 16:34:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:34:15,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:15,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696206227] [2022-11-21 16:34:15,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696206227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:34:15,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:34:15,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:34:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400489740] [2022-11-21 16:34:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:34:15,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:34:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:34:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:34:15,882 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:16,165 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-11-21 16:34:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:34:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-21 16:34:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:16,167 INFO L225 Difference]: With dead ends: 62 [2022-11-21 16:34:16,167 INFO L226 Difference]: Without dead ends: 62 [2022-11-21 16:34:16,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-11-21 16:34:16,167 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 267 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:16,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 107 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:34:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-21 16:34:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-11-21 16:34:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-11-21 16:34:16,169 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 29 [2022-11-21 16:34:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:16,170 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-11-21 16:34:16,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-11-21 16:34:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 16:34:16,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:16,170 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, 1, 1] [2022-11-21 16:34:16,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:34:16,170 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:16,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:16,171 INFO L85 PathProgramCache]: Analyzing trace with hash -790092142, now seen corresponding path program 1 times [2022-11-21 16:34:16,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:16,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678760979] [2022-11-21 16:34:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:34:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678760979] [2022-11-21 16:34:16,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678760979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:34:16,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:34:16,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:34:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094176143] [2022-11-21 16:34:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:34:16,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:34:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:34:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:34:16,569 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:16,904 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-11-21 16:34:16,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:34:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-21 16:34:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:16,905 INFO L225 Difference]: With dead ends: 59 [2022-11-21 16:34:16,905 INFO L226 Difference]: Without dead ends: 59 [2022-11-21 16:34:16,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:34:16,906 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 89 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:16,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 145 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:34:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-21 16:34:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-21 16:34:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 58 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-11-21 16:34:16,909 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 30 [2022-11-21 16:34:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:16,909 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-11-21 16:34:16,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-11-21 16:34:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 16:34:16,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:16,910 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, 1, 1, 1] [2022-11-21 16:34:16,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 16:34:16,910 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1276947488, now seen corresponding path program 1 times [2022-11-21 16:34:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:16,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493432785] [2022-11-21 16:34:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:34:17,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:17,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493432785] [2022-11-21 16:34:17,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493432785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:34:17,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:34:17,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:34:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184705590] [2022-11-21 16:34:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:34:17,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:34:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:17,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:34:17,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:34:17,079 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:17,170 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-11-21 16:34:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:34:17,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-21 16:34:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:17,171 INFO L225 Difference]: With dead ends: 58 [2022-11-21 16:34:17,171 INFO L226 Difference]: Without dead ends: 58 [2022-11-21 16:34:17,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:34:17,172 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 118 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:17,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:34:17,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-21 16:34:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-21 16:34:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-11-21 16:34:17,174 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 31 [2022-11-21 16:34:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:17,174 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-11-21 16:34:17,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-11-21 16:34:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 16:34:17,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:17,176 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:34:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 16:34:17,176 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1472458184, now seen corresponding path program 1 times [2022-11-21 16:34:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:17,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075275630] [2022-11-21 16:34:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:34:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:17,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075275630] [2022-11-21 16:34:17,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075275630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:34:17,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:34:17,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:34:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303859176] [2022-11-21 16:34:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:34:17,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:34:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:34:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:34:17,252 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:17,294 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-11-21 16:34:17,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:34:17,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-21 16:34:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:17,295 INFO L225 Difference]: With dead ends: 56 [2022-11-21 16:34:17,296 INFO L226 Difference]: Without dead ends: 56 [2022-11-21 16:34:17,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:34:17,296 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:17,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:34:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-21 16:34:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-21 16:34:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-11-21 16:34:17,299 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 35 [2022-11-21 16:34:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:17,299 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-11-21 16:34:17,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-11-21 16:34:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:34:17,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:17,300 INFO L195 NwaCegarLoop]: trace histogram [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-21 16:34:17,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:34:17,301 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435685, now seen corresponding path program 1 times [2022-11-21 16:34:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:17,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424584541] [2022-11-21 16:34:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:34:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:18,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424584541] [2022-11-21 16:34:18,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424584541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:18,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633072228] [2022-11-21 16:34:18,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:18,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:18,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:34:18,631 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:34:18,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 16:34:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:18,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-21 16:34:18,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:34:18,872 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-21 16:34:18,986 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:34:18,986 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-21 16:34:19,046 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-21 16:34:19,102 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 23 treesize of output 22 [2022-11-21 16:34:19,132 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:34:19,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-21 16:34:19,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:34:19,641 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-21 16:34:19,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 46 [2022-11-21 16:34:19,649 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-21 16:34:19,792 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-21 16:34:20,013 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-21 16:34:20,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-21 16:34:20,152 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:34:20,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 59 [2022-11-21 16:34:20,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:20,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 77 [2022-11-21 16:34:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:34:20,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:34:21,115 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-21 16:34:21,215 INFO L321 Elim1Store]: treesize reduction 13, result has 78.7 percent of original size [2022-11-21 16:34:21,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 99 [2022-11-21 16:34:22,035 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 72 treesize of output 56 [2022-11-21 16:34:22,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1327 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1327))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse3 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (let ((.cse1 (select (select (store .cse3 .cse0 v_ArrVal_1328) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1))))))) is different from false [2022-11-21 16:34:22,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1325 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1325)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1327))) (let ((.cse1 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse3 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (let ((.cse0 (select (select (store .cse3 .cse2 v_ArrVal_1328) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse0 .cse2)))))))) is different from false [2022-11-21 16:34:22,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:22,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 107 [2022-11-21 16:34:22,538 INFO L321 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-11-21 16:34:22,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2052 treesize of output 1508 [2022-11-21 16:34:22,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:22,597 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 1182 treesize of output 1012 [2022-11-21 16:34:22,614 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 976 treesize of output 944 [2022-11-21 16:34:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 16:34:23,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633072228] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:34:23,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:34:23,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 59 [2022-11-21 16:34:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703344748] [2022-11-21 16:34:23,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:34:23,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-21 16:34:23,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-21 16:34:23,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3079, Unknown=39, NotChecked=226, Total=3540 [2022-11-21 16:34:23,105 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 60 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 60 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:27,806 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-11-21 16:34:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 16:34:27,807 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 60 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-21 16:34:27,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:27,807 INFO L225 Difference]: With dead ends: 95 [2022-11-21 16:34:27,808 INFO L226 Difference]: Without dead ends: 95 [2022-11-21 16:34:27,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=759, Invalid=6181, Unknown=40, NotChecked=330, Total=7310 [2022-11-21 16:34:27,810 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 488 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:27,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 553 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1415 Invalid, 0 Unknown, 115 Unchecked, 1.3s Time] [2022-11-21 16:34:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-21 16:34:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 62. [2022-11-21 16:34:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-11-21 16:34:27,813 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 36 [2022-11-21 16:34:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:27,813 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-11-21 16:34:27,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 60 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-11-21 16:34:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:34:27,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:27,814 INFO L195 NwaCegarLoop]: trace histogram [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-21 16:34:27,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 16:34:28,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:28,019 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:28,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435684, now seen corresponding path program 1 times [2022-11-21 16:34:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:28,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52174282] [2022-11-21 16:34:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:34:29,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:29,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52174282] [2022-11-21 16:34:29,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52174282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:29,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881644664] [2022-11-21 16:34:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:29,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:29,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:34:29,119 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:34:29,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 16:34:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:29,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-21 16:34:29,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:34:29,381 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-21 16:34:29,491 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:34:29,492 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-21 16:34:29,555 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-21 16:34:29,615 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 23 treesize of output 22 [2022-11-21 16:34:29,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:34:29,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-21 16:34:29,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:29,940 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-21 16:34:29,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 18 [2022-11-21 16:34:30,269 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-21 16:34:30,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-21 16:34:30,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 16:34:30,392 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-21 16:34:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:34:30,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:34:30,598 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 60 treesize of output 56 [2022-11-21 16:34:34,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:34,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 116 [2022-11-21 16:34:34,343 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 8 treesize of output 6 [2022-11-21 16:34:35,523 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 28 treesize of output 20 [2022-11-21 16:34:35,736 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1459))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ 4 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse0 4)))))))) is different from false [2022-11-21 16:34:35,758 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1457 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1457)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1459))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse0)) (<= 0 (+ 4 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse0 4)))))))) is different from false [2022-11-21 16:34:35,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:35,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 53 [2022-11-21 16:34:35,827 INFO L321 Elim1Store]: treesize reduction 25, result has 65.3 percent of original size [2022-11-21 16:34:35,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 136 [2022-11-21 16:34:35,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:34:35,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 123 [2022-11-21 16:34:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 16:34:36,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881644664] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:34:36,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:34:36,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 56 [2022-11-21 16:34:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588782959] [2022-11-21 16:34:36,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:34:36,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-21 16:34:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-21 16:34:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2755, Unknown=2, NotChecked=214, Total=3192 [2022-11-21 16:34:36,934 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 57 states, 56 states have (on average 1.875) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:46,871 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2022-11-21 16:34:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-21 16:34:46,871 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.875) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-21 16:34:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:46,871 INFO L225 Difference]: With dead ends: 114 [2022-11-21 16:34:46,872 INFO L226 Difference]: Without dead ends: 114 [2022-11-21 16:34:46,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=866, Invalid=5782, Unknown=2, NotChecked=322, Total=6972 [2022-11-21 16:34:46,874 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 781 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:46,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 573 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1095 Invalid, 0 Unknown, 158 Unchecked, 1.1s Time] [2022-11-21 16:34:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-21 16:34:46,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 62. [2022-11-21 16:34:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 61 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-11-21 16:34:46,877 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 36 [2022-11-21 16:34:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:46,877 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-11-21 16:34:46,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.875) internal successors, (105), 57 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-11-21 16:34:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 16:34:46,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:46,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:34:46,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:34:47,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 16:34:47,084 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1988076587, now seen corresponding path program 1 times [2022-11-21 16:34:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:47,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446278671] [2022-11-21 16:34:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:34:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:47,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446278671] [2022-11-21 16:34:47,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446278671] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:47,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111378321] [2022-11-21 16:34:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:47,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:47,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:34:47,219 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:34:47,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 16:34:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:47,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:34:47,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:34:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:34:47,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:34:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:34:47,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111378321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:34:47,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:34:47,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-21 16:34:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277690207] [2022-11-21 16:34:47,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:34:47,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:34:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:34:47,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:34:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:34:47,553 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:34:47,592 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-11-21 16:34:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:34:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-21 16:34:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:34:47,593 INFO L225 Difference]: With dead ends: 62 [2022-11-21 16:34:47,593 INFO L226 Difference]: Without dead ends: 62 [2022-11-21 16:34:47,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:34:47,594 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 74 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:34:47,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 119 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:34:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-21 16:34:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-21 16:34:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-11-21 16:34:47,596 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 37 [2022-11-21 16:34:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:34:47,596 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-11-21 16:34:47,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:34:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-11-21 16:34:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 16:34:47,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:34:47,597 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:34:47,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 16:34:47,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-21 16:34:47,804 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-21 16:34:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:34:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash -695048217, now seen corresponding path program 1 times [2022-11-21 16:34:47,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:34:47,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290388446] [2022-11-21 16:34:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:34:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:34:50,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:34:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290388446] [2022-11-21 16:34:50,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290388446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:34:50,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116414203] [2022-11-21 16:34:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:34:50,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:34:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:34:50,686 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:34:50,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4811247c-d5dc-4a6f-933f-c3181c003529/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 16:34:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:34:50,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-21 16:34:50,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:34:50,962 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-21 16:34:51,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:34:51,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:34:51,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:34:51,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:34:51,340 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:34:51,340 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-21 16:34:51,479 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-21 16:34:51,490 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-21 16:34:51,517 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-21 16:34:51,536 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-21 16:34:51,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-21 16:34:51,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-21 16:34:51,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:51,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:51,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:34:51,768 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 16:34:51,769 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 1 case distinctions, treesize of input 110 treesize of output 73 [2022-11-21 16:34:51,788 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-21 16:34:51,788 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 1 case distinctions, treesize of input 54 treesize of output 47 [2022-11-21 16:34:52,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:34:52,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:52,980 INFO L321 Elim1Store]: treesize reduction 154, result has 16.8 percent of original size [2022-11-21 16:34:52,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 118 treesize of output 91 [2022-11-21 16:34:52,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:53,051 INFO L321 Elim1Store]: treesize reduction 188, result has 16.4 percent of original size [2022-11-21 16:34:53,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 149 treesize of output 139 [2022-11-21 16:34:53,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:53,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:34:53,505 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-21 16:34:53,505 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 6 case distinctions, treesize of input 121 treesize of output 88 [2022-11-21 16:34:53,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:53,529 INFO L321 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-21 16:34:53,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 56 [2022-11-21 16:34:54,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:54,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:34:54,055 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-21 16:34:54,056 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 85 treesize of output 48 [2022-11-21 16:34:54,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:34:54,082 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 16:34:54,082 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 21 [2022-11-21 16:34:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:34:54,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:35:12,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:35:12,466 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 1780 treesize of output 1296 [2022-11-21 16:35:12,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:35:12,504 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 1300 treesize of output 936 [2022-11-21 16:35:12,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:35:12,592 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 1780 treesize of output 1396 [2022-11-21 16:35:12,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:35:12,621 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 1400 treesize of output 936 [2022-11-21 16:35:32,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:35:32,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2210 treesize of output 1480 [2022-11-21 16:35:32,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:35:32,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1490 treesize of output 940 [2022-11-21 16:35:32,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:36:00,135 WARN L233 SmtUtils]: Spent 25.32s on a formula simplification. DAG size of input: 308 DAG size of output: 204 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-21 16:36:00,137 INFO L321 Elim1Store]: treesize reduction 524, result has 44.7 percent of original size [2022-11-21 16:36:00,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 19 new quantified variables, introduced 66 case distinctions, treesize of input 2596932 treesize of output 2344178 [2022-11-21 16:36:55,489 INFO L217 Elim1Store]: Index analysis took 110 ms