./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc --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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- 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-5e519f3 [2022-11-02 19:49:34,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:49:34,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:49:34,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:49:34,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:49:34,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:49:34,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:49:34,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:49:34,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:49:34,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:49:34,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:49:34,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:49:34,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:49:34,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:49:34,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:49:34,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:49:34,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:49:34,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:49:34,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:49:34,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:49:34,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:49:34,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:49:34,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:49:34,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:49:34,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:49:34,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:49:34,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:49:34,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:49:34,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:49:34,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:49:34,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:49:34,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:49:34,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:49:34,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:49:34,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:49:34,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:49:34,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:49:34,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:49:34,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:49:34,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:49:34,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:49:34,450 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 19:49:34,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:49:34,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:49:34,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:49:34,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:49:34,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:49:34,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:49:34,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:49:34,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:49:34,476 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:49:34,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:49:34,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:49:34,477 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 19:49:34,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:49:34,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:49:34,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:49:34,478 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 19:49:34,478 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 19:49:34,478 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 19:49:34,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:49:34,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 19:49:34,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:49:34,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:49:34,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:49:34,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:49:34,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:49:34,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:49:34,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:49:34,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:49:34,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:49:34,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:49:34,481 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_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/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_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2022-11-02 19:49:34,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:49:34,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:49:34,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:49:34,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:49:34,786 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:49:34,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-11-02 19:49:34,868 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/data/c0066853c/4acfa18908f348dbbd2e0d9a45a0f520/FLAGb71a13284 [2022-11-02 19:49:35,585 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:49:35,586 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-11-02 19:49:35,609 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/data/c0066853c/4acfa18908f348dbbd2e0d9a45a0f520/FLAGb71a13284 [2022-11-02 19:49:35,823 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/data/c0066853c/4acfa18908f348dbbd2e0d9a45a0f520 [2022-11-02 19:49:35,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:49:35,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:49:35,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:49:35,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:49:35,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:49:35,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:49:35" (1/1) ... [2022-11-02 19:49:35,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7436450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:35, skipping insertion in model container [2022-11-02 19:49:35,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:49:35" (1/1) ... [2022-11-02 19:49:35,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:49:35,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:49:36,436 WARN L230 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_82afce8e-8450-412b-adff-bf3c877a1ca4/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2022-11-02 19:49:36,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:49:36,453 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:49:36,517 WARN L230 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_82afce8e-8450-412b-adff-bf3c877a1ca4/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2022-11-02 19:49:36,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:49:36,552 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:49:36,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36 WrapperNode [2022-11-02 19:49:36,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:49:36,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:49:36,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:49:36,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:49:36,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,642 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-11-02 19:49:36,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:49:36,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:49:36,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:49:36,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:49:36,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,693 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:49:36,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:49:36,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:49:36,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:49:36,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (1/1) ... [2022-11-02 19:49:36,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:49:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:36,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:49:36,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:49:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 19:49:36,808 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 19:49:36,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 19:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 19:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 19:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 19:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 19:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 19:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:49:36,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:49:36,946 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:49:36,948 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:49:36,994 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 19:49:37,370 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:49:37,377 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:49:37,377 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 19:49:37,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:49:37 BoogieIcfgContainer [2022-11-02 19:49:37,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:49:37,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:49:37,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:49:37,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:49:37,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:49:35" (1/3) ... [2022-11-02 19:49:37,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45862827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:49:37, skipping insertion in model container [2022-11-02 19:49:37,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:49:36" (2/3) ... [2022-11-02 19:49:37,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45862827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:49:37, skipping insertion in model container [2022-11-02 19:49:37,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:49:37" (3/3) ... [2022-11-02 19:49:37,395 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2022-11-02 19:49:37,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:49:37,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-11-02 19:49:37,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:49:37,519 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;@454b9078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:49:37,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-11-02 19:49:37,524 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-02 19:49:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 19:49:37,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:37,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 19:49:37,534 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-02 19:49:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-02 19:49:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:37,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567546026] [2022-11-02 19:49:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:37,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:37,906 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-02 19:49:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:37,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567546026] [2022-11-02 19:49:37,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567546026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:37,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:37,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:49:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321152221] [2022-11-02 19:49:37,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:37,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:49:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:49:37,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:49:37,963 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-02 19:49:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:38,116 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-11-02 19:49:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:49:38,119 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-02 19:49:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:38,129 INFO L225 Difference]: With dead ends: 111 [2022-11-02 19:49:38,129 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 19:49:38,131 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-02 19:49:38,135 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-02 19:49:38,136 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-02 19:49:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 19:49:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-02 19:49:38,170 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-02 19:49:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-02 19:49:38,173 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-11-02 19:49:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:38,174 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-02 19:49:38,175 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-02 19:49:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-02 19:49:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 19:49:38,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:38,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 19:49:38,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:49:38,176 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-02 19:49:38,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-02 19:49:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:38,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620447681] [2022-11-02 19:49:38,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:38,281 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-02 19:49:38,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:38,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620447681] [2022-11-02 19:49:38,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620447681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:38,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:38,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:49:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20891470] [2022-11-02 19:49:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:38,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:49:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:49:38,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:49:38,286 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-02 19:49:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:38,357 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-11-02 19:49:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:49:38,358 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-02 19:49:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:38,359 INFO L225 Difference]: With dead ends: 101 [2022-11-02 19:49:38,360 INFO L226 Difference]: Without dead ends: 101 [2022-11-02 19:49:38,360 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-02 19:49:38,362 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02 19:49:38,362 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-02 19:49:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-02 19:49:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-11-02 19:49:38,369 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-02 19:49:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-02 19:49:38,371 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-11-02 19:49:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:38,371 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-02 19:49:38,372 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-02 19:49:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-02 19:49:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 19:49:38,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:38,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:38,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 19:49:38,374 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-02 19:49:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-11-02 19:49:38,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:38,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254808460] [2022-11-02 19:49:38,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:38,497 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-02 19:49:38,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:38,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254808460] [2022-11-02 19:49:38,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254808460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:38,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:38,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:49:38,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405286058] [2022-11-02 19:49:38,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:38,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:49:38,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:38,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:49:38,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:49:38,504 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-02 19:49:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:38,527 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-11-02 19:49:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:49:38,528 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-02 19:49:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:38,529 INFO L225 Difference]: With dead ends: 66 [2022-11-02 19:49:38,531 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 19:49:38,532 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-02 19:49:38,535 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-02 19:49:38,537 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-02 19:49:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 19:49:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-11-02 19:49:38,546 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-02 19:49:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-11-02 19:49:38,549 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-11-02 19:49:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:38,550 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-11-02 19:49:38,550 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-02 19:49:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-11-02 19:49:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 19:49:38,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:38,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:38,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 19:49:38,554 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-02 19:49:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-02 19:49:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:38,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86899622] [2022-11-02 19:49:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:38,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:38,679 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-02 19:49:38,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:38,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86899622] [2022-11-02 19:49:38,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86899622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:38,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:38,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:49:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204924161] [2022-11-02 19:49:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:38,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:49:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:49:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:49:38,683 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-02 19:49:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:38,726 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-02 19:49:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:49:38,727 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-02 19:49:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:38,729 INFO L225 Difference]: With dead ends: 63 [2022-11-02 19:49:38,729 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 19:49:38,729 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-02 19:49:38,732 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-02 19:49:38,737 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-02 19:49:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 19:49:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-02 19:49:38,747 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-02 19:49:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-02 19:49:38,750 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-11-02 19:49:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:38,751 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-02 19:49:38,751 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-02 19:49:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-02 19:49:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 19:49:38,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:38,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:38,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:49:38,754 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-02 19:49:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-11-02 19:49:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:38,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502967099] [2022-11-02 19:49:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:38,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:38,900 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-02 19:49:38,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:38,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502967099] [2022-11-02 19:49:38,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502967099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:38,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851324196] [2022-11-02 19:49:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:38,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:38,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:38,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:38,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 19:49:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:39,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 19:49:39,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:39,106 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-02 19:49:39,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:49:39,162 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-02 19:49:39,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851324196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:49:39,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:49:39,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 19:49:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133289050] [2022-11-02 19:49:39,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:49:39,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:49:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:39,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:49:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:49:39,173 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-02 19:49:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:39,201 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-02 19:49:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:49:39,202 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-02 19:49:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:39,205 INFO L225 Difference]: With dead ends: 64 [2022-11-02 19:49:39,205 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 19:49:39,205 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-02 19:49:39,213 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-02 19:49:39,215 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-02 19:49:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 19:49:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-02 19:49:39,221 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-02 19:49:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-02 19:49:39,224 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-11-02 19:49:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:39,225 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-02 19:49:39,225 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-02 19:49:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-02 19:49:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 19:49:39,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:39,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:39,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:39,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:39,453 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-02 19:49:39,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-02 19:49:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:39,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998584653] [2022-11-02 19:49:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:39,794 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-02 19:49:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:39,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998584653] [2022-11-02 19:49:39,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998584653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:39,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689085896] [2022-11-02 19:49:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:39,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:39,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:39,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 19:49:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:39,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 19:49:39,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:39,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:40,042 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 19:49:40,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:40,071 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-02 19:49:40,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:49:40,300 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-02 19:49:40,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689085896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:49:40,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:49:40,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-02 19:49:40,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451274021] [2022-11-02 19:49:40,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:49:40,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:49:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:49:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:40,305 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-02 19:49:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:40,393 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-02 19:49:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:49:40,394 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-02 19:49:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:40,395 INFO L225 Difference]: With dead ends: 77 [2022-11-02 19:49:40,395 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 19:49:40,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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-02 19:49:40,396 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:40,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-11-02 19:49:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 19:49:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-11-02 19:49:40,400 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-02 19:49:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-11-02 19:49:40,402 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-11-02 19:49:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:40,402 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-11-02 19:49:40,402 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-02 19:49:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-11-02 19:49:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 19:49:40,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:40,403 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:40,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:40,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:40,617 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-02 19:49:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-02 19:49:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:40,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723269595] [2022-11-02 19:49:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:40,911 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-02 19:49:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:40,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723269595] [2022-11-02 19:49:40,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723269595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:40,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308544953] [2022-11-02 19:49:40,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:40,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:40,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:40,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 19:49:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:41,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 19:49:41,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:41,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:41,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:41,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:49:41,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:41,146 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 19:49:41,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:41,176 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-02 19:49:41,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:49:41,538 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-02 19:49:41,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308544953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:49:41,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:49:41,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-11-02 19:49:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812701782] [2022-11-02 19:49:41,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:49:41,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:49:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:41,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:49:41,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:49:41,541 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-02 19:49:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:41,682 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-02 19:49:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:49:41,683 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-02 19:49:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:41,684 INFO L225 Difference]: With dead ends: 76 [2022-11-02 19:49:41,685 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 19:49:41,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:49:41,686 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:41,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-11-02 19:49:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 19:49:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-11-02 19:49:41,705 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-02 19:49:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-02 19:49:41,708 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-11-02 19:49:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:41,708 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-02 19:49:41,709 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-02 19:49:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-02 19:49:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 19:49:41,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:41,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:41,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:41,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 19:49:41,936 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-02 19:49:41,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:41,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-11-02 19:49:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117354457] [2022-11-02 19:49:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:42,009 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-02 19:49:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117354457] [2022-11-02 19:49:42,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117354457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:42,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516969198] [2022-11-02 19:49:42,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 19:49:42,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:42,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:42,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:42,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 19:49:42,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 19:49:42,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 19:49:42,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 19:49:42,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:42,160 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-02 19:49:42,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:49:42,191 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-02 19:49:42,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516969198] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:49:42,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:49:42,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-02 19:49:42,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585369678] [2022-11-02 19:49:42,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:49:42,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:49:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:49:42,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:49:42,195 INFO L87 Difference]: Start difference. First operand 62 states and 68 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-02 19:49:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:42,235 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-11-02 19:49:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:49:42,236 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-02 19:49:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:42,237 INFO L225 Difference]: With dead ends: 62 [2022-11-02 19:49:42,237 INFO L226 Difference]: Without dead ends: 62 [2022-11-02 19:49:42,237 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-02 19:49:42,238 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-02 19:49:42,239 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-02 19:49:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-02 19:49:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-02 19:49:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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-02 19:49:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-11-02 19:49:42,247 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2022-11-02 19:49:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:42,248 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-11-02 19:49:42,248 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-02 19:49:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-11-02 19:49:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 19:49:42,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:42,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:42,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:42,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 19:49:42,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:42,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2022-11-02 19:49:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:42,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33666233] [2022-11-02 19:49:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:42,614 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-02 19:49:42,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:42,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33666233] [2022-11-02 19:49:42,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33666233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:42,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:42,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:49:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376051950] [2022-11-02 19:49:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:42,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:49:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:49:42,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:42,617 INFO L87 Difference]: Start difference. First operand 62 states and 67 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-02 19:49:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:42,817 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-11-02 19:49:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:49:42,818 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-02 19:49:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:42,819 INFO L225 Difference]: With dead ends: 113 [2022-11-02 19:49:42,819 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 19:49:42,819 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-02 19:49:42,820 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-02 19:49:42,820 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-02 19:49:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 19:49:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2022-11-02 19:49:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 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-02 19:49:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-11-02 19:49:42,824 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2022-11-02 19:49:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:42,824 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-11-02 19:49:42,825 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-02 19:49:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-11-02 19:49:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 19:49:42,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:42,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:42,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 19:49:42,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:42,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:42,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2022-11-02 19:49:42,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:42,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264594650] [2022-11-02 19:49:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:43,100 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-02 19:49:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:43,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264594650] [2022-11-02 19:49:43,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264594650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:43,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:43,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:49:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48149178] [2022-11-02 19:49:43,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:43,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:49:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:49:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:43,103 INFO L87 Difference]: Start difference. First operand 65 states and 73 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-02 19:49:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:43,304 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-11-02 19:49:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:49:43,304 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-02 19:49:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:43,305 INFO L225 Difference]: With dead ends: 100 [2022-11-02 19:49:43,305 INFO L226 Difference]: Without dead ends: 100 [2022-11-02 19:49:43,305 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-02 19:49:43,306 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-02 19:49:43,306 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-02 19:49:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-02 19:49:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2022-11-02 19:49:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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-02 19:49:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-11-02 19:49:43,309 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2022-11-02 19:49:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:43,310 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-11-02 19:49:43,310 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-02 19:49:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-11-02 19:49:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 19:49:43,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:43,311 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-02 19:49:43,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 19:49:43,312 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-11-02 19:49:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:43,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228241211] [2022-11-02 19:49:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:43,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:43,440 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-02 19:49:43,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228241211] [2022-11-02 19:49:43,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228241211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379154408] [2022-11-02 19:49:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:43,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:43,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:43,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:43,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 19:49:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:43,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 19:49:43,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:43,619 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-02 19:49:43,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:49:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379154408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:43,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:49:43,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-02 19:49:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035278942] [2022-11-02 19:49:43,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:43,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:49:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:43,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:49:43,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:49:43,623 INFO L87 Difference]: Start difference. First operand 65 states and 71 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-02 19:49:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:43,646 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-11-02 19:49:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:49:43,647 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-02 19:49:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:43,652 INFO L225 Difference]: With dead ends: 65 [2022-11-02 19:49:43,652 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 19:49:43,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:49:43,653 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:43,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:49:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 19:49:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-11-02 19:49:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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-02 19:49:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-11-02 19:49:43,656 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2022-11-02 19:49:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:43,658 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-11-02 19:49:43,658 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-02 19:49:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-11-02 19:49:43,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 19:49:43,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:43,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:43,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:43,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:43,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2022-11-02 19:49:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:43,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337992747] [2022-11-02 19:49:43,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:43,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:49:44,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:44,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337992747] [2022-11-02 19:49:44,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337992747] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:44,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111818921] [2022-11-02 19:49:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:44,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:44,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:44,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:44,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 19:49:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:44,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 19:49:44,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 19:49:44,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:49:44,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111818921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:44,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:49:44,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-02 19:49:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828885626] [2022-11-02 19:49:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:44,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:49:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:44,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:49:44,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:44,288 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:44,339 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-11-02 19:49:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:49:44,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 19:49:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:44,340 INFO L225 Difference]: With dead ends: 49 [2022-11-02 19:49:44,340 INFO L226 Difference]: Without dead ends: 49 [2022-11-02 19:49:44,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:49:44,341 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:44,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:49:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-02 19:49:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-02 19:49:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-02 19:49:44,344 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 26 [2022-11-02 19:49:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:44,345 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-02 19:49:44,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-02 19:49:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 19:49:44,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:44,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:44,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:44,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 19:49:44,572 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2022-11-02 19:49:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:44,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080858288] [2022-11-02 19:49:44,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:44,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:49:45,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:45,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080858288] [2022-11-02 19:49:45,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080858288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:45,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599217204] [2022-11-02 19:49:45,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:45,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:45,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:45,358 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:45,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 19:49:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:45,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-02 19:49:45,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:45,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:45,551 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 19:49:45,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:45,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:45,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:45,647 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:49:45,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:45,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 [2022-11-02 19:49:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:49:45,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:49:46,016 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-02 19:49:46,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:46,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_684 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_684) |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-02 19:49:46,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_682 Int) (v_ArrVal_684 (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_682)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_684) |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-02 19:49:46,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:49:46,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:46,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:46,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 19:49:46,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599217204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:49:46,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:49:46,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-11-02 19:49:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041306753] [2022-11-02 19:49:46,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:49:46,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 19:49:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:46,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 19:49:46,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2022-11-02 19:49:46,202 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:47,731 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-11-02 19:49:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 19:49:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 19:49:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:47,734 INFO L225 Difference]: With dead ends: 129 [2022-11-02 19:49:47,734 INFO L226 Difference]: Without dead ends: 129 [2022-11-02 19:49:47,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=319, Invalid=1757, Unknown=2, NotChecked=178, Total=2256 [2022-11-02 19:49:47,736 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 532 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:47,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 583 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 656 Invalid, 0 Unknown, 172 Unchecked, 0.5s Time] [2022-11-02 19:49:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-02 19:49:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 69. [2022-11-02 19:49:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 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-02 19:49:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-11-02 19:49:47,740 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 26 [2022-11-02 19:49:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:47,741 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-11-02 19:49:47,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-11-02 19:49:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 19:49:47,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:47,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:47,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:47,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:47,960 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2022-11-02 19:49:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:47,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194610133] [2022-11-02 19:49:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:49:48,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:48,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194610133] [2022-11-02 19:49:48,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194610133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:48,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364984250] [2022-11-02 19:49:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:48,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:48,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:48,801 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:48,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 19:49:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:48,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-02 19:49:48,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:48,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,040 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 19:49:49,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,205 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:49:49,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 [2022-11-02 19:49:49,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 14 [2022-11-02 19:49:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:49:49,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:49:49,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:49:49,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:49,980 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_788 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_787 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (forall ((v_prenex_1 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2022-11-02 19:49:50,010 WARN L833 $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_785 Int) (v_ArrVal_787 (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_785)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (forall ((v_ArrVal_785 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_785)) |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_788 (Array Int Int)) (v_ArrVal_784 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_784)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-11-02 19:49:50,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:49:50,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:50,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:50,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:50,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:49:50,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:50,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 19:49:50,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:50,067 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 19:49:50,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 19:49:50,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364984250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:49:50,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:49:50,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2022-11-02 19:49:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639817773] [2022-11-02 19:49:50,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:49:50,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-02 19:49:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-02 19:49:50,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1031, Unknown=2, NotChecked=130, Total=1260 [2022-11-02 19:49:50,264 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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-02 19:49:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:52,769 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-11-02 19:49:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 19:49:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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) Word has length 26 [2022-11-02 19:49:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:52,771 INFO L225 Difference]: With dead ends: 130 [2022-11-02 19:49:52,771 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 19:49:52,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=311, Invalid=2145, Unknown=2, NotChecked=194, Total=2652 [2022-11-02 19:49:52,773 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 809 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:52,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 810 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 725 Invalid, 0 Unknown, 323 Unchecked, 0.7s Time] [2022-11-02 19:49:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 19:49:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2022-11-02 19:49:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 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-02 19:49:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-11-02 19:49:52,777 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 26 [2022-11-02 19:49:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:52,777 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-11-02 19:49:52,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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-02 19:49:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-11-02 19:49:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 19:49:52,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:52,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:52,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:52,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 19:49:52,994 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash -709592258, now seen corresponding path program 1 times [2022-11-02 19:49:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:52,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824760427] [2022-11-02 19:49:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 19:49:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:53,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824760427] [2022-11-02 19:49:53,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824760427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:53,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:53,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:49:53,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718801387] [2022-11-02 19:49:53,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:53,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:49:53,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:53,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:49:53,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:53,151 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:53,299 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-11-02 19:49:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:49:53,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 19:49:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:53,301 INFO L225 Difference]: With dead ends: 88 [2022-11-02 19:49:53,301 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 19:49:53,301 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-02 19:49:53,302 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:53,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 63 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:49:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 19:49:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-11-02 19:49:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 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-02 19:49:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-11-02 19:49:53,305 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2022-11-02 19:49:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:53,305 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-11-02 19:49:53,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-11-02 19:49:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 19:49:53,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:53,306 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:53,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 19:49:53,306 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash -709592257, now seen corresponding path program 1 times [2022-11-02 19:49:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:53,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181456919] [2022-11-02 19:49:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:53,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:53,451 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-02 19:49:53,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181456919] [2022-11-02 19:49:53,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181456919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667210579] [2022-11-02 19:49:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:53,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:53,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 19:49:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:53,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 19:49:53,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 19:49:53,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:49:53,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667210579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:53,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:49:53,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-02 19:49:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961336312] [2022-11-02 19:49:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:53,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:49:53,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:53,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:49:53,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:53,652 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:53,695 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-11-02 19:49:53,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:49:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 19:49:53,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:53,696 INFO L225 Difference]: With dead ends: 86 [2022-11-02 19:49:53,696 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 19:49:53,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:49:53,697 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:53,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:49:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 19:49:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-11-02 19:49:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 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-02 19:49:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-11-02 19:49:53,701 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 31 [2022-11-02 19:49:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:53,701 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-11-02 19:49:53,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-11-02 19:49:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 19:49:53,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:53,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:49:53,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:53,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:53,916 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2022-11-02 19:49:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:53,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471976929] [2022-11-02 19:49:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:49:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:54,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471976929] [2022-11-02 19:49:54,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471976929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:54,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615401084] [2022-11-02 19:49:54,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 19:49:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:54,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:54,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:54,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 19:49:54,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 19:49:54,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 19:49:54,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 19:49:54,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:49:54,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:49:54,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615401084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:54,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:49:54,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-02 19:49:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740162587] [2022-11-02 19:49:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:54,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:49:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:54,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:49:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:49:54,268 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:54,278 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-11-02 19:49:54,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:49:54,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 19:49:54,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:54,280 INFO L225 Difference]: With dead ends: 53 [2022-11-02 19:49:54,280 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 19:49:54,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-02 19:49:54,282 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:54,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 58 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:49:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 19:49:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-02 19:49:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-11-02 19:49:54,285 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2022-11-02 19:49:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:54,285 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-11-02 19:49:54,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-11-02 19:49:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 19:49:54,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:54,286 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-02 19:49:54,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:54,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 19:49:54,512 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash -674776797, now seen corresponding path program 1 times [2022-11-02 19:49:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:54,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521121711] [2022-11-02 19:49:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 19:49:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:54,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521121711] [2022-11-02 19:49:54,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521121711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:54,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705346053] [2022-11-02 19:49:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:54,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:54,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:54,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 19:49:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:54,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 19:49:54,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:49:54,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:49:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:49:54,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705346053] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:49:54,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:49:54,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-02 19:49:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938751027] [2022-11-02 19:49:54,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:49:54,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:49:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:49:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:49:54,977 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:55,018 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-11-02 19:49:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:49:55,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 19:49:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:55,019 INFO L225 Difference]: With dead ends: 57 [2022-11-02 19:49:55,019 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 19:49:55,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:49:55,020 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:55,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 91 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:49:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 19:49:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-02 19:49:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-11-02 19:49:55,023 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2022-11-02 19:49:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:55,024 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-11-02 19:49:55,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-11-02 19:49:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 19:49:55,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:55,026 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] [2022-11-02 19:49:55,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 19:49:55,243 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2022-11-02 19:49:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:55,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179245889] [2022-11-02 19:49:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 19:49:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:55,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179245889] [2022-11-02 19:49:55,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179245889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:55,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409870174] [2022-11-02 19:49:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:55,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:55,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:55,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:55,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 19:49:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:55,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 19:49:55,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:49:55,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:49:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:49:55,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409870174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:49:55,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:49:55,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-02 19:49:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954143098] [2022-11-02 19:49:55,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:49:55,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:49:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:55,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:49:55,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:55,748 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:55,809 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-11-02 19:49:55,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:49:55,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 19:49:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:55,811 INFO L225 Difference]: With dead ends: 52 [2022-11-02 19:49:55,811 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 19:49:55,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:49:55,812 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:55,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:49:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 19:49:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-02 19:49:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-02 19:49:55,815 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 34 [2022-11-02 19:49:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:55,815 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-02 19:49:55,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-02 19:49:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 19:49:55,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:55,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] [2022-11-02 19:49:55,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 19:49:56,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:56,036 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 2 times [2022-11-02 19:49:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:56,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875202251] [2022-11-02 19:49:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:49:56,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:56,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875202251] [2022-11-02 19:49:56,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875202251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:56,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:56,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:49:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011509816] [2022-11-02 19:49:56,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:56,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:49:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:49:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:56,288 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:56,453 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-11-02 19:49:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:49:56,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-02 19:49:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:56,454 INFO L225 Difference]: With dead ends: 60 [2022-11-02 19:49:56,455 INFO L226 Difference]: Without dead ends: 60 [2022-11-02 19:49:56,455 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-02 19:49:56,455 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:56,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:49:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-02 19:49:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-11-02 19:49:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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-02 19:49:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-11-02 19:49:56,458 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2022-11-02 19:49:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:56,458 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-11-02 19:49:56,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-11-02 19:49:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 19:49:56,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:56,459 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] [2022-11-02 19:49:56,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 19:49:56,459 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2022-11-02 19:49:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:56,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351591365] [2022-11-02 19:49:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:56,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:49:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:56,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351591365] [2022-11-02 19:49:56,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351591365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:56,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:56,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:49:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716512175] [2022-11-02 19:49:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:56,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:49:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:49:56,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:56,590 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-02 19:49:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:56,700 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-11-02 19:49:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:49:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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 40 [2022-11-02 19:49:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:56,701 INFO L225 Difference]: With dead ends: 57 [2022-11-02 19:49:56,701 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 19:49:56,701 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-02 19:49:56,702 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:56,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:49:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 19:49:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-11-02 19:49:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-11-02 19:49:56,704 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2022-11-02 19:49:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:56,704 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-11-02 19:49:56,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-02 19:49:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-11-02 19:49:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 19:49:56,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:56,705 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-02 19:49:56,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 19:49:56,705 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:56,706 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2022-11-02 19:49:56,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:56,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303161304] [2022-11-02 19:49:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:56,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:49:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303161304] [2022-11-02 19:49:56,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303161304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:49:56,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:49:56,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:49:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943114980] [2022-11-02 19:49:56,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:49:56,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:49:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:49:56,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:49:56,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:49:56,852 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:49:56,978 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-11-02 19:49:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:49:56,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-02 19:49:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:49:56,981 INFO L225 Difference]: With dead ends: 55 [2022-11-02 19:49:56,981 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 19:49:56,981 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-02 19:49:56,982 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:49:56,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:49:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 19:49:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-02 19:49:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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-02 19:49:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-11-02 19:49:56,984 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2022-11-02 19:49:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:49:56,984 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-11-02 19:49:56,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:49:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-11-02 19:49:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 19:49:56,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:49:56,985 INFO L195 NwaCegarLoop]: trace histogram [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-02 19:49:56,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 19:49:56,985 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:49:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:49:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2022-11-02 19:49:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:49:56,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235659088] [2022-11-02 19:49:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:49:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 19:49:58,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:49:58,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235659088] [2022-11-02 19:49:58,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235659088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:49:58,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728438225] [2022-11-02 19:49:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:49:58,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:49:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:49:58,309 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:49:58,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 19:49:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:49:58,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 19:49:58,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:49:58,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:58,573 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 19:49:58,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 19:49:58,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:58,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:49:58,753 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:49:58,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-11-02 19:49:59,132 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:49:59,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 38 [2022-11-02 19:49:59,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:49:59,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:49:59,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-02 19:49:59,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:49:59,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2022-11-02 19:49:59,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 19:49:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:49:59,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:50:00,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1596 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2022-11-02 19:50:00,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:00,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 41 [2022-11-02 19:50:00,650 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-11-02 19:50:00,693 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-11-02 19:50:00,716 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (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_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-11-02 19:50:00,762 WARN L833 $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_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-11-02 19:50:00,786 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) .cse0)))))) is different from false [2022-11-02 19:50:00,813 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) .cse0)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) is different from false [2022-11-02 19:50:00,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-11-02 19:50:00,887 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (= (select (store (select (store .cse0 .cse1 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) .cse1)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1595)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-11-02 19:50:01,556 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (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|) 0)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1595)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse4 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (= .cse3 (select (store (select (store .cse4 .cse3 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-11-02 19:50:01,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:01,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 47 [2022-11-02 19:50:01,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 181 treesize of output 167 [2022-11-02 19:50:01,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:01,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 170 [2022-11-02 19:50:01,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:01,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 109 [2022-11-02 19:50:01,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118 [2022-11-02 19:50:01,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:01,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 55 [2022-11-02 19:50:01,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 19:50:01,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2022-11-02 19:50:01,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 19:50:01,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 [2022-11-02 19:50:01,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 19:50:01,789 INFO L356 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2022-11-02 19:50:01,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 31 [2022-11-02 19:50:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-02 19:50:02,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728438225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:50:02,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:50:02,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 55 [2022-11-02 19:50:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494137117] [2022-11-02 19:50:02,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:50:02,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 19:50:02,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:02,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 19:50:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1932, Unknown=10, NotChecked=970, Total=3080 [2022-11-02 19:50:02,084 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 56 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 56 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-02 19:50:02,926 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (= (select (store (select (store .cse2 .cse3 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) .cse3)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1595)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-11-02 19:50:03,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse1 (select .cse2 .cse5))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select .cse0 .cse1) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (= (select (store (select (store .cse3 .cse4 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) .cse4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) v_ArrVal_1595)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))))) is different from false [2022-11-02 19:50:04,245 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (= (select (store (select (store .cse2 .cse3 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) .cse3)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1594 (Array Int Int))) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1594))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4) v_ArrVal_1595)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))))) is different from false [2022-11-02 19:50:04,789 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) .cse0) 1) (= (select .cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1595) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))))) is different from false [2022-11-02 19:50:10,247 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse1 (select .cse3 4)) (.cse0 (select .cse6 4)) (.cse4 (select .cse2 4)) (.cse5 (select .cse6 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= 1 (select (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse2 8) 0) (= (select .cse3 8) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) .cse4) 1) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) .cse0) 1) (not (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= .cse5 (select (store (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))))) (= (select .cse6 8) 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))))) is different from false [2022-11-02 19:50:10,737 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (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))) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.offset|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) .cse1) 1) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| 0) (= (select .cse0 8) 0))) is different from false [2022-11-02 19:50:11,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) .cse0) 1) (= (select .cse1 8) 0)))) is different from false [2022-11-02 19:50:11,798 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) .cse0) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= (select .cse1 8) 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1596 Int) (v_ArrVal_1595 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|))))) is different from false [2022-11-02 19:50:12,273 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1596 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1596) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1) (= (select .cse0 8) 0))) is different from false [2022-11-02 19:50:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:13,092 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-11-02 19:50:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 19:50:13,092 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 56 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 45 [2022-11-02 19:50:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:13,093 INFO L225 Difference]: With dead ends: 62 [2022-11-02 19:50:13,093 INFO L226 Difference]: Without dead ends: 62 [2022-11-02 19:50:13,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=343, Invalid=3136, Unknown=19, NotChecked=2508, Total=6006 [2022-11-02 19:50:13,096 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 124 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:13,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 235 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 599 Invalid, 0 Unknown, 460 Unchecked, 0.5s Time] [2022-11-02 19:50:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-02 19:50:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-11-02 19:50:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-11-02 19:50:13,099 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2022-11-02 19:50:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:13,099 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-11-02 19:50:13,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.2363636363636363) internal successors, (123), 56 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-02 19:50:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-11-02 19:50:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 19:50:13,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:13,100 INFO L195 NwaCegarLoop]: trace histogram [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-02 19:50:13,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 19:50:13,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 19:50:13,320 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:50:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:13,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912180, now seen corresponding path program 1 times [2022-11-02 19:50:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:13,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734284447] [2022-11-02 19:50:13,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:13,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 19:50:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:14,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734284447] [2022-11-02 19:50:14,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734284447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:50:14,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072647497] [2022-11-02 19:50:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:14,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:14,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:14,920 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:50:14,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 19:50:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:15,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-02 19:50:15,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:50:15,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:15,263 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 19:50:15,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:15,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:15,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:15,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:15,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:15,427 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:50:15,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 19:50:15,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 19:50:15,667 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:50:15,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 19:50:15,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 19:50:15,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:50:15,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:15,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:50:15,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-02 19:50:15,941 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:15,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2022-11-02 19:50:15,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:15,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:50:16,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:50:17,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int)) (<= 0 (+ (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 4))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))))))) is different from false [2022-11-02 19:50:17,765 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1728) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1729) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1728) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|)))) is different from false [2022-11-02 19:50:17,806 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1728) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1729) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1728) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4))))))) is different from false [2022-11-02 19:50:17,830 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (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_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1729) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))))))) is different from false [2022-11-02 19:50:17,875 WARN L833 $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_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1729) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))))) is different from false [2022-11-02 19:50:17,900 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1729) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 4))))))) is different from false [2022-11-02 19:50:17,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1729) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 4))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))))) is different from false [2022-11-02 19:50:17,964 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1729) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))))) (forall ((v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1732 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1728) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))))) is different from false [2022-11-02 19:50:17,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:17,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 96 treesize of output 100 [2022-11-02 19:50:18,079 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1731 Int) (v_ArrVal_1729 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int) (v_ArrVal_1726 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1726))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1729)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_4 v_prenex_2) 4) 4)))) (forall ((v_ArrVal_1732 Int) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (or (< (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1727) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1726) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1728) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))))) is different from false [2022-11-02 19:50:18,145 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1732 Int) (v_ArrVal_1723 Int) (v_ArrVal_1722 Int) (v_ArrVal_1728 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (< (select (store (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1722)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1727) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse1 v_ArrVal_1723)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1726) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1728) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)))) (forall ((v_ArrVal_1731 Int) (v_ArrVal_1723 Int) (v_ArrVal_1729 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int) (v_ArrVal_1726 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (= (select (store (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse1 v_ArrVal_1723)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1726))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1729)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_1723 Int) (v_ArrVal_1722 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (<= 0 (+ 4 (select (store (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1722)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse1 v_ArrVal_1723)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) v_prenex_3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_4 v_prenex_2) 4))))))) is different from false [2022-11-02 19:50:18,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:18,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 63 [2022-11-02 19:50:18,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:18,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 48 [2022-11-02 19:50:18,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 54 [2022-11-02 19:50:18,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 140 treesize of output 134 [2022-11-02 19:50:18,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 100 [2022-11-02 19:50:18,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 84 [2022-11-02 19:50:18,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 156 treesize of output 150 [2022-11-02 19:50:18,226 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:18,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 182 treesize of output 182 [2022-11-02 19:50:18,312 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 19:50:18,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-11-02 19:50:18,319 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-02 19:50:18,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 1 [2022-11-02 19:50:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-02 19:50:18,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072647497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:50:18,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:50:18,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 51 [2022-11-02 19:50:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549773619] [2022-11-02 19:50:18,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:50:18,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-02 19:50:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-02 19:50:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1588, Unknown=10, NotChecked=890, Total=2652 [2022-11-02 19:50:18,554 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 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-02 19:50:20,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select .cse2 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int)) (<= 0 (+ (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 4))))) (= (select .cse1 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 8) (select |c_#length| (select (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))))) (<= 12 (select |c_#length| .cse0)) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|)))) is different from false [2022-11-02 19:50:21,387 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select .cse2 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int)) (<= 0 (+ (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 4))))) (= (select .cse1 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1732 Int) (v_ArrVal_1731 Int)) (<= (+ (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1732) 4) 8) (select |c_#length| (select (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1731) 4)))))) (<= 12 (select |c_#length| .cse0))))) is different from false [2022-11-02 19:50:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:22,157 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-11-02 19:50:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 19:50:22,157 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 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 45 [2022-11-02 19:50:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:22,158 INFO L225 Difference]: With dead ends: 66 [2022-11-02 19:50:22,158 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 19:50:22,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=355, Invalid=2871, Unknown=14, NotChecked=1452, Total=4692 [2022-11-02 19:50:22,160 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 93 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 680 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:22,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 306 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 622 Invalid, 0 Unknown, 680 Unchecked, 0.5s Time] [2022-11-02 19:50:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 19:50:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-11-02 19:50:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 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-02 19:50:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-11-02 19:50:22,163 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 45 [2022-11-02 19:50:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:22,163 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-11-02 19:50:22,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 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-02 19:50:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-11-02 19:50:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 19:50:22,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:22,164 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, 1, 1, 1, 1] [2022-11-02 19:50:22,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-02 19:50:22,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 19:50:22,365 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:50:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1960736865, now seen corresponding path program 1 times [2022-11-02 19:50:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307587832] [2022-11-02 19:50:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 19:50:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:23,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307587832] [2022-11-02 19:50:23,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307587832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:50:23,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504333898] [2022-11-02 19:50:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:23,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:23,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:23,521 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:50:23,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 19:50:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:23,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-02 19:50:23,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:50:23,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 19:50:23,776 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 19:50:23,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 19:50:23,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:23,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-02 19:50:23,882 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:50:23,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2022-11-02 19:50:24,058 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:50:24,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-11-02 19:50:24,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:50:24,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 [2022-11-02 19:50:24,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:24,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 20 [2022-11-02 19:50:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:50:24,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:50:24,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= 0 (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-11-02 19:50:24,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1858 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1858) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4) 0)))) is different from false [2022-11-02 19:50:24,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1858 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1858) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-11-02 19:50:24,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1858 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (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)) v_ArrVal_1858) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-11-02 19:50:24,911 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1858 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (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_1858) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4) 0)))) is different from false [2022-11-02 19:50:24,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1858 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1858) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4) 0)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-11-02 19:50:24,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1858 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1858) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4) 0)))) is different from false [2022-11-02 19:50:24,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1858 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1858) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4) 0)))) is different from false [2022-11-02 19:50:24,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1858 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= 0 (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1857))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1858)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4))))) is different from false [2022-11-02 19:50:24,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1855 Int) (v_ArrVal_1858 (Array Int Int))) (or (not (= (select (store (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_1855)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1857))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1858)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-11-02 19:50:25,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:25,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 47 [2022-11-02 19:50:25,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 171 treesize of output 159 [2022-11-02 19:50:25,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:25,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 156 [2022-11-02 19:50:25,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:25,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 109 [2022-11-02 19:50:25,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118 [2022-11-02 19:50:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-02 19:50:25,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504333898] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:50:25,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:50:25,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 22] total 44 [2022-11-02 19:50:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41162269] [2022-11-02 19:50:25,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:50:25,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 19:50:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 19:50:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1019, Unknown=10, NotChecked=730, Total=1892 [2022-11-02 19:50:25,259 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:32,930 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= 0 (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|)))) is different from false [2022-11-02 19:50:33,286 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_1859 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= 0 (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1859) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|)))))) is different from false [2022-11-02 19:50:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:33,669 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-11-02 19:50:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 19:50:33,669 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-02 19:50:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:33,670 INFO L225 Difference]: With dead ends: 63 [2022-11-02 19:50:33,670 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 19:50:33,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=263, Invalid=1935, Unknown=12, NotChecked=1212, Total=3422 [2022-11-02 19:50:33,672 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 122 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 497 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:33,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 335 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 428 Invalid, 0 Unknown, 497 Unchecked, 0.3s Time] [2022-11-02 19:50:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 19:50:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-11-02 19:50:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-11-02 19:50:33,675 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 46 [2022-11-02 19:50:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:33,676 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-11-02 19:50:33,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-11-02 19:50:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 19:50:33,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:33,677 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 19:50:33,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 19:50:33,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:33,891 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:50:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1223965472, now seen corresponding path program 1 times [2022-11-02 19:50:33,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:33,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452587833] [2022-11-02 19:50:33,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:33,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 19:50:35,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:35,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452587833] [2022-11-02 19:50:35,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452587833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:50:35,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228625577] [2022-11-02 19:50:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:35,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:35,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:35,313 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:50:35,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 19:50:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:35,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 19:50:35,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:50:35,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:35,653 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 19:50:35,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 19:50:35,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:35,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:35,860 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:50:35,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 40 [2022-11-02 19:50:36,331 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:50:36,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 34 [2022-11-02 19:50:36,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:50:36,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:50:36,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-02 19:50:36,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:36,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2022-11-02 19:50:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:50:36,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:50:37,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) is different from false [2022-11-02 19:50:37,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 19:50:37,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 19:50:37,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (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)) v_ArrVal_1986) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) is different from false [2022-11-02 19:50:37,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (< (select (store (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_1986) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 19:50:37,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1986) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 19:50:37,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1986) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 19:50:37,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1986) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 19:50:37,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (< (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1984))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1986)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 19:50:37,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (< (select (store (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|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1984))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1986)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 19:50:37,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:37,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 46 [2022-11-02 19:50:37,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 296 treesize of output 276 [2022-11-02 19:50:37,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 300 treesize of output 292 [2022-11-02 19:50:37,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:37,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 312 treesize of output 292 [2022-11-02 19:50:37,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:37,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 320 treesize of output 302 [2022-11-02 19:50:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-02 19:50:38,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228625577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:50:38,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:50:38,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 54 [2022-11-02 19:50:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844508741] [2022-11-02 19:50:38,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:50:38,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-02 19:50:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:38,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-02 19:50:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1842, Unknown=10, NotChecked=950, Total=2970 [2022-11-02 19:50:38,544 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:46,758 WARN L234 SmtUtils]: Spent 7.43s on a formula simplification. DAG size of input: 70 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 19:50:47,743 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= (select .cse1 8) 0) (< .cse0 |c_#StackHeapBarrier|)))) is different from false [2022-11-02 19:50:48,117 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int) (v_ArrVal_1988 Int)) (or (< (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1988) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select .cse1 8) 0) (< .cse0 |c_#StackHeapBarrier|)))) is different from false [2022-11-02 19:50:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:48,849 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-11-02 19:50:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 19:50:48,850 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-02 19:50:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:48,851 INFO L225 Difference]: With dead ends: 61 [2022-11-02 19:50:48,851 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 19:50:48,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=377, Invalid=3319, Unknown=12, NotChecked=1548, Total=5256 [2022-11-02 19:50:48,853 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 132 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:48,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 383 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 619 Invalid, 0 Unknown, 610 Unchecked, 0.5s Time] [2022-11-02 19:50:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 19:50:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-02 19:50:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 60 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-02 19:50:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-11-02 19:50:48,859 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 48 [2022-11-02 19:50:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:48,860 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-11-02 19:50:48,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-11-02 19:50:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 19:50:48,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:48,861 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-02 19:50:48,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 19:50:49,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 19:50:49,072 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-02 19:50:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1116795216, now seen corresponding path program 2 times [2022-11-02 19:50:49,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:49,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058911529] [2022-11-02 19:50:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:50:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:51,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058911529] [2022-11-02 19:50:51,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058911529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:50:51,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385720092] [2022-11-02 19:50:51,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 19:50:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:51,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:51,598 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:50:51,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82afce8e-8450-412b-adff-bf3c877a1ca4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 19:50:51,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 19:50:51,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 19:50:51,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-02 19:50:51,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:50:51,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,916 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 19:50:51,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:51,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:52,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:52,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:52,158 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 19:50:52,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 50 [2022-11-02 19:50:52,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-02 19:50:52,909 INFO L356 Elim1Store]: treesize reduction 108, result has 37.6 percent of original size [2022-11-02 19:50:52,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 106 [2022-11-02 19:50:52,993 INFO L356 Elim1Store]: treesize reduction 52, result has 52.7 percent of original size [2022-11-02 19:50:52,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 74 [2022-11-02 19:50:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:50:54,480 INFO L356 Elim1Store]: treesize reduction 156, result has 33.9 percent of original size [2022-11-02 19:50:54,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 244 treesize of output 237 [2022-11-02 19:50:54,559 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-02 19:50:54,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 163 treesize of output 176 [2022-11-02 19:50:55,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:55,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 69 [2022-11-02 19:50:55,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:55,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 19:50:55,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:55,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 69 [2022-11-02 19:50:58,020 INFO L356 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2022-11-02 19:50:58,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 49 [2022-11-02 19:50:58,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:50:58,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2022-11-02 19:50:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:50:58,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:51:10,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2132 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138))) (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (select .cse2 4)))) 4) 0))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2133 Int) (v_ArrVal_2132 Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2133)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2136) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138) 4)) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|)))))) is different from false [2022-11-02 19:51:10,471 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2133 Int) (v_ArrVal_2132 Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2133)) |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2136) (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138) 4)) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2132 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (= 0 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138))) (select (store .cse3 |c_ULTIMATE.start_dll_create_#res#1.base| .cse4) (select .cse4 4)))) 4)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|)))))) is different from false [2022-11-02 19:51:10,505 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2132 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138))) (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) (select .cse2 4)))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2133 Int) (v_ArrVal_2132 Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2133)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2136) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138) 4)) 4) 0)))))) is different from false [2022-11-02 19:51:10,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2132 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138))) (select (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 4)))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2133 Int) (v_ArrVal_2132 Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2133)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2136) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138) 4)) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|)))))) is different from false [2022-11-02 19:51:10,599 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse6 (select .cse4 .cse5)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2132 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int) (v_ArrVal_2129 Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_2129)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (= (select (let ((.cse2 (store .cse4 .cse5 (store .cse6 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138))) (select (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 4)))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2133 Int) (v_ArrVal_2132 Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int) (v_ArrVal_2129 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_2129)))) (or (< (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (= (select (select (store (store .cse7 .cse5 (store (select .cse7 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2133)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2136) (select (store (select (store .cse4 .cse5 (store .cse6 |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138) 4)) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|))))))))) is different from false [2022-11-02 19:51:10,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse7 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2132 Int) (v_ArrVal_2124 Int) (v_ArrVal_2126 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int) (v_ArrVal_2129 Int)) (or (= (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse6 .cse7 v_ArrVal_2124)))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138))) (select (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 4)))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse7 v_ArrVal_2126)))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_2129))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2133 Int) (v_ArrVal_2132 Int) (v_ArrVal_2124 Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2126 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int) (v_ArrVal_2129 Int)) (let ((.cse10 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 .cse7 v_ArrVal_2126)))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_2129))))) (or (= (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse6 .cse7 v_ArrVal_2124)))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (select (store (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2133)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2136) (select (store (select (store .cse12 .cse11 (store (select .cse12 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138) 4)))) 4) 0) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (< (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|)))))) is different from false [2022-11-02 19:51:10,825 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$.offset| |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_2121 Int)) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2132 Int) (v_ArrVal_2124 Int) (v_ArrVal_2126 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int) (v_ArrVal_2129 Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse2 .cse3 v_ArrVal_2121) .cse4 v_ArrVal_2126)))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 v_ArrVal_2129))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (= (select (let ((.cse5 (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse4 v_ArrVal_2124)))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)))))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138))) (select (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) (select .cse6 4)))) 4) 0))) (not (<= v_ArrVal_2121 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2121 Int)) (or (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2133 Int) (v_ArrVal_2132 Int) (v_ArrVal_2124 Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2126 Int) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int) (v_ArrVal_2129 Int)) (let ((.cse11 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse2 .cse3 v_ArrVal_2121) .cse4 v_ArrVal_2126)))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 v_ArrVal_2129))))) (or (= (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse4 v_ArrVal_2124)))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (select (store (store .cse11 .cse12 (store (select .cse11 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2133)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2136) (select (store (select (store .cse13 .cse12 (store (select .cse13 .cse12) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138) 4)))) 4) 0) (< (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|)))) (not (<= v_ArrVal_2121 |c_ULTIMATE.start_dll_create_~head~0#1.offset|))))))) is different from false [2022-11-02 19:51:10,911 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:51:10,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 502 treesize of output 279 [2022-11-02 19:51:10,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:51:10,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2022-11-02 19:51:10,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:51:10,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 381 treesize of output 337 [2022-11-02 19:51:11,022 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:51:11,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 297 treesize of output 194 [2022-11-02 19:51:11,079 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2132 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int) (v_ArrVal_2129 Int)) (or (not (<= (select v_arrayElimArr_14 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (< (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_14))) (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 v_ArrVal_2129))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (= (select (let ((.cse3 (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_13))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)))))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138))) (select (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 4)))) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2133 Int) (v_ArrVal_2132 Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2138 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int) (v_ArrVal_2129 Int)) (let ((.cse8 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_15))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 v_ArrVal_2129))))) (or (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< (select (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (not (<= (select v_arrayElimArr_15 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (= (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_16))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (select (store (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2133)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2136) (select (store (select (store .cse10 .cse9 (store (select .cse10 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2132)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2138) 4)))) 4) 0)))))) is different from false [2022-11-02 19:51:15,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:51:15,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 471 treesize of output 401 [2022-11-02 19:51:15,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:51:15,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 357 treesize of output 198 [2022-11-02 19:51:15,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:51:15,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 19:51:15,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29000 treesize of output 28278 [2022-11-02 19:51:15,858 INFO L356 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-11-02 19:51:15,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 1237210 treesize of output 1183403 [2022-11-02 19:51:23,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 19:51:23,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2085018 treesize of output 1923466