./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_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_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/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_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/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_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- 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 09:15:52,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:15:52,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:15:52,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:15:52,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:15:52,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:15:52,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:15:52,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:15:52,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:15:52,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:15:52,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:15:52,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:15:52,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:15:52,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:15:52,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:15:52,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:15:52,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:15:52,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:15:52,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:15:52,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:15:52,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:15:52,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:15:52,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:15:52,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:15:52,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:15:52,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:15:52,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:15:52,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:15:52,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:15:52,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:15:52,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:15:52,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:15:52,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:15:52,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:15:52,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:15:52,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:15:52,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:15:52,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:15:52,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:15:52,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:15:52,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:15:52,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 09:15:52,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:15:52,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:15:52,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:15:52,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:15:52,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:15:52,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:15:52,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:15:52,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:15:52,681 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:15:52,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:15:52,682 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:15:52,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 09:15:52,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:15:52,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:15:52,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:15:52,683 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 09:15:52,684 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 09:15:52,684 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 09:15:52,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:15:52,685 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 09:15:52,685 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:15:52,686 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:15:52,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:15:52,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:15:52,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:15:52,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:15:52,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:15:52,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:15:52,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 09:15:52,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 09:15:52,689 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_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/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_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2022-11-21 09:15:53,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:15:53,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:15:53,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:15:53,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:15:53,167 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:15:53,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-21 09:15:56,898 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:15:57,229 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:15:57,230 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-21 09:15:57,263 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/data/fb68c6f8b/ae934011cd49486e8549db93e7b4ccb5/FLAGf90f67276 [2022-11-21 09:15:57,281 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/data/fb68c6f8b/ae934011cd49486e8549db93e7b4ccb5 [2022-11-21 09:15:57,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:15:57,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:15:57,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:15:57,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:15:57,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:15:57,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:57" (1/1) ... [2022-11-21 09:15:57,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7152c2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:57, skipping insertion in model container [2022-11-21 09:15:57,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:57" (1/1) ... [2022-11-21 09:15:57,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:15:57,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:15:57,921 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_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-21 09:15:57,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:15:57,948 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:15:58,048 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_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-21 09:15:58,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:15:58,093 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:15:58,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58 WrapperNode [2022-11-21 09:15:58,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:15:58,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:15:58,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:15:58,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:15:58,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,204 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-11-21 09:15:58,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:15:58,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:15:58,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:15:58,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:15:58,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,261 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:15:58,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:15:58,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:15:58,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:15:58,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (1/1) ... [2022-11-21 09:15:58,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:15:58,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:15:58,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:15:58,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:15:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-21 09:15:58,388 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-21 09:15:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 09:15:58,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 09:15:58,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 09:15:58,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:15:58,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 09:15:58,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 09:15:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 09:15:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 09:15:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:15:58,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:15:58,532 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:15:58,535 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:15:58,578 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-21 09:15:58,991 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:15:59,000 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:15:59,001 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-21 09:15:59,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:59 BoogieIcfgContainer [2022-11-21 09:15:59,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:15:59,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:15:59,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:15:59,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:15:59,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:15:57" (1/3) ... [2022-11-21 09:15:59,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b787efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:59, skipping insertion in model container [2022-11-21 09:15:59,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:58" (2/3) ... [2022-11-21 09:15:59,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b787efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:59, skipping insertion in model container [2022-11-21 09:15:59,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:59" (3/3) ... [2022-11-21 09:15:59,016 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2022-11-21 09:15:59,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:15:59,044 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-11-21 09:15:59,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:15:59,118 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;@e0b8ae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:15:59,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-11-21 09:15:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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 09:15:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 09:15:59,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:15:59,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 09:15:59,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:15:59,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:15:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-21 09:15:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:15:59,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151889188] [2022-11-21 09:15:59,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:59,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:15:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:15:59,420 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 09:15:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:15:59,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151889188] [2022-11-21 09:15:59,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151889188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:15:59,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:15:59,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:15:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100844300] [2022-11-21 09:15:59,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:15:59,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:15:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:15:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:15:59,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:15:59,473 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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 09:15:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:15:59,669 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-11-21 09:15:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:15:59,674 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 09:15:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:15:59,686 INFO L225 Difference]: With dead ends: 111 [2022-11-21 09:15:59,686 INFO L226 Difference]: Without dead ends: 104 [2022-11-21 09:15:59,688 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 09:15:59,696 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:15:59,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:15:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-21 09:15:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-21 09:15:59,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 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 09:15:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-21 09:15:59,758 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-11-21 09:15:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:15:59,760 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-21 09:15:59,761 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 09:15:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-21 09:15:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 09:15:59,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:15:59,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 09:15:59,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 09:15:59,762 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:15:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:15:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-21 09:15:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:15:59,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167880056] [2022-11-21 09:15:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:15:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:00,038 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 09:16:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:00,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167880056] [2022-11-21 09:16:00,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167880056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:00,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:16:00,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:16:00,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475047990] [2022-11-21 09:16:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:00,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:16:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:00,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:16:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:16:00,047 INFO L87 Difference]: Start difference. First operand 59 states and 65 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 09:16:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:00,187 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-11-21 09:16:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:16:00,195 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 09:16:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:00,198 INFO L225 Difference]: With dead ends: 101 [2022-11-21 09:16:00,200 INFO L226 Difference]: Without dead ends: 101 [2022-11-21 09:16:00,201 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 09:16:00,204 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:00,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-21 09:16:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-11-21 09:16:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:16:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-21 09:16:00,223 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-11-21 09:16:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:00,225 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-21 09:16:00,226 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 09:16:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-21 09:16:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 09:16:00,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:00,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:00,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 09:16:00,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:00,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-11-21 09:16:00,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:00,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706969947] [2022-11-21 09:16:00,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:00,339 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 09:16:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706969947] [2022-11-21 09:16:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706969947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:00,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:16:00,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:16:00,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830309972] [2022-11-21 09:16:00,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:00,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:16:00,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:00,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:16:00,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:16:00,343 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:00,360 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-11-21 09:16:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:16:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-21 09:16:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:00,362 INFO L225 Difference]: With dead ends: 66 [2022-11-21 09:16:00,362 INFO L226 Difference]: Without dead ends: 66 [2022-11-21 09:16:00,362 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 09:16:00,364 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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 09:16:00,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-21 09:16:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-11-21 09:16:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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 09:16:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-11-21 09:16:00,373 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-11-21 09:16:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:00,373 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-11-21 09:16:00,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-11-21 09:16:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 09:16:00,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:00,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:00,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 09:16:00,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-21 09:16:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:00,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577488938] [2022-11-21 09:16:00,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:00,449 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 09:16:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:00,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577488938] [2022-11-21 09:16:00,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577488938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:00,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:16:00,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:16:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434873278] [2022-11-21 09:16:00,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:00,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:16:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:00,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:16:00,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:16:00,453 INFO L87 Difference]: Start difference. First operand 57 states and 63 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 09:16:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:00,478 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-21 09:16:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:16:00,479 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 09:16:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:00,480 INFO L225 Difference]: With dead ends: 63 [2022-11-21 09:16:00,480 INFO L226 Difference]: Without dead ends: 63 [2022-11-21 09:16:00,481 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 09:16:00,482 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 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 09:16:00,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-21 09:16:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-21 09:16:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-21 09:16:00,490 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-11-21 09:16:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:00,490 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-21 09:16:00,490 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 09:16:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-21 09:16:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 09:16:00,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:00,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:00,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 09:16:00,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-11-21 09:16:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:00,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639448051] [2022-11-21 09:16:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:00,595 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 09:16:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:00,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639448051] [2022-11-21 09:16:00,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639448051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:00,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903377653] [2022-11-21 09:16:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:00,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:00,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:00,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:00,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 09:16:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:00,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 09:16:00,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:00,806 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 09:16:00,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:00,858 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 09:16:00,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903377653] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:00,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:00,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-21 09:16:00,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344004177] [2022-11-21 09:16:00,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:00,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:16:00,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:16:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:16:00,862 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 09:16:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:00,883 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-21 09:16:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:16:00,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 15 [2022-11-21 09:16:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:00,885 INFO L225 Difference]: With dead ends: 64 [2022-11-21 09:16:00,885 INFO L226 Difference]: Without dead ends: 64 [2022-11-21 09:16:00,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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 09:16:00,887 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 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 09:16:00,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-21 09:16:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-21 09:16:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 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 09:16:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-21 09:16:00,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-11-21 09:16:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:00,895 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-21 09:16:00,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 09:16:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-21 09:16:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:16:00,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:00,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:00,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:01,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:01,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:01,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-21 09:16:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:01,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816397526] [2022-11-21 09:16:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:01,469 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 09:16:01,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:01,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816397526] [2022-11-21 09:16:01,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816397526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:01,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063264174] [2022-11-21 09:16:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:01,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:01,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:01,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 09:16:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:01,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 09:16:01,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:01,687 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 09:16:01,805 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 09:16:01,806 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 09:16:01,831 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 09:16:01,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:02,083 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 09:16:02,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063264174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:02,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:02,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-21 09:16:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708656891] [2022-11-21 09:16:02,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:02,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:16:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:16:02,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:16:02,092 INFO L87 Difference]: Start difference. First operand 64 states and 70 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 09:16:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:02,212 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-21 09:16:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:16:02,213 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 09:16:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:02,214 INFO L225 Difference]: With dead ends: 77 [2022-11-21 09:16:02,215 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 09:16:02,216 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 09:16:02,219 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:02,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 09:16:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-11-21 09:16:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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 09:16:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-11-21 09:16:02,241 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-11-21 09:16:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:02,242 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-11-21 09:16:02,242 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 09:16:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-11-21 09:16:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:16:02,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:02,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:02,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:02,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 09:16:02,454 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:02,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-21 09:16:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:02,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573828586] [2022-11-21 09:16:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:02,755 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 09:16:02,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:02,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573828586] [2022-11-21 09:16:02,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573828586] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:02,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498933850] [2022-11-21 09:16:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:02,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:02,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:02,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:02,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 09:16:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:02,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 09:16:02,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:02,916 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 09:16:02,924 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 09:16:03,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:16:03,025 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 09:16:03,039 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:16:03,040 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 09:16:03,075 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 09:16:03,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:09,535 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 09:16:09,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498933850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:09,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:09,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-11-21 09:16:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556512728] [2022-11-21 09:16:09,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:09,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 09:16:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 09:16:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:16:09,538 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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 09:16:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:09,725 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-21 09:16:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:16:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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 09:16:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:09,727 INFO L225 Difference]: With dead ends: 76 [2022-11-21 09:16:09,727 INFO L226 Difference]: Without dead ends: 76 [2022-11-21 09:16:09,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-21 09:16:09,728 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 346 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:09,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 67 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-21 09:16:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-11-21 09:16:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-21 09:16:09,734 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-11-21 09:16:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:09,735 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-21 09:16:09,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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 09:16:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-21 09:16:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 09:16:09,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:09,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:09,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:09,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:09,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-11-21 09:16:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:09,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684312031] [2022-11-21 09:16:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:10,036 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 09:16:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:10,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684312031] [2022-11-21 09:16:10,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684312031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:10,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947349244] [2022-11-21 09:16:10,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:16:10,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:10,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:10,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:10,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 09:16:10,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 09:16:10,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:16:10,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 09:16:10,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:10,209 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 09:16:10,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:16:10,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947349244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:10,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 09:16:10,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-21 09:16:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390726858] [2022-11-21 09:16:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:10,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:16:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:16:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:16:10,213 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 09:16:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:10,280 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-11-21 09:16:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:16:10,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 09:16:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:10,283 INFO L225 Difference]: With dead ends: 160 [2022-11-21 09:16:10,283 INFO L226 Difference]: Without dead ends: 160 [2022-11-21 09:16:10,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 09:16:10,285 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 115 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:10,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 212 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-21 09:16:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 64. [2022-11-21 09:16:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 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 09:16:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-11-21 09:16:10,296 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2022-11-21 09:16:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:10,297 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-11-21 09:16:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 09:16:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-11-21 09:16:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 09:16:10,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:10,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:10,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:10,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 09:16:10,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:10,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2022-11-21 09:16:10,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:10,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134838469] [2022-11-21 09:16:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:10,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:10,594 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 09:16:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:10,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134838469] [2022-11-21 09:16:10,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134838469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:10,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532702524] [2022-11-21 09:16:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:10,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:10,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:10,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:10,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 09:16:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:10,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 09:16:10,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:10,768 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 09:16:10,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:10,792 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 09:16:10,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532702524] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:10,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:10,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-21 09:16:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236182372] [2022-11-21 09:16:10,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:10,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:16:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:16:10,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:16:10,795 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 09:16:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:10,831 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-21 09:16:10,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:16:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 22 [2022-11-21 09:16:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:10,833 INFO L225 Difference]: With dead ends: 64 [2022-11-21 09:16:10,833 INFO L226 Difference]: Without dead ends: 64 [2022-11-21 09:16:10,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 09:16:10,834 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 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 09:16:10,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-21 09:16:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-21 09:16:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 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 09:16:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-21 09:16:10,839 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 22 [2022-11-21 09:16:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:10,840 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-21 09:16:10,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 09:16:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-21 09:16:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 09:16:10,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:10,841 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 09:16:10,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:11,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:11,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2022-11-21 09:16:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953348536] [2022-11-21 09:16:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:11,197 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 09:16:11,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:11,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953348536] [2022-11-21 09:16:11,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953348536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:11,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:16:11,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:16:11,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694860239] [2022-11-21 09:16:11,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:11,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:16:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:11,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:16:11,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:16:11,201 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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 09:16:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:11,410 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-21 09:16:11,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:16:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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 09:16:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:11,412 INFO L225 Difference]: With dead ends: 114 [2022-11-21 09:16:11,412 INFO L226 Difference]: Without dead ends: 114 [2022-11-21 09:16:11,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 09:16:11,413 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:11,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-21 09:16:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 67. [2022-11-21 09:16:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 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 09:16:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-21 09:16:11,417 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 23 [2022-11-21 09:16:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:11,418 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-21 09:16:11,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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 09:16:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-21 09:16:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 09:16:11,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:11,419 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 09:16:11,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 09:16:11,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2022-11-21 09:16:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:11,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641533420] [2022-11-21 09:16:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:11,710 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 09:16:11,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:11,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641533420] [2022-11-21 09:16:11,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641533420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:11,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:16:11,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:16:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302977650] [2022-11-21 09:16:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:16:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:16:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:16:11,715 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 09:16:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:11,933 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-21 09:16:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:16:11,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 09:16:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:11,934 INFO L225 Difference]: With dead ends: 102 [2022-11-21 09:16:11,935 INFO L226 Difference]: Without dead ends: 102 [2022-11-21 09:16:11,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 09:16:11,935 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:11,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-21 09:16:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2022-11-21 09:16:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 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 09:16:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-21 09:16:11,946 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 23 [2022-11-21 09:16:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:11,947 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-21 09:16:11,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 09:16:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-21 09:16:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 09:16:11,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:11,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:11,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 09:16:11,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-11-21 09:16:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:11,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419046963] [2022-11-21 09:16:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:12,080 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 09:16:12,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:12,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419046963] [2022-11-21 09:16:12,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419046963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:12,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:16:12,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:16:12,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227881338] [2022-11-21 09:16:12,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:12,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:16:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:16:12,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:16:12,083 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 09:16:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:12,288 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-11-21 09:16:12,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:16:12,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 25 [2022-11-21 09:16:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:12,289 INFO L225 Difference]: With dead ends: 102 [2022-11-21 09:16:12,289 INFO L226 Difference]: Without dead ends: 102 [2022-11-21 09:16:12,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 09:16:12,290 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:12,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-21 09:16:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2022-11-21 09:16:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-21 09:16:12,294 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 25 [2022-11-21 09:16:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:12,294 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-21 09:16:12,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 09:16:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-21 09:16:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 09:16:12,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:12,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:12,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 09:16:12,296 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:12,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2022-11-21 09:16:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:12,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788085899] [2022-11-21 09:16:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:12,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:12,404 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 09:16:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:12,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788085899] [2022-11-21 09:16:12,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788085899] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:12,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083230507] [2022-11-21 09:16:12,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:12,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:12,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 09:16:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:12,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 09:16:12,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:12,590 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 09:16:12,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:16:12,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083230507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:12,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 09:16:12,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-21 09:16:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706703435] [2022-11-21 09:16:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:12,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:16:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:16:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:16:12,594 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 09:16:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:12,616 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-11-21 09:16:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:16:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-21 09:16:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:12,617 INFO L225 Difference]: With dead ends: 91 [2022-11-21 09:16:12,618 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 09:16:12,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:16:12,619 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 87 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:12,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 105 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 09:16:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2022-11-21 09:16:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-21 09:16:12,625 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 25 [2022-11-21 09:16:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:12,625 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-21 09:16:12,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 09:16:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-21 09:16:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 09:16:12,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:12,626 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 09:16:12,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:12,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 09:16:12,827 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2022-11-21 09:16:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:12,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346011114] [2022-11-21 09:16:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 09:16:13,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:13,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346011114] [2022-11-21 09:16:13,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346011114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:13,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:16:13,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:16:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28817205] [2022-11-21 09:16:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:13,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:16:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:16:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:16:13,167 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 09:16:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:13,363 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-11-21 09:16:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:16:13,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 09:16:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:13,365 INFO L225 Difference]: With dead ends: 94 [2022-11-21 09:16:13,365 INFO L226 Difference]: Without dead ends: 94 [2022-11-21 09:16:13,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 09:16:13,365 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 324 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:13,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 75 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-21 09:16:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2022-11-21 09:16:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 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 09:16:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-21 09:16:13,369 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 30 [2022-11-21 09:16:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:13,370 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-21 09:16:13,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 09:16:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-21 09:16:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 09:16:13,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:13,371 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] [2022-11-21 09:16:13,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 09:16:13,371 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2022-11-21 09:16:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:13,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203251909] [2022-11-21 09:16:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:16:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203251909] [2022-11-21 09:16:13,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203251909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293430188] [2022-11-21 09:16:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:13,486 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:13,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 09:16:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:13,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 09:16:13,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:16:13,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:16:13,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293430188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:13,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:13,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-21 09:16:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382677131] [2022-11-21 09:16:13,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:13,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:16:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:13,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:16:13,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:16:13,720 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:13,797 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-11-21 09:16:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:16:13,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-21 09:16:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:13,799 INFO L225 Difference]: With dead ends: 136 [2022-11-21 09:16:13,800 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 09:16:13,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:16:13,802 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 257 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:13,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 202 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 09:16:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2022-11-21 09:16:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.375) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2022-11-21 09:16:13,806 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 31 [2022-11-21 09:16:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:13,808 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2022-11-21 09:16:13,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-11-21 09:16:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 09:16:13,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:13,813 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] [2022-11-21 09:16:13,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:14,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 09:16:14,019 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2022-11-21 09:16:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:14,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588222665] [2022-11-21 09:16:14,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 09:16:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:14,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588222665] [2022-11-21 09:16:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588222665] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:14,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454870162] [2022-11-21 09:16:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:14,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:14,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:14,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:14,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 09:16:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:14,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-21 09:16:14,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:14,969 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 09:16:15,015 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:16:15,016 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 09:16:15,037 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 09:16:15,050 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 09:16:15,085 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:16:15,086 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 09:16:15,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:16:15,320 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 29 treesize of output 24 [2022-11-21 09:16:15,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 09:16:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 09:16:15,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:18,075 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-21 09:16:18,075 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 21 treesize of output 20 [2022-11-21 09:16:18,083 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |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 09:16:18,098 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 Int) (v_ArrVal_886 (Array Int Int))) (= (select (select (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_884)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |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 09:16:18,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:18,115 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 27 treesize of output 33 [2022-11-21 09:16:18,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-21 09:16:18,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 09:16:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-21 09:16:18,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454870162] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:18,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:18,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 31 [2022-11-21 09:16:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794549913] [2022-11-21 09:16:18,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:18,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 09:16:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 09:16:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=781, Unknown=3, NotChecked=114, Total=992 [2022-11-21 09:16:18,268 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 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 09:16:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:20,421 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-11-21 09:16:20,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 09:16:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 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 31 [2022-11-21 09:16:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:20,424 INFO L225 Difference]: With dead ends: 155 [2022-11-21 09:16:20,424 INFO L226 Difference]: Without dead ends: 155 [2022-11-21 09:16:20,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=400, Invalid=1585, Unknown=3, NotChecked=174, Total=2162 [2022-11-21 09:16:20,425 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1078 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:20,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 709 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 802 Invalid, 0 Unknown, 180 Unchecked, 1.0s Time] [2022-11-21 09:16:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-21 09:16:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 89. [2022-11-21 09:16:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2022-11-21 09:16:20,430 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 31 [2022-11-21 09:16:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:20,431 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2022-11-21 09:16:20,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 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 09:16:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-11-21 09:16:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 09:16:20,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:20,432 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] [2022-11-21 09:16:20,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:20,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 09:16:20,639 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2022-11-21 09:16:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:20,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283938899] [2022-11-21 09:16:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 09:16:21,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:21,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283938899] [2022-11-21 09:16:21,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283938899] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:21,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131779476] [2022-11-21 09:16:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:21,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:21,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:21,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:21,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 09:16:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:22,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-21 09:16:22,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:22,114 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 09:16:22,222 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:16:22,223 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 09:16:22,296 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 09:16:22,313 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 09:16:22,381 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 09:16:22,395 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 09:16:22,456 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:16:22,457 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 54 treesize of output 53 [2022-11-21 09:16:22,469 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 41 treesize of output 41 [2022-11-21 09:16:22,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:16:22,883 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 34 treesize of output 29 [2022-11-21 09:16:22,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:16:22,893 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 35 treesize of output 30 [2022-11-21 09:16:23,044 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 31 treesize of output 19 [2022-11-21 09:16:23,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-21 09:16:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 09:16:23,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:24,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:24,126 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 47 treesize of output 51 [2022-11-21 09:16:24,381 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1001 Int) (v_prenex_1 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1001)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int))) (= (select (select (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|) .cse1 v_ArrVal_1000)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1001 Int) (v_ArrVal_1003 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1001)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))) is different from false [2022-11-21 09:16:24,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:24,408 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 27 treesize of output 33 [2022-11-21 09:16:24,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-21 09:16:24,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 09:16:24,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:24,432 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 27 treesize of output 33 [2022-11-21 09:16:24,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:16:24,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 09:16:24,457 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 09:16:24,457 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 29 treesize of output 1 [2022-11-21 09:16:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-21 09:16:24,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131779476] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:24,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:24,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2022-11-21 09:16:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346596175] [2022-11-21 09:16:24,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:24,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 09:16:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 09:16:24,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1357, Unknown=13, NotChecked=74, Total=1560 [2022-11-21 09:16:24,763 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 40 states, 39 states have (on average 2.282051282051282) internal successors, (89), 40 states have internal predecessors, (89), 0 states have call successors, (0), 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 09:16:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:29,890 INFO L93 Difference]: Finished difference Result 235 states and 259 transitions. [2022-11-21 09:16:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 09:16:29,891 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.282051282051282) internal successors, (89), 40 states have internal predecessors, (89), 0 states have call successors, (0), 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 09:16:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:29,892 INFO L225 Difference]: With dead ends: 235 [2022-11-21 09:16:29,892 INFO L226 Difference]: Without dead ends: 235 [2022-11-21 09:16:29,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=482, Invalid=2589, Unknown=13, NotChecked=108, Total=3192 [2022-11-21 09:16:29,895 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2394 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:29,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 773 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1080 Invalid, 0 Unknown, 141 Unchecked, 1.9s Time] [2022-11-21 09:16:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-21 09:16:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 97. [2022-11-21 09:16:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 96 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2022-11-21 09:16:29,900 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 31 [2022-11-21 09:16:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:29,901 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2022-11-21 09:16:29,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.282051282051282) internal successors, (89), 40 states have internal predecessors, (89), 0 states have call successors, (0), 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 09:16:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2022-11-21 09:16:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 09:16:29,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:29,902 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] [2022-11-21 09:16:29,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-21 09:16:30,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 09:16:30,110 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2022-11-21 09:16:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:30,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062987746] [2022-11-21 09:16:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 09:16:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:30,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062987746] [2022-11-21 09:16:30,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062987746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:30,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:16:30,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:16:30,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077446487] [2022-11-21 09:16:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:30,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:16:30,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:30,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:16:30,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:16:30,223 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:30,257 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2022-11-21 09:16:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:16:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-21 09:16:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:30,259 INFO L225 Difference]: With dead ends: 121 [2022-11-21 09:16:30,259 INFO L226 Difference]: Without dead ends: 121 [2022-11-21 09:16:30,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:16:30,262 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:30,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 161 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-21 09:16:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2022-11-21 09:16:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 97 states have internal predecessors, (115), 0 states have call successors, (0), 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 09:16:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2022-11-21 09:16:30,266 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 33 [2022-11-21 09:16:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:30,267 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2022-11-21 09:16:30,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-11-21 09:16:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 09:16:30,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:30,269 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] [2022-11-21 09:16:30,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 09:16:30,270 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1373031599, now seen corresponding path program 1 times [2022-11-21 09:16:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:30,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818518631] [2022-11-21 09:16:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:30,450 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 09:16:30,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:30,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818518631] [2022-11-21 09:16:30,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818518631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:30,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768929720] [2022-11-21 09:16:30,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:30,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:30,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:30,453 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:30,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 09:16:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:30,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 09:16:30,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:30,785 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 09:16:30,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:30,867 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 09:16:30,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768929720] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:30,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:30,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-21 09:16:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215117894] [2022-11-21 09:16:30,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 09:16:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:30,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 09:16:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-21 09:16:30,870 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:30,945 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2022-11-21 09:16:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:16:30,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-21 09:16:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:30,947 INFO L225 Difference]: With dead ends: 129 [2022-11-21 09:16:30,947 INFO L226 Difference]: Without dead ends: 129 [2022-11-21 09:16:30,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:16:30,948 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 148 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:30,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 199 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-21 09:16:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2022-11-21 09:16:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 103 states have internal predecessors, (121), 0 states have call successors, (0), 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 09:16:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2022-11-21 09:16:30,953 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 34 [2022-11-21 09:16:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:30,953 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2022-11-21 09:16:30,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2022-11-21 09:16:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 09:16:30,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:30,955 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:30,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:31,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:31,163 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618178, now seen corresponding path program 2 times [2022-11-21 09:16:31,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:31,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162723194] [2022-11-21 09:16:31,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:31,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 09:16:31,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:31,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162723194] [2022-11-21 09:16:31,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162723194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:31,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694133994] [2022-11-21 09:16:31,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:16:31,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:31,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:31,416 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:31,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 09:16:31,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 09:16:31,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:16:31,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 09:16:31,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 09:16:31,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 09:16:31,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694133994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:16:31,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 09:16:31,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2022-11-21 09:16:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055888861] [2022-11-21 09:16:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:16:31,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 09:16:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:31,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 09:16:31,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:16:31,826 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 09:16:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:31,862 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-11-21 09:16:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 09:16:31,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-21 09:16:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:31,863 INFO L225 Difference]: With dead ends: 82 [2022-11-21 09:16:31,863 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 09:16:31,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:16:31,864 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:31,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 135 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 09:16:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-11-21 09:16:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 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 09:16:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-21 09:16:31,867 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 39 [2022-11-21 09:16:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:31,867 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-21 09:16:31,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 09:16:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-21 09:16:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 09:16:31,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:31,868 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 09:16:31,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-21 09:16:32,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:32,068 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1273435421, now seen corresponding path program 2 times [2022-11-21 09:16:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:32,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867179570] [2022-11-21 09:16:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 09:16:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867179570] [2022-11-21 09:16:32,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867179570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320820065] [2022-11-21 09:16:32,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:16:32,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:32,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:32,332 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:32,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 09:16:32,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 09:16:32,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:16:32,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 09:16:32,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:16:32,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:16:32,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320820065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:32,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:32,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-11-21 09:16:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427452396] [2022-11-21 09:16:32,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:32,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 09:16:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 09:16:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:16:32,628 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 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 09:16:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:32,807 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-11-21 09:16:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 09:16:32,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-21 09:16:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:32,809 INFO L225 Difference]: With dead ends: 78 [2022-11-21 09:16:32,809 INFO L226 Difference]: Without dead ends: 78 [2022-11-21 09:16:32,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-21 09:16:32,810 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:32,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 305 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:16:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-21 09:16:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-11-21 09:16:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-21 09:16:32,814 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2022-11-21 09:16:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:32,814 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-21 09:16:32,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 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 09:16:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-21 09:16:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-21 09:16:32,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:32,816 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, 1, 1, 1] [2022-11-21 09:16:32,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:33,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:33,031 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 993974679, now seen corresponding path program 1 times [2022-11-21 09:16:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:33,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263665779] [2022-11-21 09:16:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:16:34,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:34,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263665779] [2022-11-21 09:16:34,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263665779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:34,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049127472] [2022-11-21 09:16:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:34,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:34,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:34,767 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:34,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 09:16:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:35,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-21 09:16:35,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:35,051 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 09:16:35,171 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:16:35,172 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 09:16:35,247 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 09:16:35,324 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 09:16:35,361 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:16:35,362 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 09:16:35,711 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 20 treesize of output 19 [2022-11-21 09:16:35,719 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 09:16:35,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:16:35,924 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 18 treesize of output 8 [2022-11-21 09:16:36,063 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 09:16:36,317 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 22 treesize of output 10 [2022-11-21 09:16:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:16:36,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:36,636 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1523 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1523) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1523 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1523) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-11-21 09:16:36,655 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1523 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1523) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1523 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1523) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-11-21 09:16:36,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1523 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_1523) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1523 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1523) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)))) is different from false [2022-11-21 09:16:36,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:36,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-21 09:16:36,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:36,930 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 58 treesize of output 61 [2022-11-21 09:16:36,938 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 23 treesize of output 21 [2022-11-21 09:16:36,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:36,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-21 09:16:36,979 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 58 treesize of output 50 [2022-11-21 09:16:36,989 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 23 treesize of output 21 [2022-11-21 09:16:37,360 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1518) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2022-11-21 09:16:37,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1516 Int) (v_ArrVal_1518 (Array Int Int))) (not (= (select (select (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_1516)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1518) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2022-11-21 09:16:37,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:37,398 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 28 treesize of output 34 [2022-11-21 09:16:37,402 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 39 treesize of output 27 [2022-11-21 09:16:37,407 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 4 [2022-11-21 09:16:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-21 09:16:37,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049127472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:37,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:37,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2022-11-21 09:16:37,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511846150] [2022-11-21 09:16:37,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:37,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-21 09:16:37,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:37,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-21 09:16:37,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2535, Unknown=34, NotChecked=530, Total=3306 [2022-11-21 09:16:37,595 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 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 09:16:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:43,587 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-11-21 09:16:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 09:16:43,591 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-21 09:16:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:43,592 INFO L225 Difference]: With dead ends: 97 [2022-11-21 09:16:43,592 INFO L226 Difference]: Without dead ends: 97 [2022-11-21 09:16:43,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=811, Invalid=5025, Unknown=36, NotChecked=770, Total=6642 [2022-11-21 09:16:43,596 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 523 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:43,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 647 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1179 Invalid, 0 Unknown, 455 Unchecked, 1.4s Time] [2022-11-21 09:16:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-21 09:16:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-11-21 09:16:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:16:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-11-21 09:16:43,599 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 42 [2022-11-21 09:16:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:43,599 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-11-21 09:16:43,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 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 09:16:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-11-21 09:16:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 09:16:43,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:43,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:43,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:43,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:43,801 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2022-11-21 09:16:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:43,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440720680] [2022-11-21 09:16:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:43,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 09:16:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440720680] [2022-11-21 09:16:45,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440720680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807177360] [2022-11-21 09:16:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:45,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:45,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:45,395 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:45,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 09:16:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:45,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-21 09:16:45,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:45,690 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 09:16:45,767 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:16:45,768 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 09:16:45,793 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 09:16:45,852 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 09:16:45,887 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:16:45,887 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 09:16:45,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:16:45,999 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 20 treesize of output 19 [2022-11-21 09:16:46,187 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:16:46,187 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 28 treesize of output 29 [2022-11-21 09:16:46,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 09:16:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 09:16:46,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:46,566 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-21 09:16:46,567 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 21 treesize of output 20 [2022-11-21 09:16:46,574 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1649) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) is different from false [2022-11-21 09:16:46,848 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1648))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1649) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-21 09:16:47,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1645))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1648)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_1649) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))))) is different from false [2022-11-21 09:16:47,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1643 Int) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (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_1643)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1645))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1648)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_1649) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))))) is different from false [2022-11-21 09:16:47,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:47,388 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 110 treesize of output 71 [2022-11-21 09:16:47,395 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 100 treesize of output 92 [2022-11-21 09:16:47,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:16:47,405 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 24 treesize of output 16 [2022-11-21 09:16:47,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:16:47,414 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 34 treesize of output 22 [2022-11-21 09:16:47,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 09:16:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 13 refuted. 1 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-21 09:16:47,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807177360] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:47,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:47,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 40 [2022-11-21 09:16:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067406357] [2022-11-21 09:16:47,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:47,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 09:16:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 09:16:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1186, Unknown=23, NotChecked=292, Total=1640 [2022-11-21 09:16:47,594 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 41 states, 40 states have (on average 3.075) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 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 09:16:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:49,806 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-11-21 09:16:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 09:16:49,807 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.075) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 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 48 [2022-11-21 09:16:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:49,808 INFO L225 Difference]: With dead ends: 125 [2022-11-21 09:16:49,808 INFO L226 Difference]: Without dead ends: 125 [2022-11-21 09:16:49,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=385, Invalid=2260, Unknown=23, NotChecked=412, Total=3080 [2022-11-21 09:16:49,810 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 454 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:49,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 712 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 926 Invalid, 1 Unknown, 408 Unchecked, 1.0s Time] [2022-11-21 09:16:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-21 09:16:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 80. [2022-11-21 09:16:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 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 09:16:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-11-21 09:16:49,814 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 48 [2022-11-21 09:16:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:49,815 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-11-21 09:16:49,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.075) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 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 09:16:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-11-21 09:16:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 09:16:49,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:49,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:49,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:50,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:50,024 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:50,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2022-11-21 09:16:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:50,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871315065] [2022-11-21 09:16:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 09:16:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:51,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871315065] [2022-11-21 09:16:51,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871315065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:51,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917908957] [2022-11-21 09:16:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:51,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:51,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:51,753 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:51,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 09:16:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:52,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-21 09:16:52,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:52,049 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 09:16:52,103 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:16:52,104 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 09:16:52,130 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 09:16:52,186 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 09:16:52,223 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:16:52,223 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 09:16:52,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:16:52,335 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 20 treesize of output 19 [2022-11-21 09:16:52,343 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 6 treesize of output 5 [2022-11-21 09:16:52,536 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:16:52,536 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 44 treesize of output 43 [2022-11-21 09:16:52,543 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 33 treesize of output 33 [2022-11-21 09:16:52,850 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 31 treesize of output 19 [2022-11-21 09:16:52,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-21 09:16:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 09:16:52,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:53,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:53,104 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 47 treesize of output 51 [2022-11-21 09:16:53,665 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 144 treesize of output 132 [2022-11-21 09:16:53,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-11-21 09:16:53,680 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 75 treesize of output 67 [2022-11-21 09:16:54,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1774 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (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_1770)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1772) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1774) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2022-11-21 09:16:54,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:16:54,339 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 31 treesize of output 37 [2022-11-21 09:16:54,345 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 45 treesize of output 41 [2022-11-21 09:16:54,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:16:54,352 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 38 treesize of output 30 [2022-11-21 09:16:54,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:16:54,358 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 4 [2022-11-21 09:16:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-21 09:16:54,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917908957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:54,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:54,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 40 [2022-11-21 09:16:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050950896] [2022-11-21 09:16:54,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:54,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 09:16:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:54,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 09:16:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1406, Unknown=9, NotChecked=76, Total=1640 [2022-11-21 09:16:54,525 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 41 states, 40 states have (on average 3.075) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 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 09:16:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:57,024 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2022-11-21 09:16:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 09:16:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.075) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 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 48 [2022-11-21 09:16:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:57,026 INFO L225 Difference]: With dead ends: 139 [2022-11-21 09:16:57,026 INFO L226 Difference]: Without dead ends: 139 [2022-11-21 09:16:57,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=518, Invalid=2899, Unknown=9, NotChecked=114, Total=3540 [2022-11-21 09:16:57,029 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 822 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:57,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 523 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 842 Invalid, 0 Unknown, 78 Unchecked, 1.1s Time] [2022-11-21 09:16:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-21 09:16:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 79. [2022-11-21 09:16:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 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 09:16:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-11-21 09:16:57,033 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 48 [2022-11-21 09:16:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:57,033 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-11-21 09:16:57,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.075) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 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 09:16:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-11-21 09:16:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 09:16:57,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:57,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:57,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:57,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 09:16:57,242 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:57,242 INFO L85 PathProgramCache]: Analyzing trace with hash 594303751, now seen corresponding path program 1 times [2022-11-21 09:16:57,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:57,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797986766] [2022-11-21 09:16:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:57,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 09:16:57,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:57,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797986766] [2022-11-21 09:16:57,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797986766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:57,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500717174] [2022-11-21 09:16:57,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:57,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:57,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:57,378 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:57,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-21 09:16:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:57,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 09:16:57,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 09:16:57,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 09:16:57,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500717174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:57,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:57,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-21 09:16:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515211420] [2022-11-21 09:16:57,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:57,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:16:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:16:57,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:16:57,797 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:57,879 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-11-21 09:16:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 09:16:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 48 [2022-11-21 09:16:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:57,880 INFO L225 Difference]: With dead ends: 70 [2022-11-21 09:16:57,880 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 09:16:57,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:16:57,881 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 87 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:57,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 148 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 09:16:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-21 09:16:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 69 states have internal predecessors, (72), 0 states have call successors, (0), 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 09:16:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2022-11-21 09:16:57,885 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 48 [2022-11-21 09:16:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:57,885 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2022-11-21 09:16:57,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-11-21 09:16:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 09:16:57,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:57,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:57,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:58,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-21 09:16:58,094 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1192975024, now seen corresponding path program 1 times [2022-11-21 09:16:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:58,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933618468] [2022-11-21 09:16:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:58,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 09:16:58,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:16:58,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933618468] [2022-11-21 09:16:58,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933618468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:16:58,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882309326] [2022-11-21 09:16:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:58,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:16:58,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:16:58,224 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:16:58,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-21 09:16:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:16:58,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 09:16:58,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:16:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 09:16:58,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:16:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 09:16:58,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882309326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:16:58,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:16:58,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-21 09:16:58,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722213018] [2022-11-21 09:16:58,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:16:58,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 09:16:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:16:58,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 09:16:58,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:16:58,597 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:16:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:16:58,660 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-11-21 09:16:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:16:58,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 49 [2022-11-21 09:16:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:16:58,661 INFO L225 Difference]: With dead ends: 70 [2022-11-21 09:16:58,661 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 09:16:58,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:16:58,662 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 41 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:16:58,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 174 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:16:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 09:16:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-21 09:16:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.126984126984127) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 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 09:16:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-11-21 09:16:58,665 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 49 [2022-11-21 09:16:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:16:58,665 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-11-21 09:16:58,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:16:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-11-21 09:16:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-21 09:16:58,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:16:58,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:16:58,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-21 09:16:58,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 09:16:58,876 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:16:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:16:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1925550127, now seen corresponding path program 1 times [2022-11-21 09:16:58,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:16:58,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025793155] [2022-11-21 09:16:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:16:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:16:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:17:00,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:17:00,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025793155] [2022-11-21 09:17:00,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025793155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:17:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999491300] [2022-11-21 09:17:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:00,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:17:00,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:17:00,943 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:17:00,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-21 09:17:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:01,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 103 conjunts are in the unsatisfiable core [2022-11-21 09:17:01,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:17:01,285 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 09:17:01,427 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:17:01,428 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 09:17:01,518 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 09:17:01,600 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 09:17:01,639 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:17:01,640 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 09:17:02,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:02,064 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 20 treesize of output 19 [2022-11-21 09:17:02,521 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:17:02,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-21 09:17:02,529 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 31 treesize of output 21 [2022-11-21 09:17:02,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:02,534 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 34 treesize of output 36 [2022-11-21 09:17:03,078 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 46 treesize of output 30 [2022-11-21 09:17:03,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-21 09:17:03,223 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 22 treesize of output 10 [2022-11-21 09:17:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:17:03,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:17:03,951 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 86 treesize of output 64 [2022-11-21 09:17:03,973 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 86 treesize of output 64 [2022-11-21 09:17:04,005 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2137 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2137) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (forall ((v_ArrVal_2136 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2136) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse1) (<= .cse1 |c_ULTIMATE.start_dll_update_at_~data#1|))) is different from false [2022-11-21 09:17:04,043 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2137 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2137) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse1) (<= .cse1 |c_ULTIMATE.start_dll_update_at_~data#1|) (forall ((v_ArrVal_2136 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2136) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset|)))) is different from false [2022-11-21 09:17:04,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:04,065 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 50 treesize of output 43 [2022-11-21 09:17:04,072 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 17 treesize of output 13 [2022-11-21 09:17:04,940 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2132 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2132) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2022-11-21 09:17:04,953 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2130 Int) (v_ArrVal_2132 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (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_2130)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2132) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2022-11-21 09:17:04,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:04,965 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 28 treesize of output 34 [2022-11-21 09:17:04,968 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 39 treesize of output 27 [2022-11-21 09:17:04,973 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 4 [2022-11-21 09:17:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-21 09:17:05,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999491300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:17:05,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:17:05,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 66 [2022-11-21 09:17:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8654668] [2022-11-21 09:17:05,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:17:05,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-21 09:17:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:17:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-21 09:17:05,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3564, Unknown=4, NotChecked=492, Total=4290 [2022-11-21 09:17:05,201 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:17:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:17:08,845 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-11-21 09:17:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 09:17:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-21 09:17:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:17:08,846 INFO L225 Difference]: With dead ends: 75 [2022-11-21 09:17:08,846 INFO L226 Difference]: Without dead ends: 75 [2022-11-21 09:17:08,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=681, Invalid=6303, Unknown=4, NotChecked=668, Total=7656 [2022-11-21 09:17:08,850 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 368 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 29 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 09:17:08,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 883 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1370 Invalid, 12 Unknown, 265 Unchecked, 1.5s Time] [2022-11-21 09:17:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-21 09:17:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2022-11-21 09:17:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 67 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 09:17:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-11-21 09:17:08,854 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 52 [2022-11-21 09:17:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:17:08,854 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-11-21 09:17:08,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:17:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-11-21 09:17:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 09:17:08,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:17:08,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:17:08,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-21 09:17:09,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-21 09:17:09,064 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:17:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:17:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2022-11-21 09:17:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:17:09,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667493904] [2022-11-21 09:17:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:17:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-21 09:17:09,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:17:09,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667493904] [2022-11-21 09:17:09,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667493904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:17:09,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:17:09,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:17:09,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82217683] [2022-11-21 09:17:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:17:09,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:17:09,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:17:09,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:17:09,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:17:09,262 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:17:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:17:09,480 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-11-21 09:17:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 09:17:09,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-21 09:17:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:17:09,481 INFO L225 Difference]: With dead ends: 79 [2022-11-21 09:17:09,481 INFO L226 Difference]: Without dead ends: 79 [2022-11-21 09:17:09,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 09:17:09,482 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:17:09,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:17:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-21 09:17:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-11-21 09:17:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.125) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 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 09:17:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-11-21 09:17:09,485 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 56 [2022-11-21 09:17:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:17:09,486 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-11-21 09:17:09,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:17:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-11-21 09:17:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 09:17:09,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:17:09,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:17:09,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-21 09:17:09,487 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:17:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:17:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2022-11-21 09:17:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:17:09,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188257403] [2022-11-21 09:17:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:17:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 09:17:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:17:09,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188257403] [2022-11-21 09:17:09,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188257403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:17:09,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:17:09,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:17:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775505399] [2022-11-21 09:17:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:17:09,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:17:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:17:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:17:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:17:09,827 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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 09:17:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:17:10,090 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-11-21 09:17:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:17:10,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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 56 [2022-11-21 09:17:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:17:10,092 INFO L225 Difference]: With dead ends: 77 [2022-11-21 09:17:10,092 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 09:17:10,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 09:17:10,093 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 181 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:17:10,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 50 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:17:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 09:17:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-11-21 09:17:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.106060606060606) internal successors, (73), 70 states have internal predecessors, (73), 0 states have call successors, (0), 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 09:17:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-11-21 09:17:10,096 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 56 [2022-11-21 09:17:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:17:10,096 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-11-21 09:17:10,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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 09:17:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-11-21 09:17:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 09:17:10,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:17:10,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:17:10,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-21 09:17:10,106 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:17:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:17:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305133, now seen corresponding path program 1 times [2022-11-21 09:17:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:17:10,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183558668] [2022-11-21 09:17:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:10,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:17:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 09:17:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:17:10,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183558668] [2022-11-21 09:17:10,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183558668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:17:10,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:17:10,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 09:17:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137620097] [2022-11-21 09:17:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:17:10,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:17:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:17:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:17:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:17:10,261 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:17:10,422 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-11-21 09:17:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:17:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 57 [2022-11-21 09:17:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:17:10,423 INFO L225 Difference]: With dead ends: 74 [2022-11-21 09:17:10,423 INFO L226 Difference]: Without dead ends: 74 [2022-11-21 09:17:10,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 09:17:10,424 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 168 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:17:10,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 76 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:17:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-21 09:17:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-11-21 09:17:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 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 09:17:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-11-21 09:17:10,427 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 57 [2022-11-21 09:17:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:17:10,427 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-11-21 09:17:10,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-11-21 09:17:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 09:17:10,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:17:10,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:17:10,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-21 09:17:10,428 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:17:10,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:17:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2022-11-21 09:17:10,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:17:10,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739670742] [2022-11-21 09:17:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:10,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:17:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 09:17:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:17:10,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739670742] [2022-11-21 09:17:10,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739670742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:17:10,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:17:10,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 09:17:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173914159] [2022-11-21 09:17:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:17:10,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 09:17:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:17:10,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 09:17:10,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:17:10,638 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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 09:17:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:17:10,838 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-11-21 09:17:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 09:17:10,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-21 09:17:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:17:10,840 INFO L225 Difference]: With dead ends: 72 [2022-11-21 09:17:10,840 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 09:17:10,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 09:17:10,841 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 155 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:17:10,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 63 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:17:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 09:17:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-21 09:17:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 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 09:17:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-11-21 09:17:10,844 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 59 [2022-11-21 09:17:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:17:10,844 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-11-21 09:17:10,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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 09:17:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-11-21 09:17:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-21 09:17:10,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:17:10,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:17:10,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-21 09:17:10,846 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:17:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:17:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2022-11-21 09:17:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:17:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926019834] [2022-11-21 09:17:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:17:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 09:17:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:17:12,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926019834] [2022-11-21 09:17:12,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926019834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:17:12,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178572314] [2022-11-21 09:17:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:12,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:17:12,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:17:12,772 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:17:12,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-21 09:17:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:13,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-21 09:17:13,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:17:13,095 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 09:17:13,162 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:17:13,162 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 09:17:13,225 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 09:17:13,293 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 09:17:13,329 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:17:13,330 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 09:17:13,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:13,606 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 20 treesize of output 19 [2022-11-21 09:17:13,853 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:17:13,853 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 21 treesize of output 24 [2022-11-21 09:17:14,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:14,244 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 27 treesize of output 21 [2022-11-21 09:17:14,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:17:14,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 09:17:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 09:17:14,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:17:14,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:14,811 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 25 treesize of output 29 [2022-11-21 09:17:15,079 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2498 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2498) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2498 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2498) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse0 4) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))) is different from false [2022-11-21 09:17:15,099 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2498 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2498) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2498 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2498) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse0 4) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))) is different from false [2022-11-21 09:17:15,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2498 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2498) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2498 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2498) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse1 4) (select .cse1 .cse2))))))) is different from false [2022-11-21 09:17:15,586 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2497))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2498)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2497))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 .cse1) v_ArrVal_2498)) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse3 4) (select .cse3 .cse1)))))))) is different from false [2022-11-21 09:17:16,084 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2497))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2498)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2497))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) (select .cse4 .cse1) v_ArrVal_2498)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select .cse3 .cse1) (select .cse3 4)))))))) is different from false [2022-11-21 09:17:16,531 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2495 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2495))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2497))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_2498))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2495 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2495))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2497))) (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (select .cse5 .cse2) v_ArrVal_2498))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select .cse3 4) (select .cse3 .cse2)))))))) is different from false [2022-11-21 09:17:16,597 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2493 Int) (v_ArrVal_2495 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2493)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2495))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2497))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_2498))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (forall ((v_ArrVal_2493 Int) (v_ArrVal_2495 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int))) (let ((.cse5 (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2493)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2495))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2497))) (store (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) (select .cse7 .cse2) v_ArrVal_2498))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select .cse5 .cse2) (select .cse5 4)))))))) is different from false [2022-11-21 09:17:16,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:16,628 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 161 treesize of output 92 [2022-11-21 09:17:16,637 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 124 treesize of output 114 [2022-11-21 09:17:16,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:16,660 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 09:17:16,661 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 67 treesize of output 48 [2022-11-21 09:17:16,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:16,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 81 [2022-11-21 09:17:16,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:16,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:16,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2022-11-21 09:17:16,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:16,742 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 82 treesize of output 58 [2022-11-21 09:17:16,750 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 105 treesize of output 97 [2022-11-21 09:17:16,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:16,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:16,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:16,761 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 79 treesize of output 59 [2022-11-21 09:17:16,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:16,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:16,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:16,770 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 59 treesize of output 35 [2022-11-21 09:17:16,778 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 6 treesize of output 4 [2022-11-21 09:17:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-11-21 09:17:16,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178572314] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:17:16,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:17:16,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 25] total 55 [2022-11-21 09:17:16,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890939784] [2022-11-21 09:17:16,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:17:16,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-21 09:17:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:17:16,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-21 09:17:16,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2137, Unknown=54, NotChecked=700, Total=3080 [2022-11-21 09:17:16,944 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 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 09:17:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:17:21,101 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-11-21 09:17:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 09:17:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 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 62 [2022-11-21 09:17:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:17:21,112 INFO L225 Difference]: With dead ends: 86 [2022-11-21 09:17:21,112 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 09:17:21,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 88 SyntacticMatches, 9 SemanticMatches, 75 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=594, Invalid=4210, Unknown=54, NotChecked=994, Total=5852 [2022-11-21 09:17:21,115 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 498 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 548 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 09:17:21,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 715 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1307 Invalid, 0 Unknown, 548 Unchecked, 1.5s Time] [2022-11-21 09:17:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 09:17:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-11-21 09:17:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 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 09:17:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-21 09:17:21,120 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2022-11-21 09:17:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:17:21,121 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-21 09:17:21,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 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 09:17:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-21 09:17:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-21 09:17:21,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:17:21,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:17:21,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-21 09:17:21,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-21 09:17:21,341 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:17:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:17:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2022-11-21 09:17:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:17:21,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516745798] [2022-11-21 09:17:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:17:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 09:17:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:17:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516745798] [2022-11-21 09:17:24,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516745798] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:17:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971015864] [2022-11-21 09:17:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:24,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:17:24,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:17:24,307 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:17:24,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-21 09:17:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:24,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-21 09:17:24,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:17:24,640 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 09:17:24,738 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:17:24,738 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 09:17:24,800 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 09:17:24,809 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 09:17:24,882 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 09:17:24,892 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 09:17:24,934 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:17:24,935 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 54 treesize of output 53 [2022-11-21 09:17:24,944 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 32 treesize of output 34 [2022-11-21 09:17:25,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:25,351 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 35 treesize of output 30 [2022-11-21 09:17:25,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:25,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-21 09:17:25,687 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:17:25,687 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 48 treesize of output 47 [2022-11-21 09:17:25,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:25,696 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 28 treesize of output 30 [2022-11-21 09:17:26,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:26,277 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 32 treesize of output 26 [2022-11-21 09:17:26,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:26,298 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 29 treesize of output 23 [2022-11-21 09:17:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 09:17:26,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:17:28,030 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2633 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2633) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (< (select .cse0 .cse1) 0) (<= 0 (+ (select .cse0 4) 4))))) (forall ((v_ArrVal_2633 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2633) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (forall ((v_ArrVal_2634 (Array Int Int))) (<= (+ 8 (select .cse2 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (< (select .cse2 .cse1) 0)))))) is different from false [2022-11-21 09:17:28,059 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2633 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2633) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (< (select .cse0 .cse1) 0) (forall ((v_ArrVal_2634 (Array Int Int))) (<= (+ (select .cse0 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2634) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) (forall ((v_ArrVal_2633 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2633) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (< (select .cse3 .cse1) 0) (<= 0 (+ (select .cse3 4) 4))))))) is different from false [2022-11-21 09:17:28,102 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2633 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2633) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (< (select .cse0 .cse1) 0) (forall ((v_ArrVal_2634 (Array Int Int))) (<= (+ 8 (select .cse0 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2634) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) (forall ((v_ArrVal_2633 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2633) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (< (select .cse3 .cse1) 0) (<= 0 (+ 4 (select .cse3 4))))))))) is different from false [2022-11-21 09:17:28,200 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2629 Int) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2629)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2630)) .cse2 v_ArrVal_2633) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (forall ((v_ArrVal_2634 (Array Int Int))) (<= (+ (select .cse0 4) 8) (select |c_#length| (select (select (store .cse1 .cse2 v_ArrVal_2634) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (< (select .cse0 .cse3) 0)))))) (forall ((v_ArrVal_2629 Int) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int)) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2630)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2629)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_2633) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (< (select .cse6 .cse3) 0) (<= 0 (+ (select .cse6 4) 4))))))) is different from false [2022-11-21 09:17:29,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2629 Int) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int)) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2630)) (select (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2629) .cse1) v_ArrVal_2633) |c_ULTIMATE.start_dll_create_#res#1.base|))) (or (<= 0 (+ (select .cse0 4) 4)) (< (select .cse0 .cse1) 0)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2629 Int) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int)) (let ((.cse5 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2629))) (let ((.cse6 (select .cse5 .cse1))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2630)) .cse6 v_ArrVal_2633) |c_ULTIMATE.start_dll_create_#res#1.base|))) (or (forall ((v_ArrVal_2634 (Array Int Int))) (<= (+ (select .cse4 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse5) .cse6 v_ArrVal_2634) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (< (select .cse4 .cse1) 0)))))))))) is different from false [2022-11-21 09:17:29,063 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2629 Int) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int)) (let ((.cse2 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2629))) (let ((.cse3 (select .cse2 .cse1))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2630)) .cse3 v_ArrVal_2633) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (< (select .cse0 .cse1) 0) (forall ((v_ArrVal_2634 (Array Int Int))) (<= (+ 8 (select .cse0 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) .cse3 v_ArrVal_2634) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2629 Int) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int)) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2630)) (select (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2629) .cse1) v_ArrVal_2633) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (< (select .cse6 .cse1) 0) (<= 0 (+ (select .cse6 4) 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-21 09:17:29,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:29,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 209 [2022-11-21 09:17:30,004 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2629 Int) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2628 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2628))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2630))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2627) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2629) .cse1) v_ArrVal_2633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (< (select .cse0 .cse1) 0) (< (select .cse0 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))))) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2629 Int) (v_ArrVal_2634 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2627))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2629))) (let ((.cse4 (select .cse6 .cse1))) (or (forall ((v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int) (v_ArrVal_2628 (Array Int Int))) (< (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2628))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2630))) .cse4 v_ArrVal_2633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0)) (= (select (select (store (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) .cse4 v_ArrVal_2634) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|)))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_7 v_prenex_6))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_7 v_prenex_4) .cse1) v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse7 .cse1) 0) (<= 0 (+ (select .cse7 4) 4)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7)))))) is different from false [2022-11-21 09:17:30,156 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_ArrVal_2623 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_2624 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2623)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_7 v_prenex_6))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_2624)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_7 v_prenex_4) .cse1) v_prenex_5) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (<= 0 (+ (select .cse0 4) 4)) (< (select .cse0 .cse1) 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_7)))) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2629 Int) (v_ArrVal_2634 (Array Int Int)) (v_ArrVal_2623 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2624 Int)) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_2624)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2627))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2629))) (let ((.cse7 (select .cse9 .cse1))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int) (v_ArrVal_2628 (Array Int Int))) (< (select (select (store (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2623)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2628))) (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2630))) .cse7 v_ArrVal_2633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0)) (= (select (select (store (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9) .cse7 v_ArrVal_2634) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2629 Int) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2630 Int) (v_ArrVal_2623 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2624 Int) (v_ArrVal_2628 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2623)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2628))) (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2630))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_2624)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2627) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2629) .cse1) v_ArrVal_2633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (< (select .cse10 .cse1) 0) (< (select .cse10 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))))))) is different from false [2022-11-21 09:17:30,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:30,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 509 treesize of output 447 [2022-11-21 09:17:30,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:30,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 359 treesize of output 327 [2022-11-21 09:17:30,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 346 treesize of output 331 [2022-11-21 09:17:30,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 592 treesize of output 573 [2022-11-21 09:17:30,464 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 670 treesize of output 634 [2022-11-21 09:17:30,500 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 741 treesize of output 722 [2022-11-21 09:17:30,574 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 996 treesize of output 990 [2022-11-21 09:17:30,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:30,618 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 1080 treesize of output 1058 [2022-11-21 09:17:30,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:30,676 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 1139 treesize of output 1122 [2022-11-21 09:17:30,705 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 1141 treesize of output 1133 [2022-11-21 09:17:30,733 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 1133 treesize of output 1117 [2022-11-21 09:17:30,761 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 1178 treesize of output 1158 [2022-11-21 09:17:30,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:30,827 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 1218 treesize of output 1198 [2022-11-21 09:17:30,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:30,896 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 1240 treesize of output 1218 [2022-11-21 09:17:30,926 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 1197 treesize of output 1193 [2022-11-21 09:17:30,958 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 1340 treesize of output 1322 [2022-11-21 09:17:31,024 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 1438 treesize of output 1402 [2022-11-21 09:17:31,074 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 1513 treesize of output 1481 [2022-11-21 09:17:31,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:31,125 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 1481 treesize of output 1478 [2022-11-21 09:17:31,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1581 treesize of output 1549 [2022-11-21 09:17:31,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:31,210 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 1549 treesize of output 1534 [2022-11-21 09:17:31,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:31,268 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 1577 treesize of output 1574 [2022-11-21 09:17:31,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:31,321 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 1591 treesize of output 1594 [2022-11-21 09:17:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-11-21 09:17:33,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971015864] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:17:33,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:17:33,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 67 [2022-11-21 09:17:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116502195] [2022-11-21 09:17:33,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:17:33,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-21 09:17:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:17:33,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-21 09:17:33,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3262, Unknown=47, NotChecked=984, Total=4556 [2022-11-21 09:17:33,503 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 68 states, 67 states have (on average 2.5970149253731343) internal successors, (174), 68 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:17:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:17:43,071 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-11-21 09:17:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 09:17:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 2.5970149253731343) internal successors, (174), 68 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-21 09:17:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:17:43,072 INFO L225 Difference]: With dead ends: 90 [2022-11-21 09:17:43,072 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 09:17:43,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=875, Invalid=6250, Unknown=47, NotChecked=1384, Total=8556 [2022-11-21 09:17:43,075 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 722 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 09:17:43,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 711 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1365 Invalid, 0 Unknown, 562 Unchecked, 1.7s Time] [2022-11-21 09:17:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 09:17:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2022-11-21 09:17:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 76 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:17:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2022-11-21 09:17:43,078 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 62 [2022-11-21 09:17:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:17:43,079 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2022-11-21 09:17:43,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 2.5970149253731343) internal successors, (174), 68 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:17:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-11-21 09:17:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-21 09:17:43,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:17:43,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:17:43,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-21 09:17:43,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:17:43,286 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:17:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:17:43,286 INFO L85 PathProgramCache]: Analyzing trace with hash -636099954, now seen corresponding path program 1 times [2022-11-21 09:17:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:17:43,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906139907] [2022-11-21 09:17:43,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:43,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:17:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-21 09:17:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:17:44,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906139907] [2022-11-21 09:17:44,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906139907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:17:44,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311491175] [2022-11-21 09:17:44,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:44,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:17:44,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:17:44,267 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:17:44,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-21 09:17:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:17:44,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-21 09:17:44,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:17:44,636 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 09:17:44,797 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-21 09:17:44,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2022-11-21 09:17:44,906 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 09:17:44,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 09:17:45,053 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:17:45,053 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-21 09:17:45,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:17:45,459 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 29 treesize of output 24 [2022-11-21 09:17:45,602 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 09:17:45,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-11-21 09:17:46,159 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-21 09:17:46,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 09:17:46,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:46,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2022-11-21 09:17:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 09:17:46,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:17:52,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:52,548 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 213 treesize of output 113 [2022-11-21 09:17:52,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:52,577 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 719 treesize of output 693 [2022-11-21 09:17:52,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:52,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:52,623 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 865 treesize of output 825 [2022-11-21 09:17:53,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:17:53,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:17:53,643 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 258 treesize of output 248 [2022-11-21 09:17:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 16 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 09:17:54,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311491175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:17:54,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:17:54,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 21] total 48 [2022-11-21 09:17:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480662307] [2022-11-21 09:17:54,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:17:54,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-21 09:17:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:17:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 09:17:54,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2089, Unknown=21, NotChecked=0, Total=2352 [2022-11-21 09:17:54,926 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 49 states, 49 states have (on average 3.36734693877551) internal successors, (165), 48 states have internal predecessors, (165), 0 states have call successors, (0), 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 09:17:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:17:58,806 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-11-21 09:17:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 09:17:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.36734693877551) internal successors, (165), 48 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-21 09:17:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:17:58,808 INFO L225 Difference]: With dead ends: 84 [2022-11-21 09:17:58,808 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 09:17:58,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=838, Invalid=4111, Unknown=21, NotChecked=0, Total=4970 [2022-11-21 09:17:58,809 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 636 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 09:17:58,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 454 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 09:17:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 09:17:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2022-11-21 09:17:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 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 09:17:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-11-21 09:17:58,813 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 63 [2022-11-21 09:17:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:17:58,814 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-11-21 09:17:58,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.36734693877551) internal successors, (165), 48 states have internal predecessors, (165), 0 states have call successors, (0), 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 09:17:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-11-21 09:17:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 09:17:58,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:17:58,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:17:58,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-21 09:17:59,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-21 09:17:59,024 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:17:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:17:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1405249969, now seen corresponding path program 1 times [2022-11-21 09:17:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:17:59,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090127926] [2022-11-21 09:17:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:17:59,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:17:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:18:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 09:18:00,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:18:00,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090127926] [2022-11-21 09:18:00,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090127926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:18:00,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213241836] [2022-11-21 09:18:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:18:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:18:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:18:00,695 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:18:00,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-21 09:18:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:18:01,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-21 09:18:01,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:18:01,062 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 09:18:01,183 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:18:01,183 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 09:18:01,221 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 09:18:01,308 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 09:18:01,350 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:18:01,350 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 09:18:01,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:18:01,538 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 29 treesize of output 24 [2022-11-21 09:18:01,847 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 09:18:01,847 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 28 treesize of output 29 [2022-11-21 09:18:02,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:02,157 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 27 treesize of output 21 [2022-11-21 09:18:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 09:18:02,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:18:02,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2891) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-21 09:18:02,676 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2891) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-21 09:18:02,864 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2891) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-21 09:18:02,885 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2889 Int)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2889)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2891)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-21 09:18:02,913 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2889 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2889))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2891)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2022-11-21 09:18:02,936 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2889 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2889))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2891)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-21 09:18:02,955 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2889 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2889))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2891)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2022-11-21 09:18:02,988 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2889 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2889))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2891)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2022-11-21 09:18:03,008 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2889 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2887))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2889))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2891))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2022-11-21 09:18:03,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2885 Int) (v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2889 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (< (select (select (let ((.cse0 (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_2885)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2887))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| v_ArrVal_2889))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2891))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2022-11-21 09:18:03,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:03,062 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 81 treesize of output 57 [2022-11-21 09:18:03,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2022-11-21 09:18:03,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:18:03,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:03,095 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 45 treesize of output 44 [2022-11-21 09:18:03,103 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 78 treesize of output 74 [2022-11-21 09:18:03,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:18:03,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:03,128 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 53 treesize of output 47 [2022-11-21 09:18:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2022-11-21 09:18:03,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213241836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:18:03,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:18:03,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 46 [2022-11-21 09:18:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525550481] [2022-11-21 09:18:03,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:18:03,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-21 09:18:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:18:03,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-21 09:18:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1211, Unknown=22, NotChecked=790, Total=2162 [2022-11-21 09:18:03,561 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 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 09:18:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:18:07,726 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-11-21 09:18:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 09:18:07,727 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-21 09:18:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:18:07,727 INFO L225 Difference]: With dead ends: 85 [2022-11-21 09:18:07,728 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 09:18:07,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 102 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=374, Invalid=2724, Unknown=22, NotChecked=1170, Total=4290 [2022-11-21 09:18:07,729 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 243 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 09:18:07,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 630 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 921 Invalid, 2 Unknown, 701 Unchecked, 1.5s Time] [2022-11-21 09:18:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 09:18:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-11-21 09:18:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.082191780821918) internal successors, (79), 77 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:18:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-11-21 09:18:07,732 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 65 [2022-11-21 09:18:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:18:07,733 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-11-21 09:18:07,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 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 09:18:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-11-21 09:18:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 09:18:07,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:18:07,734 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:18:07,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-21 09:18:07,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:18:07,941 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-21 09:18:07,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:18:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash -755420895, now seen corresponding path program 2 times [2022-11-21 09:18:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:18:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735932696] [2022-11-21 09:18:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:18:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:18:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:18:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:18:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:18:11,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735932696] [2022-11-21 09:18:11,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735932696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:18:11,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688931025] [2022-11-21 09:18:11,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:18:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:18:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:18:11,482 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:18:11,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c2f54e5-a31b-4d39-883a-80dc85ff55cc/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-21 09:18:11,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 09:18:11,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:18:11,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-21 09:18:11,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:18:11,788 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 09:18:11,823 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 09:18:11,833 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 09:18:11,849 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 09:18:11,857 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 09:18:11,974 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:18:11,974 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 09:18:12,113 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 09:18:12,134 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 09:18:12,151 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 09:18:12,163 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 09:18:12,274 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 26 treesize of output 28 [2022-11-21 09:18:12,285 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 09:18:12,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:18:12,411 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 09:18:12,412 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 73 treesize of output 54 [2022-11-21 09:18:12,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:18:12,421 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 33 treesize of output 28 [2022-11-21 09:18:13,062 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-21 09:18:13,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 43 [2022-11-21 09:18:13,070 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 09:18:14,329 INFO L321 Elim1Store]: treesize reduction 116, result has 51.1 percent of original size [2022-11-21 09:18:14,329 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 191 [2022-11-21 09:18:14,472 INFO L321 Elim1Store]: treesize reduction 76, result has 43.3 percent of original size [2022-11-21 09:18:14,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 158 [2022-11-21 09:18:21,338 INFO L321 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2022-11-21 09:18:21,338 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 100 [2022-11-21 09:18:21,400 INFO L321 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-11-21 09:18:21,401 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 90 treesize of output 87 [2022-11-21 09:18:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 09:18:21,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:18:26,826 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (select .cse4 4))) (and (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3036 Int) (v_ArrVal_3035 Int)) (let ((.cse3 (select v_ArrVal_3034 4))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3034))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_3036))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (forall ((v_ArrVal_3037 Int)) (= (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse4 0 v_ArrVal_3035)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3037))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 4) 0)))))) (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 Int)) (let ((.cse8 (select v_ArrVal_3034 4))) (or (forall ((v_ArrVal_3037 Int)) (= (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse4 0 v_ArrVal_3035)))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse8 v_ArrVal_3037))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_3036 Int)) (not (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3034))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse8 v_ArrVal_3036))) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))))))))) is different from false [2022-11-21 09:18:26,860 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse1 (select .cse5 4))) (and (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 Int)) (let ((.cse2 (select v_ArrVal_3034 4))) (or (forall ((v_ArrVal_3036 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_3034))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3036))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0))) (forall ((v_ArrVal_3037 Int)) (= (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse5 0 v_ArrVal_3035)))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_3037))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) 4) 0))))) (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3036 Int) (v_ArrVal_3035 Int)) (let ((.cse8 (select v_ArrVal_3034 4))) (let ((.cse6 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_3034))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse8 v_ArrVal_3036))))) (or (not (= (select (select .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (forall ((v_ArrVal_3037 Int)) (= (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse5 0 v_ArrVal_3035)))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse8 v_ArrVal_3037))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 4) 0))))))))) is different from false [2022-11-21 09:18:26,896 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (select .cse5 4))) (and (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 Int)) (let ((.cse2 (select v_ArrVal_3034 4))) (or (forall ((v_ArrVal_3036 Int)) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3034))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3036))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) (forall ((v_ArrVal_3037 Int)) (= (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 0 v_ArrVal_3035)))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_3037))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) 4) 0))))) (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3036 Int) (v_ArrVal_3035 Int)) (let ((.cse8 (select v_ArrVal_3034 4))) (let ((.cse6 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3034))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse8 v_ArrVal_3036))))) (or (forall ((v_ArrVal_3037 Int)) (= (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 0 v_ArrVal_3035)))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse8 v_ArrVal_3037))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4) 0)) (not (= 0 (select (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))))))))) is different from false [2022-11-21 09:18:26,955 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse2 (select .cse4 4))) (and (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3036 Int) (v_ArrVal_3035 Int)) (let ((.cse3 (select v_ArrVal_3034 4))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3034))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_3036))))) (or (forall ((v_ArrVal_3037 Int)) (= (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 0 v_ArrVal_3035)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3037))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0)) (not (= (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)))))) (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 Int)) (let ((.cse7 (select v_ArrVal_3034 4))) (or (forall ((v_ArrVal_3036 Int)) (not (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3034))) (store .cse6 .cse2 (store (select .cse6 .cse2) .cse7 v_ArrVal_3036))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (forall ((v_ArrVal_3037 Int)) (= (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 0 v_ArrVal_3035)))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse7 v_ArrVal_3037))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0)))))))) is different from false [2022-11-21 09:18:27,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3036 Int) (v_ArrVal_3035 Int) (v_ArrVal_3032 Int) (v_ArrVal_3030 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse8 v_ArrVal_3032)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse2 (select .cse5 4)) (.cse3 (select v_ArrVal_3034 4))) (let ((.cse0 (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse8 v_ArrVal_3030)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3034))) (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 v_ArrVal_3036))))) (or (forall ((v_ArrVal_3037 Int)) (= (select (select .cse0 (select (select (let ((.cse1 (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 0 v_ArrVal_3035)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3037))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0)) (not (= (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)))))))) (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 Int) (v_ArrVal_3032 Int) (v_ArrVal_3030 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse8 v_ArrVal_3032)))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse12 (select .cse15 4)) (.cse13 (select v_ArrVal_3034 4))) (or (forall ((v_ArrVal_3037 Int)) (= (select (let ((.cse10 (let ((.cse11 (store .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse15 0 v_ArrVal_3035)))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_3037))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_3036 Int)) (not (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 .cse8 v_ArrVal_3030)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3034))) (store .cse16 .cse12 (store (select .cse16 .cse12) .cse13 v_ArrVal_3036))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)))))))))) is different from false [2022-11-21 09:18:27,138 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse11 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3028 Int) (v_ArrVal_3027 (Array Int Int)) (v_ArrVal_3035 Int) (v_ArrVal_3032 Int) (v_ArrVal_3030 Int)) (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse11 v_ArrVal_3028)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_3032))))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse8 4)) (.cse2 (select v_ArrVal_3034 4))) (or (forall ((v_ArrVal_3036 Int)) (not (= (select (select (let ((.cse0 (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3027))) (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_3030))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3034))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3036))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (forall ((v_ArrVal_3037 Int)) (= (select (let ((.cse5 (let ((.cse6 (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 0 v_ArrVal_3035)))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_3037))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0))))))) (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3028 Int) (v_ArrVal_3027 (Array Int Int)) (v_ArrVal_3036 Int) (v_ArrVal_3035 Int) (v_ArrVal_3032 Int) (v_ArrVal_3030 Int)) (let ((.cse16 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse11 v_ArrVal_3028)))) (store .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_3032))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse14 (select .cse17 4)) (.cse15 (select v_ArrVal_3034 4))) (let ((.cse12 (let ((.cse18 (store (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3027))) (store .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 v_ArrVal_3030))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3034))) (store .cse18 .cse14 (store (select .cse18 .cse14) .cse15 v_ArrVal_3036))))) (or (forall ((v_ArrVal_3037 Int)) (= (select (select .cse12 (select (select (let ((.cse13 (store .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse17 0 v_ArrVal_3035)))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 v_ArrVal_3037))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0)) (not (= (select (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)))))))))) is different from false [2022-11-21 09:18:37,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:37,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 526 treesize of output 342 [2022-11-21 09:18:37,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:37,471 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 648 treesize of output 384 [2022-11-21 09:18:37,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3027 (Array Int Int)) (v_ArrVal_3036 Int) (v_ArrVal_3037 Int) (v_ArrVal_3035 Int) (v_ArrVal_3032 Int) (v_ArrVal_3030 Int)) (let ((.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_22))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_3032))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse6 4)) (.cse4 (select v_ArrVal_3034 4))) (or (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (let ((.cse1 (let ((.cse2 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse6 0 v_ArrVal_3035)))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_3037))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (select (select (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3027))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_3030))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3034))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_ArrVal_3036))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3027 (Array Int Int)) (v_ArrVal_3036 Int) (v_ArrVal_3037 Int) (v_ArrVal_3035 Int) (v_ArrVal_3032 Int) (v_ArrVal_3030 Int)) (let ((.cse15 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_21))) (store .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_3032))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse13 (select .cse16 4)) (.cse14 (select v_ArrVal_3034 4))) (let ((.cse11 (let ((.cse17 (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3027))) (store .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_3030))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3034))) (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 v_ArrVal_3036))))) (or (not (= (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= (select (select .cse11 (select (select (let ((.cse12 (store .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse16 0 v_ArrVal_3035)))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_3037))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))))) is different from false [2022-11-21 09:18:48,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:48,580 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 216 treesize of output 177 [2022-11-21 09:18:48,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:48,606 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 788 treesize of output 388 [2022-11-21 09:18:48,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:48,650 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 2833 treesize of output 2785 [2022-11-21 09:18:48,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:18:49,516 INFO L321 Elim1Store]: treesize reduction 720, result has 24.3 percent of original size [2022-11-21 09:18:49,519 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 16 new quantified variables, introduced 65 case distinctions, treesize of input 2004482 treesize of output 1777774 [2022-11-21 09:19:48,953 WARN L233 SmtUtils]: Spent 59.43s on a formula simplification. DAG size of input: 1777 DAG size of output: 1755 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:19:51,610 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 2423310 treesize of output 2322620 [2022-11-21 09:21:14,798 WARN L233 SmtUtils]: Spent 1.39m on a formula simplification. DAG size of input: 1859 DAG size of output: 1855 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:23:11,857 WARN L233 SmtUtils]: Spent 1.95m on a formula simplification. DAG size of input: 1808 DAG size of output: 1777 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:23:12,126 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 2212322 treesize of output 2029546 [2022-11-21 09:23:23,831 WARN L233 SmtUtils]: Spent 11.70s on a formula simplification. DAG size of input: 1777 DAG size of output: 1776 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:23:24,490 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 2719 treesize of output 2709 [2022-11-21 09:23:30,362 WARN L233 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 1778 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:23:56,380 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 708 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:24:06,905 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 697 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:25:33,969 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-21 09:28:31,241 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 986 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:28:41,578 WARN L233 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 956 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:28:51,865 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 950 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:29:33,783 WARN L233 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 976 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:29:44,021 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 968 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 09:30:04,724 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 956 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)