./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/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_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/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_0a75a6cb-0d8a-4da8-9297-d45f07a81795/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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- 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 20:43:07,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:43:07,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:43:07,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:43:07,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:43:07,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:43:07,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:43:07,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:43:07,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:43:07,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:43:07,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:43:07,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:43:07,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:43:07,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:43:07,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:43:07,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:43:07,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:43:07,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:43:07,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:43:07,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:43:07,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:43:07,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:43:07,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:43:07,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:43:07,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:43:07,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:43:07,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:43:07,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:43:07,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:43:07,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:43:07,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:43:07,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:43:07,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:43:07,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:43:07,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:43:07,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:43:07,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:43:07,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:43:07,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:43:07,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:43:07,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:43:07,616 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:43:07,657 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:43:07,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:43:07,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:43:07,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:43:07,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:43:07,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:43:07,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:43:07,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:43:07,662 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:43:07,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:43:07,663 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:43:07,663 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:43:07,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:43:07,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:43:07,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:43:07,664 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:43:07,664 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:43:07,665 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:43:07,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:43:07,665 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:43:07,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:43:07,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:43:07,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:43:07,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:43:07,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:43:07,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:07,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:43:07,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:43:07,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:43:07,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:43:07,669 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_0a75a6cb-0d8a-4da8-9297-d45f07a81795/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_0a75a6cb-0d8a-4da8-9297-d45f07a81795/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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2022-11-02 20:43:08,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:43:08,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:43:08,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:43:08,056 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:43:08,057 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:43:08,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-02 20:43:08,149 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/data/aa0afe043/aef62869710443758473ec59d71522b7/FLAG65c617969 [2022-11-02 20:43:08,788 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:43:08,789 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-02 20:43:08,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/data/aa0afe043/aef62869710443758473ec59d71522b7/FLAG65c617969 [2022-11-02 20:43:09,051 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/data/aa0afe043/aef62869710443758473ec59d71522b7 [2022-11-02 20:43:09,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:43:09,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:43:09,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:09,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:43:09,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:43:09,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b24be54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09, skipping insertion in model container [2022-11-02 20:43:09,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:43:09,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:43:09,539 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_0a75a6cb-0d8a-4da8-9297-d45f07a81795/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-02 20:43:09,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:09,560 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:43:09,623 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_0a75a6cb-0d8a-4da8-9297-d45f07a81795/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-02 20:43:09,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:09,656 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:43:09,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09 WrapperNode [2022-11-02 20:43:09,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:09,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:09,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:43:09,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:43:09,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,738 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-11-02 20:43:09,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:09,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:43:09,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:43:09,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:43:09,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,792 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:43:09,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:43:09,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:43:09,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:43:09,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (1/1) ... [2022-11-02 20:43:09,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:09,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:09,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:09,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:43:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:43:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:43:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:43:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:43:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:43:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:43:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:43:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:43:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:43:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:43:10,047 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:43:10,050 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:43:10,431 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:43:10,439 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:43:10,440 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:43:10,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:10 BoogieIcfgContainer [2022-11-02 20:43:10,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:43:10,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:43:10,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:43:10,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:43:10,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:43:09" (1/3) ... [2022-11-02 20:43:10,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da7535b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:10, skipping insertion in model container [2022-11-02 20:43:10,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:09" (2/3) ... [2022-11-02 20:43:10,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da7535b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:10, skipping insertion in model container [2022-11-02 20:43:10,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:10" (3/3) ... [2022-11-02 20:43:10,458 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2022-11-02 20:43:10,477 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:43:10,477 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-02 20:43:10,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:43:10,532 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;@540e7164, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:43:10,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-02 20:43:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 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 20:43:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:43:10,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:10,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:43:10,544 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:10,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-11-02 20:43:10,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:10,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195965731] [2022-11-02 20:43:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:10,878 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 20:43:10,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:10,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195965731] [2022-11-02 20:43:10,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195965731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:10,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:10,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:43:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502572877] [2022-11-02 20:43:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:10,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:10,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:10,921 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 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 20:43:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:11,068 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-02 20:43:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:11,070 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 20:43:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:11,079 INFO L225 Difference]: With dead ends: 109 [2022-11-02 20:43:11,079 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 20:43:11,081 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 20:43:11,085 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:11,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 20:43:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-02 20:43:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-02 20:43:11,123 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-11-02 20:43:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:11,124 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-02 20:43:11,124 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 20:43:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-02 20:43:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:43:11,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:11,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:43:11,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:43:11,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-11-02 20:43:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:11,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720754109] [2022-11-02 20:43:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,266 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 20:43:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:11,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720754109] [2022-11-02 20:43:11,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720754109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:11,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:11,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:43:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581225770] [2022-11-02 20:43:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:11,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:11,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:11,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:11,271 INFO L87 Difference]: Start difference. First operand 59 states and 64 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 20:43:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:11,362 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-02 20:43:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:11,363 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 20:43:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:11,365 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:43:11,365 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:43:11,365 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 20:43:11,367 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:11,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:11,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:43:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-11-02 20:43:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 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 20:43:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-02 20:43:11,375 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-11-02 20:43:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:11,375 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-02 20:43:11,376 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 20:43:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-02 20:43:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:43:11,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:11,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:11,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:43:11,377 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-11-02 20:43:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:11,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862628951] [2022-11-02 20:43:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,429 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 20:43:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:11,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862628951] [2022-11-02 20:43:11,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862628951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:11,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:11,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436959701] [2022-11-02 20:43:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:11,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:11,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:11,432 INFO L87 Difference]: Start difference. First operand 57 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 20:43:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:11,443 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-02 20:43:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:11,446 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 20:43:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:11,447 INFO L225 Difference]: With dead ends: 68 [2022-11-02 20:43:11,447 INFO L226 Difference]: Without dead ends: 68 [2022-11-02 20:43:11,448 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 20:43:11,449 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 20:43:11,449 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 20:43:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-02 20:43:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-02 20:43:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 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 20:43:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-02 20:43:11,455 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-11-02 20:43:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:11,456 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-02 20:43:11,456 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 20:43:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-02 20:43:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:43:11,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:11,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:11,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:43:11,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-11-02 20:43:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:11,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936547361] [2022-11-02 20:43:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,611 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 20:43:11,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:11,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936547361] [2022-11-02 20:43:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936547361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:11,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792396217] [2022-11-02 20:43:11,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:11,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:11,614 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 20:43:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:11,736 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-02 20:43:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 20:43:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:11,737 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:43:11,737 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:43:11,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:43:11,739 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:11,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:43:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-02 20:43:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 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 20:43:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-02 20:43:11,746 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-11-02 20:43:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:11,746 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-02 20:43:11,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 20:43:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-02 20:43:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:43:11,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:11,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:11,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:43:11,748 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-11-02 20:43:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:11,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507280095] [2022-11-02 20:43:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,981 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 20:43:11,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507280095] [2022-11-02 20:43:11,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507280095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:11,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:11,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:11,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576514928] [2022-11-02 20:43:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:11,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:11,988 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 20:43:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:12,122 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-02 20:43:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:12,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 20:43:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:12,126 INFO L225 Difference]: With dead ends: 61 [2022-11-02 20:43:12,126 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 20:43:12,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:43:12,133 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:12,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 20:43:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-02 20:43:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 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 20:43:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-02 20:43:12,148 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-11-02 20:43:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:12,148 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-02 20:43:12,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 20:43:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-02 20:43:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:43:12,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:12,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:12,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:43:12,151 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-11-02 20:43:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:12,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159904579] [2022-11-02 20:43:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:12,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,251 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 20:43:12,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:12,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159904579] [2022-11-02 20:43:12,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159904579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:12,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454728319] [2022-11-02 20:43:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:12,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:12,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:12,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:12,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:43:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:43:12,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:12,483 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 20:43:12,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:12,549 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 20:43:12,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454728319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:12,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:12,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 20:43:12,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658822812] [2022-11-02 20:43:12,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:12,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:12,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:12,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:12,553 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 20:43:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:12,577 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-02 20:43:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:12,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 17 [2022-11-02 20:43:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:12,578 INFO L225 Difference]: With dead ends: 65 [2022-11-02 20:43:12,579 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:43:12,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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 20:43:12,585 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 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 20:43:12,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:43:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-02 20:43:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 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 20:43:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-02 20:43:12,599 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-11-02 20:43:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:12,600 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-02 20:43:12,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 20:43:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-02 20:43:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:43:12,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:12,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:12,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:12,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:12,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-11-02 20:43:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:12,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482873991] [2022-11-02 20:43:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:13,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:13,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482873991] [2022-11-02 20:43:13,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482873991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:13,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:13,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:43:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554731426] [2022-11-02 20:43:13,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:13,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:43:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:43:13,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:13,140 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 20:43:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:13,469 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-02 20:43:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:43:13,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 20:43:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:13,471 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:43:13,472 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:43:13,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:43:13,474 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 379 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:13,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 141 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:43:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-11-02 20:43:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 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 20:43:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-02 20:43:13,497 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-11-02 20:43:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:13,499 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-02 20:43:13,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 20:43:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-02 20:43:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:43:13,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:13,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:13,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:43:13,502 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-11-02 20:43:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:13,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811088460] [2022-11-02 20:43:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:13,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811088460] [2022-11-02 20:43:13,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811088460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:13,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:13,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:43:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780903077] [2022-11-02 20:43:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:13,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:43:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:43:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:13,925 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 20:43:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:14,258 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-11-02 20:43:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:43:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 20:43:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:14,260 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:43:14,267 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:43:14,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:43:14,268 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 389 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:14,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 103 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:43:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 68. [2022-11-02 20:43:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-11-02 20:43:14,276 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2022-11-02 20:43:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:14,276 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-11-02 20:43:14,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 20:43:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-11-02 20:43:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:43:14,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:14,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:14,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:43:14,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash -893075880, now seen corresponding path program 1 times [2022-11-02 20:43:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:14,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072501009] [2022-11-02 20:43:14,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:14,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:14,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072501009] [2022-11-02 20:43:14,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072501009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:14,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:14,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:43:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076904692] [2022-11-02 20:43:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:14,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:43:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:43:14,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:14,476 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 20:43:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:14,720 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-11-02 20:43:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:43:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:43:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:14,722 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:43:14,722 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:43:14,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:43:14,723 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 363 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:14,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 124 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:43:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-11-02 20:43:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-02 20:43:14,727 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 28 [2022-11-02 20:43:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:14,727 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-02 20:43:14,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 20:43:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-02 20:43:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:43:14,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:14,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:14,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:43:14,729 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -893075879, now seen corresponding path program 1 times [2022-11-02 20:43:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:14,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157511530] [2022-11-02 20:43:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:14,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:14,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157511530] [2022-11-02 20:43:14,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157511530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:14,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770281079] [2022-11-02 20:43:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:14,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:14,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:43:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:15,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:15,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:43:15,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:15,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770281079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:15,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:15,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-02 20:43:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713326102] [2022-11-02 20:43:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:15,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:15,084 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:15,103 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-11-02 20:43:15,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:15,104 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 28 [2022-11-02 20:43:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:15,106 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:43:15,106 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:43:15,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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 20:43:15,108 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 72 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:15,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:43:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2022-11-02 20:43:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 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 20:43:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-11-02 20:43:15,113 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2022-11-02 20:43:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:15,114 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-11-02 20:43:15,114 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 20:43:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-11-02 20:43:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:43:15,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:15,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:15,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:15,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:15,332 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-11-02 20:43:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:15,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230959987] [2022-11-02 20:43:15,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:43:15,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:15,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230959987] [2022-11-02 20:43:15,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230959987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:15,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:15,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:15,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159147452] [2022-11-02 20:43:15,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:15,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:15,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:15,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:15,499 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 20:43:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:15,535 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-11-02 20:43:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:43:15,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 29 [2022-11-02 20:43:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:15,537 INFO L225 Difference]: With dead ends: 147 [2022-11-02 20:43:15,537 INFO L226 Difference]: Without dead ends: 147 [2022-11-02 20:43:15,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:15,538 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 86 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:15,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 161 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-02 20:43:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 74. [2022-11-02 20:43:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 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 20:43:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-11-02 20:43:15,547 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 29 [2022-11-02 20:43:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:15,547 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-11-02 20:43:15,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 20:43:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-11-02 20:43:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:43:15,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:15,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:15,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:43:15,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563827, now seen corresponding path program 1 times [2022-11-02 20:43:15,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:15,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975336233] [2022-11-02 20:43:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:15,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:15,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975336233] [2022-11-02 20:43:15,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975336233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:15,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947728809] [2022-11-02 20:43:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:15,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:15,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:15,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:43:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:15,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:43:15,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:43:15,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:43:16,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947728809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:16,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:16,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-02 20:43:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744940871] [2022-11-02 20:43:16,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:16,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:43:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:43:16,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:16,084 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:16,148 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2022-11-02 20:43:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:16,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:43:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:16,151 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:43:16,151 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:43:16,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:16,152 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 127 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:16,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 275 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:43:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2022-11-02 20:43:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.44) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 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 20:43:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-11-02 20:43:16,156 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 33 [2022-11-02 20:43:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:16,157 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-11-02 20:43:16,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-11-02 20:43:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:43:16,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:16,160 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 20:43:16,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:16,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:43:16,386 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash -146010198, now seen corresponding path program 1 times [2022-11-02 20:43:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:16,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520784138] [2022-11-02 20:43:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:17,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:17,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520784138] [2022-11-02 20:43:17,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520784138] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:17,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309719100] [2022-11-02 20:43:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:17,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:17,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:17,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:17,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:43:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 20:43:17,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:17,521 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 20:43:17,578 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:43:17,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:43:17,677 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 20:43:17,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:17,915 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 20:43:17,986 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 21 treesize of output 9 [2022-11-02 20:43:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:18,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:28,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309719100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:28,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:28,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-11-02 20:43:28,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411187688] [2022-11-02 20:43:28,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:28,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 20:43:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:28,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 20:43:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1066, Unknown=1, NotChecked=0, Total=1190 [2022-11-02 20:43:28,056 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 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 20:43:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:29,763 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2022-11-02 20:43:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:43:29,763 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 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 20:43:29,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:29,765 INFO L225 Difference]: With dead ends: 176 [2022-11-02 20:43:29,766 INFO L226 Difference]: Without dead ends: 176 [2022-11-02 20:43:29,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=538, Invalid=2011, Unknown=1, NotChecked=0, Total=2550 [2022-11-02 20:43:29,767 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1417 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:29,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 563 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 684 Invalid, 0 Unknown, 58 Unchecked, 0.7s Time] [2022-11-02 20:43:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-02 20:43:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 100. [2022-11-02 20:43:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 99 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 20:43:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-11-02 20:43:29,781 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 34 [2022-11-02 20:43:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:29,781 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-11-02 20:43:29,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 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 20:43:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-11-02 20:43:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:43:29,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:29,785 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 20:43:29,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:29,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:43:29,994 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash -146010197, now seen corresponding path program 1 times [2022-11-02 20:43:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:29,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415462166] [2022-11-02 20:43:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415462166] [2022-11-02 20:43:31,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415462166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119952561] [2022-11-02 20:43:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:31,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:31,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:31,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:43:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:31,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-02 20:43:31,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:31,584 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 20:43:31,868 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:43:31,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:43:31,904 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:31,904 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 20:43:32,155 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 20:43:32,169 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 20:43:32,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:32,597 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 34 [2022-11-02 20:43:32,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:43:32,610 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 40 treesize of output 33 [2022-11-02 20:43:32,736 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 20:43:32,752 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 20:43:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:43:32,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:35,471 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1)))))))) is different from false [2022-11-02 20:43:37,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))))) is different from false [2022-11-02 20:43:39,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1))))))) is different from false [2022-11-02 20:43:41,674 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1))))))) is different from false [2022-11-02 20:43:41,693 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 17 treesize of output 15 [2022-11-02 20:43:41,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:41,706 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 35 treesize of output 33 [2022-11-02 20:43:41,710 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 33 treesize of output 31 [2022-11-02 20:43:41,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:41,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:42,418 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 48 treesize of output 44 [2022-11-02 20:43:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:43:42,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119952561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:42,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:42,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 48 [2022-11-02 20:43:42,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743479995] [2022-11-02 20:43:42,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:42,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-02 20:43:42,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-02 20:43:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1853, Unknown=4, NotChecked=356, Total=2352 [2022-11-02 20:43:42,525 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 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 20:43:44,519 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse6 (select .cse3 .cse2))) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (select |c_#length| .cse6)) (.cse4 (select .cse1 .cse2))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 8 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) .cse0) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse2) 4) (select |c_#length| (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse2)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (= .cse4 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse2))))) (<= 8 .cse0) (<= (+ .cse4 8) .cse5) (<= 8 .cse5) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse6)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-11-02 20:43:45,438 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse2 .cse1)) (.cse4 (select .cse0 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1)))))) (<= 8 (select |c_#length| (select .cse2 4))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1))))) (not (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ .cse4 8) (select |c_#length| .cse3)) (<= 0 .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse0 4) 0)))) is different from false [2022-11-02 20:43:46,183 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse2 .cse1)) (.cse4 (select .cse0 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1)))))) (<= 8 (select |c_#length| (select .cse2 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1))))) (not (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ .cse4 8) (select |c_#length| .cse3)) (<= 0 .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse0 4) 0)))) is different from false [2022-11-02 20:43:46,983 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse2 (select .cse0 .cse1)) (.cse4 (select .cse3 .cse1))) (and (= (select .cse0 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 0 .cse2) (<= 8 (select |c_#length| (select .cse3 4))) (<= (+ 8 .cse2) (select |c_#length| .cse4)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse4))))) is different from false [2022-11-02 20:43:47,825 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse4)) (.cse3 (select .cse0 .cse4))) (and (<= 8 (select |c_#length| (select .cse0 4))) (= (select .cse1 4) 0) (<= 0 .cse2) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ 8 .cse2) (select |c_#length| .cse3)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse4) 4) (select |c_#length| (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse4))))))))) is different from false [2022-11-02 20:43:49,440 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse6 (select .cse3 .cse2))) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (select |c_#length| .cse6)) (.cse4 (select .cse1 .cse2))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 8 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) .cse0) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (<= (+ (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse2) 4) (select |c_#length| (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse2)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (= .cse4 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse2))))) (<= 8 .cse0) (<= (+ .cse4 8) .cse5) (<= 8 .cse5) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse6)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-11-02 20:43:50,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:50,253 INFO L93 Difference]: Finished difference Result 228 states and 283 transitions. [2022-11-02 20:43:50,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:43:50,254 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 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 20:43:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:50,255 INFO L225 Difference]: With dead ends: 228 [2022-11-02 20:43:50,255 INFO L226 Difference]: Without dead ends: 228 [2022-11-02 20:43:50,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=396, Invalid=3056, Unknown=10, NotChecked=1230, Total=4692 [2022-11-02 20:43:50,257 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 592 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:50,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1387 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 856 Invalid, 0 Unknown, 739 Unchecked, 0.8s Time] [2022-11-02 20:43:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-02 20:43:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 108. [2022-11-02 20:43:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 107 states have internal predecessors, (134), 0 states have call successors, (0), 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 20:43:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2022-11-02 20:43:50,262 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 34 [2022-11-02 20:43:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:50,262 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2022-11-02 20:43:50,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 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 20:43:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2022-11-02 20:43:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:43:50,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:50,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:50,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:50,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:43:50,485 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1013729350, now seen corresponding path program 2 times [2022-11-02 20:43:50,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:50,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071814110] [2022-11-02 20:43:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:43:50,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:50,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071814110] [2022-11-02 20:43:50,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071814110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:50,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753697581] [2022-11-02 20:43:50,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:50,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:50,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:50,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:50,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:43:50,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:50,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:50,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:50,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:43:50,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:43:50,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753697581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:50,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:50,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-02 20:43:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898185855] [2022-11-02 20:43:50,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:50,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:43:50,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:43:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:50,864 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:50,945 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-11-02 20:43:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:43:50,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:43:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:50,946 INFO L225 Difference]: With dead ends: 100 [2022-11-02 20:43:50,946 INFO L226 Difference]: Without dead ends: 100 [2022-11-02 20:43:50,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:43:50,947 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 203 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:50,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 136 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-02 20:43:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-11-02 20:43:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-11-02 20:43:50,950 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 37 [2022-11-02 20:43:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:50,950 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-11-02 20:43:50,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-11-02 20:43:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:43:50,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:50,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:50,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:51,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:43:51,162 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:51,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1104183591, now seen corresponding path program 2 times [2022-11-02 20:43:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:51,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748816348] [2022-11-02 20:43:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:43:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:51,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748816348] [2022-11-02 20:43:51,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748816348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:51,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808721688] [2022-11-02 20:43:51,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:51,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:51,335 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:51,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:43:51,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:51,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:51,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:43:51,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:43:51,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:43:51,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808721688] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:51,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:51,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-11-02 20:43:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913025361] [2022-11-02 20:43:51,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:51,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:43:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:43:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:51,579 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 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 20:43:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:51,719 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-11-02 20:43:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:43:51,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 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) Word has length 38 [2022-11-02 20:43:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:51,720 INFO L225 Difference]: With dead ends: 96 [2022-11-02 20:43:51,720 INFO L226 Difference]: Without dead ends: 96 [2022-11-02 20:43:51,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:43:51,721 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:51,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 346 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-02 20:43:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-02 20:43:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.358974358974359) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 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 20:43:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-11-02 20:43:51,724 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 38 [2022-11-02 20:43:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:51,724 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-11-02 20:43:51,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 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 20:43:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-11-02 20:43:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:43:51,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:51,725 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:43:51,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:51,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:51,926 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:51,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1861613195, now seen corresponding path program 1 times [2022-11-02 20:43:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:51,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073014666] [2022-11-02 20:43:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:43:52,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:52,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073014666] [2022-11-02 20:43:52,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073014666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:52,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:52,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:43:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763963991] [2022-11-02 20:43:52,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:52,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:43:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:43:52,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:52,234 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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 20:43:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:52,536 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2022-11-02 20:43:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:43:52,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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 41 [2022-11-02 20:43:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:52,537 INFO L225 Difference]: With dead ends: 119 [2022-11-02 20:43:52,537 INFO L226 Difference]: Without dead ends: 119 [2022-11-02 20:43:52,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:43:52,538 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 467 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:52,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 75 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-02 20:43:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2022-11-02 20:43:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 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 20:43:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-11-02 20:43:52,541 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 41 [2022-11-02 20:43:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:52,542 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-11-02 20:43:52,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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 20:43:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-11-02 20:43:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:43:52,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:52,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:52,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:43:52,543 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1835573310, now seen corresponding path program 3 times [2022-11-02 20:43:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:52,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139141871] [2022-11-02 20:43:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:52,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139141871] [2022-11-02 20:43:52,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139141871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:52,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605332509] [2022-11-02 20:43:52,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:43:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:52,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:52,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:43:52,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:43:52,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:52,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:43:52,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:43:52,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:52,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605332509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:52,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:52,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2022-11-02 20:43:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304814703] [2022-11-02 20:43:52,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:52,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:52,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:52,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:52,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:52,990 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 20:43:53,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:53,021 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-02 20:43:53,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:53,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 20:43:53,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:53,023 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:43:53,023 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:43:53,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:53,023 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:53,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 156 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:43:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-11-02 20:43:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 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 20:43:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-11-02 20:43:53,026 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 42 [2022-11-02 20:43:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:53,026 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-11-02 20:43:53,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 20:43:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-11-02 20:43:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:43:53,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:53,027 INFO L195 NwaCegarLoop]: trace histogram [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 20:43:53,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:53,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:43:53,228 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1595673087, now seen corresponding path program 1 times [2022-11-02 20:43:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:53,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284077848] [2022-11-02 20:43:53,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:43:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:53,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284077848] [2022-11-02 20:43:53,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284077848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:53,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:53,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608630936] [2022-11-02 20:43:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:53,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:53,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:53,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:53,312 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:53,337 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-11-02 20:43:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:43:53,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-02 20:43:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:53,339 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:43:53,339 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:43:53,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:53,340 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 19 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:53,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:43:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-11-02 20:43:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 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 20:43:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-11-02 20:43:53,342 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 44 [2022-11-02 20:43:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:53,343 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-11-02 20:43:53,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-11-02 20:43:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:43:53,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:53,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:53,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:43:53,344 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:43:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2124312202, now seen corresponding path program 1 times [2022-11-02 20:43:53,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:53,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244504608] [2022-11-02 20:43:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:53,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:54,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:54,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244504608] [2022-11-02 20:43:54,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244504608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:54,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245256626] [2022-11-02 20:43:54,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:54,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:54,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:54,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:54,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:43:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:55,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-02 20:43:55,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:55,099 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 20:43:55,296 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:43:55,296 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 20:43:55,465 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 20:43:55,802 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 20 treesize of output 19 [2022-11-02 20:43:55,810 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 11 treesize of output 7 [2022-11-02 20:43:55,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:43:55,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-11-02 20:43:56,119 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 20:43:56,319 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 15 treesize of output 7 [2022-11-02 20:43:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:56,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:56,630 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-11-02 20:43:56,646 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-11-02 20:43:56,657 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)))) is different from false [2022-11-02 20:43:56,676 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_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-02 20:43:56,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:56,703 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 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 20:43:56,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:56,714 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 58 treesize of output 61 [2022-11-02 20:43:56,721 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 23 treesize of output 21 [2022-11-02 20:43:56,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:56,755 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 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-02 20:43:56,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-02 20:43:56,767 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 23 treesize of output 21 [2022-11-02 20:43:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 20:43:57,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245256626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:57,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:57,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 66 [2022-11-02 20:43:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39697822] [2022-11-02 20:43:57,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:57,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-02 20:43:57,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:57,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-02 20:43:57,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3573, Unknown=4, NotChecked=492, Total=4290 [2022-11-02 20:43:57,488 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 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 20:43:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:59,872 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-02 20:43:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:43:59,873 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 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 20:43:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:59,874 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:43:59,874 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:43:59,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=864, Invalid=6804, Unknown=4, NotChecked=700, Total=8372 [2022-11-02 20:43:59,877 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 395 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:59,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 746 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 952 Invalid, 0 Unknown, 342 Unchecked, 0.7s Time] [2022-11-02 20:43:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:43:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-11-02 20:43:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 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 20:43:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-11-02 20:43:59,880 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 45 [2022-11-02 20:43:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:59,881 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-11-02 20:43:59,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 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 20:43:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-11-02 20:43:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:43:59,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:59,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:59,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:00,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:00,098 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:00,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429550, now seen corresponding path program 1 times [2022-11-02 20:44:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:00,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854690908] [2022-11-02 20:44:00,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:02,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:02,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854690908] [2022-11-02 20:44:02,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854690908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:02,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740414571] [2022-11-02 20:44:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:02,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:02,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:02,189 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:02,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:44:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:02,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-02 20:44:02,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:02,395 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 20:44:02,567 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:44:02,567 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 20:44:02,705 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 20:44:03,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:03,004 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 21 [2022-11-02 20:44:03,233 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:44:03,234 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 20:44:03,443 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 20:44:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:44:03,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:03,628 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-02 20:44:03,628 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 20:44:03,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-11-02 20:44:03,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-11-02 20:44:03,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-11-02 20:44:03,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2022-11-02 20:44:03,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (v_ArrVal_1229 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1229))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-02 20:44:03,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2022-11-02 20:44:03,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) is different from false [2022-11-02 20:44:03,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) is different from false [2022-11-02 20:44:03,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) is different from false [2022-11-02 20:44:03,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:03,778 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 2 case distinctions, treesize of input 53 treesize of output 51 [2022-11-02 20:44:03,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:03,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:03,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:03,788 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 2 case distinctions, treesize of input 27 treesize of output 31 [2022-11-02 20:44:03,792 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 20:44:03,796 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 20:44:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-02 20:44:04,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740414571] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:04,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:04,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 21] total 60 [2022-11-02 20:44:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185060017] [2022-11-02 20:44:04,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:04,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-02 20:44:04,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-02 20:44:04,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2528, Unknown=9, NotChecked=972, Total=3660 [2022-11-02 20:44:04,030 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 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 20:44:05,015 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select .cse1 .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse3 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229))) (let ((.cse2 (select .cse3 .cse0))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3) .cse2 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-11-02 20:44:05,020 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select .cse3 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-02 20:44:05,024 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (not (= (select .cse3 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-02 20:44:05,070 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select .cse3 .cse2))))) is different from false [2022-11-02 20:44:05,082 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse3 .cse2))))) is different from false [2022-11-02 20:44:05,416 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select .cse1 .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse3 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229))) (let ((.cse2 (select .cse3 .cse0))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3) .cse2 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-11-02 20:44:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:07,141 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2022-11-02 20:44:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-02 20:44:07,142 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 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 51 [2022-11-02 20:44:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:07,143 INFO L225 Difference]: With dead ends: 128 [2022-11-02 20:44:07,143 INFO L226 Difference]: Without dead ends: 128 [2022-11-02 20:44:07,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=568, Invalid=5177, Unknown=15, NotChecked=2430, Total=8190 [2022-11-02 20:44:07,147 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 597 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:07,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1068 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1599 Invalid, 0 Unknown, 880 Unchecked, 1.2s Time] [2022-11-02 20:44:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-02 20:44:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2022-11-02 20:44:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 82 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 20:44:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-02 20:44:07,150 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 51 [2022-11-02 20:44:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:07,151 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-02 20:44:07,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 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 20:44:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-02 20:44:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:44:07,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:07,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:07,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:07,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:44:07,362 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429551, now seen corresponding path program 1 times [2022-11-02 20:44:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:07,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073711846] [2022-11-02 20:44:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:07,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:09,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073711846] [2022-11-02 20:44:09,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073711846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:09,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345736981] [2022-11-02 20:44:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:09,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:09,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:09,634 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:09,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:44:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-02 20:44:09,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:09,853 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 20:44:10,016 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:44:10,017 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 20:44:10,166 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 20:44:10,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:10,507 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 21 [2022-11-02 20:44:10,514 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 6 treesize of output 5 [2022-11-02 20:44:10,790 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:44:10,791 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 20:44:10,798 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 20:44:11,069 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 20:44:11,073 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 20:44:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:44:11,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:11,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:11,469 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 20:44:12,108 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 144 treesize of output 132 [2022-11-02 20:44:12,123 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 79 treesize of output 71 [2022-11-02 20:44:12,128 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 106 treesize of output 98 [2022-11-02 20:44:12,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-11-02 20:44:13,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))))) is different from false [2022-11-02 20:44:13,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) is different from false [2022-11-02 20:44:14,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) is different from false [2022-11-02 20:44:14,231 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 18 treesize of output 16 [2022-11-02 20:44:14,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-11-02 20:44:14,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345736981] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:14,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:14,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20, 21] total 63 [2022-11-02 20:44:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884197939] [2022-11-02 20:44:14,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:14,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-02 20:44:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:14,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-02 20:44:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3374, Unknown=4, NotChecked=476, Total=4032 [2022-11-02 20:44:14,522 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 64 states, 63 states have (on average 2.238095238095238) internal successors, (141), 64 states have internal predecessors, (141), 0 states have call successors, (0), 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 20:44:16,077 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) 4) |c_ULTIMATE.start_node_create_#res#1.offset|) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) .cse1) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select .cse0 .cse1))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-11-02 20:44:16,499 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select .cse0 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-02 20:44:16,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (not (= (select .cse0 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-02 20:44:17,388 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) .cse1))))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select .cse0 .cse1))))) is different from false [2022-11-02 20:44:17,813 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 .cse1))) (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2022-11-02 20:44:18,593 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) 4) |c_ULTIMATE.start_node_create_#res#1.offset|) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) .cse1) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select .cse0 .cse1))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-11-02 20:44:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:20,618 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2022-11-02 20:44:20,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-02 20:44:20,619 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.238095238095238) internal successors, (141), 64 states have internal predecessors, (141), 0 states have call successors, (0), 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 51 [2022-11-02 20:44:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:20,620 INFO L225 Difference]: With dead ends: 136 [2022-11-02 20:44:20,620 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 20:44:20,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=713, Invalid=6799, Unknown=10, NotChecked=1790, Total=9312 [2022-11-02 20:44:20,623 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 669 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 667 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:20,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 998 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1222 Invalid, 0 Unknown, 667 Unchecked, 1.0s Time] [2022-11-02 20:44:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 20:44:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 82. [2022-11-02 20:44:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 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 20:44:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-02 20:44:20,627 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 51 [2022-11-02 20:44:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:20,628 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-02 20:44:20,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.238095238095238) internal successors, (141), 64 states have internal predecessors, (141), 0 states have call successors, (0), 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 20:44:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-02 20:44:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:44:20,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:20,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:20,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:20,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:44:20,842 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429606, now seen corresponding path program 1 times [2022-11-02 20:44:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:20,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229765977] [2022-11-02 20:44:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:44:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229765977] [2022-11-02 20:44:21,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229765977] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:21,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485317743] [2022-11-02 20:44:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:21,018 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:21,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:44:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:44:21,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:44:21,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:44:21,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485317743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:21,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:21,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-02 20:44:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395081894] [2022-11-02 20:44:21,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:21,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:21,272 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:21,332 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-11-02 20:44:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:44:21,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-02 20:44:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:21,333 INFO L225 Difference]: With dead ends: 73 [2022-11-02 20:44:21,333 INFO L226 Difference]: Without dead ends: 73 [2022-11-02 20:44:21,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:21,334 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:21,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 130 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-02 20:44:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-02 20:44:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-11-02 20:44:21,337 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 51 [2022-11-02 20:44:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:21,337 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-11-02 20:44:21,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-11-02 20:44:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:44:21,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:21,338 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:21,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:21,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:21,539 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2007861849, now seen corresponding path program 1 times [2022-11-02 20:44:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:21,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939466039] [2022-11-02 20:44:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:44:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939466039] [2022-11-02 20:44:21,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939466039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210836650] [2022-11-02 20:44:21,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:21,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:21,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:21,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:21,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:44:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:44:21,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:44:21,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:44:21,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210836650] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:21,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:21,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-02 20:44:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394584971] [2022-11-02 20:44:21,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:21,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:21,935 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:21,990 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-11-02 20:44:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:21,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-02 20:44:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:21,992 INFO L225 Difference]: With dead ends: 73 [2022-11-02 20:44:21,992 INFO L226 Difference]: Without dead ends: 73 [2022-11-02 20:44:21,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:21,993 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 72 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:21,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-02 20:44:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-02 20:44:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.121212121212121) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-11-02 20:44:21,997 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 52 [2022-11-02 20:44:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:21,997 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-11-02 20:44:21,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-11-02 20:44:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:44:21,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:21,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:22,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:22,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:44:22,218 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:22,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:22,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1192937808, now seen corresponding path program 1 times [2022-11-02 20:44:22,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:22,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750475379] [2022-11-02 20:44:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:22,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:25,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750475379] [2022-11-02 20:44:25,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750475379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673967554] [2022-11-02 20:44:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:25,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:25,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:25,587 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:25,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:44:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:25,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-02 20:44:25,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:25,781 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 20:44:25,920 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:44:25,920 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 20:44:26,054 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 20:44:26,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:26,351 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 21 [2022-11-02 20:44:26,357 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 6 treesize of output 5 [2022-11-02 20:44:26,707 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:44:26,707 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 66 treesize of output 63 [2022-11-02 20:44:26,712 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 31 treesize of output 21 [2022-11-02 20:44:26,716 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 34 treesize of output 36 [2022-11-02 20:44:27,125 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 20:44:27,129 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 23 treesize of output 11 [2022-11-02 20:44:27,183 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 22 treesize of output 10 [2022-11-02 20:44:27,246 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 20:44:27,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:27,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 86 treesize of output 64 [2022-11-02 20:44:27,771 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 86 treesize of output 64 [2022-11-02 20:44:27,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse1) (forall ((v_ArrVal_1661 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (<= .cse1 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-11-02 20:44:27,816 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1664 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1661 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-11-02 20:44:27,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1661 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (forall ((v_ArrVal_1664 (Array Int Int))) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|)))) is different from false [2022-11-02 20:44:27,868 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1661 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1664 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) .cse1)) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-11-02 20:44:27,885 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1661 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1664 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) .cse1))))) is different from false [2022-11-02 20:44:27,914 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 254 treesize of output 230 [2022-11-02 20:44:27,922 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 194 treesize of output 178 [2022-11-02 20:44:27,927 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 178 treesize of output 162 [2022-11-02 20:44:27,980 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-11-02 20:44:30,023 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse3 (select .cse2 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse3 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse3)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-11-02 20:44:32,052 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse1)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse3 (select .cse2 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) .cse3 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse3)))))))) is different from false [2022-11-02 20:44:34,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))))) is different from false [2022-11-02 20:44:36,147 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse1)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse3 (select .cse2 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse3 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse3)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))))) is different from false [2022-11-02 20:44:36,164 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 18 treesize of output 16 [2022-11-02 20:44:36,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:36,178 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-02 20:44:36,178 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 2 case distinctions, treesize of input 53 treesize of output 1 [2022-11-02 20:44:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-02 20:44:36,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673967554] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:36,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:36,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 27, 28] total 72 [2022-11-02 20:44:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209227521] [2022-11-02 20:44:36,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:36,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-02 20:44:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:36,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-02 20:44:36,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3627, Unknown=10, NotChecked=1290, Total=5112 [2022-11-02 20:44:36,538 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 72 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 72 states have internal predecessors, (141), 0 states have call successors, (0), 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 20:44:37,585 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select .cse0 .cse1))))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse1)))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) .cse2 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (or .cse2 (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse4 (select .cse3 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3) .cse4 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse4)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|)))))) is different from false [2022-11-02 20:44:39,590 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (or (not (= (select .cse0 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= (select .cse0 .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-02 20:44:41,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (or (not (= (select .cse0 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= (select .cse0 .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-02 20:44:41,645 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse1)))))) (or (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select .cse0 4)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse3 (select .cse2 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) .cse3 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse3)))))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select .cse0 .cse1))))) is different from false [2022-11-02 20:44:41,652 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int)) (not (= (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse3 (select .cse2 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse3 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse3)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 .cse1))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-11-02 20:44:42,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select .cse0 .cse1))))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) .cse1)))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) .cse2 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (or .cse2 (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660))) (let ((.cse4 (select .cse3 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3) .cse4 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse4)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|)))))) is different from false [2022-11-02 20:44:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:44,521 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-11-02 20:44:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-02 20:44:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 72 states have internal predecessors, (141), 0 states have call successors, (0), 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 55 [2022-11-02 20:44:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:44,523 INFO L225 Difference]: With dead ends: 78 [2022-11-02 20:44:44,523 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 20:44:44,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=569, Invalid=7135, Unknown=16, NotChecked=2992, Total=10712 [2022-11-02 20:44:44,526 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 228 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 686 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:44,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1072 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1455 Invalid, 0 Unknown, 686 Unchecked, 1.2s Time] [2022-11-02 20:44:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 20:44:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2022-11-02 20:44:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-11-02 20:44:44,529 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 55 [2022-11-02 20:44:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:44,538 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-11-02 20:44:44,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 72 states have internal predecessors, (141), 0 states have call successors, (0), 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 20:44:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-11-02 20:44:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:44:44,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:44,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:44,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:44,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:44,766 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341834, now seen corresponding path program 1 times [2022-11-02 20:44:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:44,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18680252] [2022-11-02 20:44:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 20:44:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:44,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18680252] [2022-11-02 20:44:44,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18680252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:44,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207127152] [2022-11-02 20:44:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:44,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:44,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:44,912 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:44,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:44:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:44:45,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:44:45,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:44:45,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207127152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:45,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:44:45,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2022-11-02 20:44:45,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960062474] [2022-11-02 20:44:45,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:45,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:45,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:45,225 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 20:44:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:45,358 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-11-02 20:44:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:44:45,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-02 20:44:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:45,359 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:44:45,359 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:44:45,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:44:45,360 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 144 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:45,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 107 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:44:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-02 20:44:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-11-02 20:44:45,363 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 59 [2022-11-02 20:44:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:45,364 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-11-02 20:44:45,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 20:44:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-11-02 20:44:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:44:45,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:45,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:45,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:45,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:44:45,586 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:45,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341833, now seen corresponding path program 1 times [2022-11-02 20:44:45,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:45,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059675328] [2022-11-02 20:44:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:44:45,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:45,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059675328] [2022-11-02 20:44:45,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059675328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:45,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:45,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:44:45,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261754448] [2022-11-02 20:44:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:45,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:44:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:44:45,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:44:45,929 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:46,238 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-11-02 20:44:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:44:46,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-02 20:44:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:46,239 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:44:46,239 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:44:46,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:44:46,241 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:46,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 52 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:44:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-02 20:44:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 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 20:44:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-11-02 20:44:46,253 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 59 [2022-11-02 20:44:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:46,254 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-11-02 20:44:46,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-11-02 20:44:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:44:46,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:46,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:46,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:44:46,255 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1658827190, now seen corresponding path program 1 times [2022-11-02 20:44:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:46,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348764336] [2022-11-02 20:44:46,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:44:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:46,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348764336] [2022-11-02 20:44:46,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348764336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:46,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:46,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:44:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155629894] [2022-11-02 20:44:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:46,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:44:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:46,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:44:46,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:44:46,407 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 20:44:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:46,602 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-11-02 20:44:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:44:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 60 [2022-11-02 20:44:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:46,603 INFO L225 Difference]: With dead ends: 77 [2022-11-02 20:44:46,603 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 20:44:46,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:44:46,604 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 265 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:46,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 81 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 20:44:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-02 20:44:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2022-11-02 20:44:46,607 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 60 [2022-11-02 20:44:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:46,607 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2022-11-02 20:44:46,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 20:44:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-11-02 20:44:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:44:46,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:46,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:44:46,609 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -698613301, now seen corresponding path program 1 times [2022-11-02 20:44:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723405938] [2022-11-02 20:44:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:46,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:44:46,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:46,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723405938] [2022-11-02 20:44:46,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723405938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:46,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:46,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:44:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599596160] [2022-11-02 20:44:46,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:46,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:44:46,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:46,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:44:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:44:46,806 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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 20:44:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:47,037 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-11-02 20:44:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:44:47,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-02 20:44:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:47,038 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:44:47,038 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:44:47,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:44:47,039 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:47,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:44:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-02 20:44:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 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 20:44:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-11-02 20:44:47,042 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 62 [2022-11-02 20:44:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:47,042 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-11-02 20:44:47,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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 20:44:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-11-02 20:44:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:44:47,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:47,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:47,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:44:47,043 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827867, now seen corresponding path program 1 times [2022-11-02 20:44:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:47,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751890117] [2022-11-02 20:44:47,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:47,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:44:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:48,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751890117] [2022-11-02 20:44:48,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751890117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:48,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188637091] [2022-11-02 20:44:48,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:48,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:48,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:48,586 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:48,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:44:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:48,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-02 20:44:48,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:48,804 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 20:44:48,862 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:44:48,863 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 20:44:48,995 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 20:44:49,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:44:49,220 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 20 treesize of output 19 [2022-11-02 20:44:49,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:44:49,403 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 28 treesize of output 29 [2022-11-02 20:44:49,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:49,618 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 20:44:49,835 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:44:49,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:44:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:44:49,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:50,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:50,134 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 31 treesize of output 35 [2022-11-02 20:44:50,158 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2036 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.base|))) is different from false [2022-11-02 20:44:50,175 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2036 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) (forall ((v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-11-02 20:44:50,186 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2036 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (forall ((v_prenex_3 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2022-11-02 20:44:50,204 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_2036 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (forall ((v_prenex_3 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2022-11-02 20:44:50,233 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_prenex_3)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2035)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2022-11-02 20:44:50,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))))) is different from false [2022-11-02 20:44:50,314 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse4) (select .cse4 .cse2) v_prenex_3)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))))) is different from false [2022-11-02 20:44:50,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) (select .cse4 .cse2) v_prenex_3)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) is different from false [2022-11-02 20:44:50,401 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4) (select .cse4 .cse2) v_prenex_3)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))))) is different from false [2022-11-02 20:44:50,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:50,418 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 2 case distinctions, treesize of input 51 treesize of output 49 [2022-11-02 20:44:50,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:50,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:44:50,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:50,430 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-02 20:44:50,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:44:50,440 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 32 treesize of output 30 [2022-11-02 20:44:50,450 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 5 treesize of output 3 [2022-11-02 20:44:50,459 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-02 20:44:50,460 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 2 case distinctions, treesize of input 38 treesize of output 1 [2022-11-02 20:44:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-11-02 20:44:50,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188637091] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:50,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:50,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 54 [2022-11-02 20:44:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049487810] [2022-11-02 20:44:50,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:50,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-02 20:44:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:50,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-02 20:44:50,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1941, Unknown=9, NotChecked=864, Total=2970 [2022-11-02 20:44:50,675 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 55 states, 54 states have (on average 2.5) internal successors, (135), 55 states have internal predecessors, (135), 0 states have call successors, (0), 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 20:44:51,125 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base| 0) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select .cse0 (select .cse4 .cse3)) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select (store |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base| 0) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (let ((.cse5 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5) (select .cse5 .cse3) v_prenex_3)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))))) is different from false [2022-11-02 20:44:53,129 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select .cse0 4)) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= (select (select (let ((.cse4 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) (select .cse4 .cse3) v_prenex_3)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-02 20:44:55,133 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select .cse0 4)) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= (select (select (let ((.cse4 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) (select .cse4 .cse3) v_prenex_3)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-02 20:44:55,166 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse4) (select .cse4 .cse2) v_prenex_3)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select .cse3 4)) 1))) is different from false [2022-11-02 20:44:55,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2035 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 .cse2) v_prenex_3)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select .cse3 4)) 1))) is different from false [2022-11-02 20:44:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:56,102 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-11-02 20:44:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:44:56,103 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5) internal successors, (135), 55 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-02 20:44:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:56,104 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:44:56,104 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:44:56,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=358, Invalid=3466, Unknown=14, NotChecked=1862, Total=5700 [2022-11-02 20:44:56,106 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 166 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 601 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:56,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 529 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 869 Invalid, 0 Unknown, 601 Unchecked, 0.6s Time] [2022-11-02 20:44:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:44:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2022-11-02 20:44:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-11-02 20:44:56,109 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2022-11-02 20:44:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:56,110 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-11-02 20:44:56,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5) internal successors, (135), 55 states have internal predecessors, (135), 0 states have call successors, (0), 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 20:44:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-11-02 20:44:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:44:56,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:56,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:56,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:56,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:56,326 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:44:56,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827868, now seen corresponding path program 1 times [2022-11-02 20:44:56,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:56,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956417365] [2022-11-02 20:44:56,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:56,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:44:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:59,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956417365] [2022-11-02 20:44:59,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956417365] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:59,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933013776] [2022-11-02 20:44:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:59,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:59,412 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:59,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:44:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:59,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-02 20:44:59,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:59,652 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 20:44:59,959 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:44:59,959 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 20:44:59,967 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 20:45:00,164 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 20:45:00,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, 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 20:45:00,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:00,583 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 20:45:00,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:00,589 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 20:45:00,946 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:45:00,947 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 42 treesize of output 41 [2022-11-02 20:45:00,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:00,955 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 20 treesize of output 22 [2022-11-02 20:45:01,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:01,440 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 20:45:01,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:01,452 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 20:45:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:45:01,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:02,271 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2022-11-02 20:45:02,292 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-11-02 20:45:02,305 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2022-11-02 20:45:02,327 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_2155 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2022-11-02 20:45:02,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2151)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2150)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2150)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2151)) .cse3 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))))) is different from false [2022-11-02 20:45:02,395 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse2) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse3 (select .cse4 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse3 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) .cse3 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 20:45:02,427 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse1 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) .cse1 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse3) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 20:45:02,461 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse2) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse3 (select .cse4 .cse2))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse3 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) .cse3 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))))))) is different from false [2022-11-02 20:45:02,530 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse1 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse3) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))))) is different from false [2022-11-02 20:45:02,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:02,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:02,554 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 75 treesize of output 81 [2022-11-02 20:45:02,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:02,564 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 2 case distinctions, treesize of input 62 treesize of output 60 [2022-11-02 20:45:02,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:02,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:02,576 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:02,577 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 2 case distinctions, treesize of input 36 treesize of output 40 [2022-11-02 20:45:02,588 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:02,588 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 54 treesize of output 52 [2022-11-02 20:45:02,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:02,601 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 84 treesize of output 78 [2022-11-02 20:45:02,607 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 66 treesize of output 62 [2022-11-02 20:45:02,616 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 32 treesize of output 28 [2022-11-02 20:45:02,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:02,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:02,672 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 39 treesize of output 45 [2022-11-02 20:45:02,678 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 26 treesize of output 24 [2022-11-02 20:45:02,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:02,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:02,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:02,688 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2022-11-02 20:45:09,717 WARN L234 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 27 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:45:16,301 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 50 treesize of output 46 [2022-11-02 20:45:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-11-02 20:45:16,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933013776] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:16,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:45:16,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25, 24] total 76 [2022-11-02 20:45:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283799651] [2022-11-02 20:45:16,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:16,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-02 20:45:16,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-02 20:45:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=4311, Unknown=9, NotChecked=1260, Total=5852 [2022-11-02 20:45:16,424 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 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 20:45:17,408 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse5 (select .cse4 .cse3)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse1 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))))) (<= (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select .cse0 .cse3) 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| .cse5)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse3) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-11-02 20:45:19,413 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (select .cse1 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse2) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse3 (select .cse4 .cse2))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse3 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) .cse3 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select .cse0 .cse2) 0) (<= 8 (select |c_#length| .cse5)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2022-11-02 20:45:21,420 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (select .cse1 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse2) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse3 (select .cse4 .cse2))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse3 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) .cse3 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))))))) (not (= .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select .cse0 .cse2) 0) (<= 8 (select |c_#length| .cse5)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2022-11-02 20:45:21,478 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse5 (select .cse4 4)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (and (= (select .cse0 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse1 (select .cse2 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse1 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) .cse1 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 8 (select |c_#length| .cse5)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse3) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|)))))) is different from false [2022-11-02 20:45:21,531 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse7 (select .cse3 4))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (<= 8 (select |c_#length| .cse7))) (.cse0 (= |c_ULTIMATE.start_main_~s~0#1.base| .cse7))) (and (not .cse0) .cse1 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) .cse4) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))) (= (select .cse2 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse6 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse5 (select .cse6 .cse4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse5 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse6) .cse5 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (or .cse1 .cse0))))) is different from false [2022-11-02 20:45:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:24,458 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2022-11-02 20:45:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-02 20:45:24,458 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-02 20:45:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:24,459 INFO L225 Difference]: With dead ends: 88 [2022-11-02 20:45:24,459 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 20:45:24,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=772, Invalid=8010, Unknown=16, NotChecked=2758, Total=11556 [2022-11-02 20:45:24,461 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 335 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:24,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 743 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1244 Invalid, 0 Unknown, 830 Unchecked, 1.0s Time] [2022-11-02 20:45:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 20:45:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-11-02 20:45:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 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 20:45:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-11-02 20:45:24,464 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 65 [2022-11-02 20:45:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:24,465 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-11-02 20:45:24,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 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 20:45:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-11-02 20:45:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:45:24,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:24,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 20:45:24,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:24,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:24,670 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:45:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1642891397, now seen corresponding path program 1 times [2022-11-02 20:45:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:24,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985611030] [2022-11-02 20:45:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:45:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985611030] [2022-11-02 20:45:25,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985611030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003623234] [2022-11-02 20:45:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:25,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:25,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:25,495 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:25,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 20:45:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-02 20:45:25,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:26,230 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 20:45:26,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:26,702 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 54 treesize of output 41 [2022-11-02 20:45:27,203 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:45:27,204 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 55 treesize of output 56 [2022-11-02 20:45:27,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:27,220 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-11-02 20:45:27,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:27,921 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 70 treesize of output 56 [2022-11-02 20:45:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:45:28,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:29,931 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|))) (= (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-02 20:45:29,956 WARN L833 $PredicateComparison]: unable to prove that (or (= (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_21| Int)) (or (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |v_ULTIMATE.start_main_~s~0#1.offset_21| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (not (<= |v_ULTIMATE.start_main_~s~0#1.offset_21| |c_ULTIMATE.start_sll_create_#res#1.offset|)) (< |v_ULTIMATE.start_main_~s~0#1.offset_21| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)))) is different from false [2022-11-02 20:45:29,992 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_21| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (< |v_ULTIMATE.start_main_~s~0#1.offset_21| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 (+ |v_ULTIMATE.start_main_~s~0#1.offset_21| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) (= (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-02 20:45:30,077 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_21| Int)) (or (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |v_ULTIMATE.start_main_~s~0#1.offset_21| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0)) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (< |v_ULTIMATE.start_main_~s~0#1.offset_21| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_21|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0))) is different from false [2022-11-02 20:45:30,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:30,103 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 2 case distinctions, treesize of input 38 treesize of output 38 [2022-11-02 20:45:30,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:30,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:30,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:30,149 INFO L356 Elim1Store]: treesize reduction 14, result has 70.8 percent of original size [2022-11-02 20:45:30,149 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 3 case distinctions, treesize of input 51 treesize of output 66 [2022-11-02 20:45:30,196 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-02 20:45:30,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 80 [2022-11-02 20:45:30,207 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 50 treesize of output 46 [2022-11-02 20:45:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 6 not checked. [2022-11-02 20:45:31,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003623234] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:31,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:45:31,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 25] total 65 [2022-11-02 20:45:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013933693] [2022-11-02 20:45:31,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:31,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-02 20:45:31,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:31,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-02 20:45:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3455, Unknown=18, NotChecked=484, Total=4160 [2022-11-02 20:45:31,430 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 65 states, 65 states have (on average 2.6769230769230767) internal successors, (174), 65 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:35,592 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2022-11-02 20:45:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-02 20:45:35,592 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.6769230769230767) internal successors, (174), 65 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-02 20:45:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:35,593 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:45:35,594 INFO L226 Difference]: Without dead ends: 133 [2022-11-02 20:45:35,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=473, Invalid=8060, Unknown=39, NotChecked=740, Total=9312 [2022-11-02 20:45:35,597 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:35,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1052 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 287 Unchecked, 0.1s Time] [2022-11-02 20:45:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-02 20:45:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 80. [2022-11-02 20:45:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.08) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-11-02 20:45:35,601 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 66 [2022-11-02 20:45:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:35,601 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-11-02 20:45:35,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.6769230769230767) internal successors, (174), 65 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-11-02 20:45:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:45:35,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:35,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:35,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:35,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-02 20:45:35,810 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:45:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1727882938, now seen corresponding path program 1 times [2022-11-02 20:45:35,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:35,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732256368] [2022-11-02 20:45:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:45:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:38,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732256368] [2022-11-02 20:45:38,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732256368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:38,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696786409] [2022-11-02 20:45:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:38,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:38,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:38,074 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:38,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 20:45:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:38,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:45:38,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:38,308 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 20:45:38,523 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:45:38,523 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 20:45:38,706 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 20:45:39,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:39,075 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 27 treesize of output 22 [2022-11-02 20:45:39,342 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:45:39,342 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 26 treesize of output 27 [2022-11-02 20:45:39,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:39,616 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 25 treesize of output 19 [2022-11-02 20:45:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:45:39,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:40,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:45:40,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:45:40,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:45:40,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:45:40,228 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (v_ArrVal_2381 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2379)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:45:40,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-11-02 20:45:40,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-11-02 20:45:40,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-11-02 20:45:40,299 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-11-02 20:45:40,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:40,322 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 2 case distinctions, treesize of input 37 treesize of output 37 [2022-11-02 20:45:40,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:40,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:45:40,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:40,339 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-02 20:45:40,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:40,352 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 32 treesize of output 30 [2022-11-02 20:45:40,368 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 5 treesize of output 3 [2022-11-02 20:45:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-11-02 20:45:40,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696786409] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:40,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:45:40,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 23] total 62 [2022-11-02 20:45:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059828921] [2022-11-02 20:45:40,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:40,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-02 20:45:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-02 20:45:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2711, Unknown=9, NotChecked=1008, Total=3906 [2022-11-02 20:45:40,843 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 63 states, 62 states have (on average 2.661290322580645) internal successors, (165), 63 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:42,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse1))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse2 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 .cse1) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (< .cse0 |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_#res#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-11-02 20:45:42,180 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse3 .cse2))) (and (< |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< .cse0 |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= (+ (select .cse3 4) 1) |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:45:42,186 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse3 .cse2))) (and (< .cse0 |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= (+ (select .cse3 4) 1) |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:45:42,276 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse2 (select .cse1 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= (+ 1 .cse2) |c_#StackHeapBarrier|) (< .cse2 |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:45:42,286 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse2 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (< .cse0 |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:45:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:44,499 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-11-02 20:45:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:45:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.661290322580645) internal successors, (165), 63 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-02 20:45:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:44,500 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:45:44,500 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:45:44,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=533, Invalid=5209, Unknown=14, NotChecked=2254, Total=8010 [2022-11-02 20:45:44,502 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 274 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:44,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 945 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1109 Invalid, 0 Unknown, 744 Unchecked, 1.0s Time] [2022-11-02 20:45:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:45:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-11-02 20:45:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 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 20:45:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-11-02 20:45:44,506 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 68 [2022-11-02 20:45:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:44,506 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-11-02 20:45:44,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.661290322580645) internal successors, (165), 63 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-11-02 20:45:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:45:44,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:44,508 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:44,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:44,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-02 20:45:44,726 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:45:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash -177401856, now seen corresponding path program 2 times [2022-11-02 20:45:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:44,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232955772] [2022-11-02 20:45:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:45:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:47,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232955772] [2022-11-02 20:45:47,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232955772] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:47,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822209038] [2022-11-02 20:45:47,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:45:47,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:47,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:47,779 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:47,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a75a6cb-0d8a-4da8-9297-d45f07a81795/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 20:45:48,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:45:48,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:48,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-02 20:45:48,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:48,240 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 20:45:48,249 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 20:45:48,361 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:45:48,361 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 20:45:48,453 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 20:45:48,464 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 20:45:48,481 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 20:45:48,490 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 20:45:48,661 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 20:45:48,666 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 20:45:49,159 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 20:45:49,159 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2022-11-02 20:45:49,190 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-02 20:45:49,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 43 [2022-11-02 20:45:50,045 INFO L356 Elim1Store]: treesize reduction 100, result has 47.1 percent of original size [2022-11-02 20:45:50,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 154 [2022-11-02 20:45:50,235 INFO L356 Elim1Store]: treesize reduction 92, result has 51.3 percent of original size [2022-11-02 20:45:50,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 136 [2022-11-02 20:46:02,079 INFO L356 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-02 20:46:02,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2022-11-02 20:46:02,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:46:02,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2022-11-02 20:46:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:46:02,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:14,442 WARN L234 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:46:36,705 WARN L234 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)