./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/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_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/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_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- 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:56:56,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:56:56,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:56:56,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:56:56,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:56:56,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:56:56,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:56:56,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:56:56,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:56:56,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:56:56,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:56:56,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:56:56,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:56:56,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:56:56,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:56:56,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:56:56,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:56:56,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:56:56,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:56:56,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:56:56,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:56:56,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:56:56,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:56:56,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:56:56,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:56:56,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:56:56,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:56:56,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:56:56,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:56:56,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:56:56,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:56:56,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:56:56,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:56:56,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:56:56,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:56:56,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:56:56,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:56:56,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:56:56,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:56:56,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:56:56,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:56:56,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:56:56,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:56:56,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:56:56,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:56:56,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:56:56,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:56:56,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:56:56,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:56:56,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:56:56,991 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:56:56,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:56:56,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:56:56,993 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:56:56,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:56:56,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:56:56,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:56:56,993 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:56:56,994 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:56:56,994 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:56:56,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:56:56,994 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:56:56,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:56:56,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:56:56,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:56:56,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:56:56,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:56:56,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:56,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:56:56,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:56:56,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:56:56,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:56:56,996 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_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/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_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-02 20:56:57,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:56:57,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:56:57,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:56:57,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:56:57,392 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:56:57,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-02 20:56:57,480 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/data/c745f6b95/27f9de3046ee47878cba00e04c9fefc6/FLAG0b591b56c [2022-11-02 20:56:58,128 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:56:58,128 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-02 20:56:58,143 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/data/c745f6b95/27f9de3046ee47878cba00e04c9fefc6/FLAG0b591b56c [2022-11-02 20:56:58,398 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/data/c745f6b95/27f9de3046ee47878cba00e04c9fefc6 [2022-11-02 20:56:58,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:56:58,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:56:58,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:58,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:56:58,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:56:58,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:58,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b5a34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58, skipping insertion in model container [2022-11-02 20:56:58,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:58,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:56:58,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:56:58,839 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_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-02 20:56:58,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:58,867 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:56:58,946 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_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-02 20:56:58,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:58,986 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:56:58,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58 WrapperNode [2022-11-02 20:56:58,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:58,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:58,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:56:58,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:56:58,999 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:56:58" (1/1) ... [2022-11-02 20:56:59,036 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:56:58" (1/1) ... [2022-11-02 20:56:59,072 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-11-02 20:56:59,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:59,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:56:59,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:56:59,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:56:59,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,099 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:56:59,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:56:59,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:56:59,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:56:59,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (1/1) ... [2022-11-02 20:56:59,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:59,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:59,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:56:59,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:56:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:56:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:56:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:56:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:56:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:56:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:56:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:56:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:56:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:56:59,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:56:59,423 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:56:59,425 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:56:59,874 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:56:59,889 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:56:59,890 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:56:59,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:59 BoogieIcfgContainer [2022-11-02 20:56:59,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:56:59,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:56:59,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:56:59,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:56:59,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:56:58" (1/3) ... [2022-11-02 20:56:59,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1525f9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:59, skipping insertion in model container [2022-11-02 20:56:59,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:58" (2/3) ... [2022-11-02 20:56:59,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1525f9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:59, skipping insertion in model container [2022-11-02 20:56:59,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:59" (3/3) ... [2022-11-02 20:56:59,903 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-02 20:56:59,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:56:59,925 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-02 20:57:00,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:00,020 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;@7006ae74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:00,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-02 20:57:00,028 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:57:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:57:00,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:00,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:57:00,039 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:57:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:00,057 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-11-02 20:57:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645120597] [2022-11-02 20:57:00,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:00,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,292 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:57:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:00,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645120597] [2022-11-02 20:57:00,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645120597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:00,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:00,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:00,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427817263] [2022-11-02 20:57:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:00,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:00,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:00,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:00,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:00,368 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:57:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:00,522 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-02 20:57:00,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:00,526 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:57:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:00,536 INFO L225 Difference]: With dead ends: 109 [2022-11-02 20:57:00,537 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 20:57:00,538 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:57:00,543 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:57:00,545 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:57:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 20:57:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-02 20:57:00,591 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:57:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-02 20:57:00,596 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-11-02 20:57:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:00,597 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-02 20:57:00,597 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:57:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-02 20:57:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:57:00,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:00,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:57:00,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:57:00,598 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:57:00,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-11-02 20:57:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:00,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095474488] [2022-11-02 20:57:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,719 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:57:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:00,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095474488] [2022-11-02 20:57:00,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095474488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:00,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:00,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087508314] [2022-11-02 20:57:00,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:00,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:00,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:00,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:00,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:00,723 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:57:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:00,786 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-02 20:57:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:00,786 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:57:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:00,788 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:57:00,788 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:57:00,788 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:57:00,790 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:57:00,790 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:57:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:57:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-11-02 20:57:00,797 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:57:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-02 20:57:00,798 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-11-02 20:57:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:00,799 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-02 20:57:00,799 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:57:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-02 20:57:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:57:00,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:00,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:00,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:57:00,801 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:57:00,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-11-02 20:57:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:00,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718904253] [2022-11-02 20:57:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:00,888 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:57:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:00,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718904253] [2022-11-02 20:57:00,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718904253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:00,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:00,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396878160] [2022-11-02 20:57:00,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:00,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:00,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:00,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:00,891 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:57:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:00,911 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-02 20:57:00,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:00,916 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:57:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:00,917 INFO L225 Difference]: With dead ends: 68 [2022-11-02 20:57:00,917 INFO L226 Difference]: Without dead ends: 68 [2022-11-02 20:57:00,918 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:57:00,919 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:57:00,920 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:57:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-02 20:57:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-02 20:57:00,925 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:57:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-02 20:57:00,926 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-11-02 20:57:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:00,927 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-02 20:57:00,927 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:57:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-02 20:57:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:57:00,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:00,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:00,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:57:00,928 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:57:00,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-11-02 20:57:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:00,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965430373] [2022-11-02 20:57:00,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:01,085 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:57:01,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:01,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965430373] [2022-11-02 20:57:01,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965430373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:01,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:01,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:57:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359758003] [2022-11-02 20:57:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:01,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:01,089 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:57:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:01,209 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-02 20:57:01,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:01,211 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:57:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:01,212 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:57:01,212 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:57:01,213 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:57:01,214 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:57:01,214 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:57:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:57:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-02 20:57:01,218 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:57:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-02 20:57:01,219 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-11-02 20:57:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:01,220 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-02 20:57:01,220 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:57:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-02 20:57:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:57:01,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:01,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:01,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:57:01,221 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:57:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-11-02 20:57:01,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:01,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569018502] [2022-11-02 20:57:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:01,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:01,526 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:57:01,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:01,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569018502] [2022-11-02 20:57:01,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569018502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:01,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:01,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:57:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854794291] [2022-11-02 20:57:01,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:01,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:01,532 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:57:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:01,640 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-02 20:57:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:01,641 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:57:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:01,643 INFO L225 Difference]: With dead ends: 61 [2022-11-02 20:57:01,644 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 20:57:01,645 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:57:01,652 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:57:01,652 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:57:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 20:57:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-02 20:57:01,660 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:57:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-02 20:57:01,661 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-11-02 20:57:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:01,661 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-02 20:57:01,662 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:57:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-02 20:57:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:57:01,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:01,663 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:57:01,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:57:01,663 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:57:01,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-11-02 20:57:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:01,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366973707] [2022-11-02 20:57:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:01,754 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:57:01,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:01,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366973707] [2022-11-02 20:57:01,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366973707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:01,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833499377] [2022-11-02 20:57:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:01,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:01,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:01,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:01,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:57:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:01,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:57:01,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:01,932 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:57:01,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:01,973 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:57:01,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833499377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:01,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:01,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 20:57:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59549986] [2022-11-02 20:57:01,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:01,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:01,976 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:57:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:01,991 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-02 20:57:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:57:01,991 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:57:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:01,992 INFO L225 Difference]: With dead ends: 65 [2022-11-02 20:57:01,992 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:57:01,993 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:57:01,994 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:57:01,994 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:57:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:57:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-02 20:57:01,998 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:57:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-02 20:57:01,999 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-11-02 20:57:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:01,999 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-02 20:57:02,000 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:57:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-02 20:57:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:57:02,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:02,001 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:57:02,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:57:02,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:02,228 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:57:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-11-02 20:57:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:02,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489748606] [2022-11-02 20:57:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:02,461 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:57:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489748606] [2022-11-02 20:57:02,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489748606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:02,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:02,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:57:02,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951080307] [2022-11-02 20:57:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:02,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:57:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:57:02,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:02,466 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:57:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:02,803 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-02 20:57:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:57:02,805 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:57:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:02,806 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:57:02,806 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:57:02,809 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:57:02,810 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:57:02,811 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:57:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:57:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-11-02 20:57:02,826 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:57:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-02 20:57:02,826 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-11-02 20:57:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:02,827 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-02 20:57:02,827 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:57:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-02 20:57:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:57:02,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:02,828 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:57:02,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:57:02,829 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:57:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-11-02 20:57:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:02,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459906383] [2022-11-02 20:57:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,052 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:57:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:03,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459906383] [2022-11-02 20:57:03,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459906383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:03,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966219907] [2022-11-02 20:57:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:03,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:03,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:03,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:57:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:57:03,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:03,277 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:57:03,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:57:03,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966219907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:03,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:57:03,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-02 20:57:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347206032] [2022-11-02 20:57:03,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:03,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:03,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:03,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:03,289 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:57:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:03,358 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-11-02 20:57:03,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:03,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:57:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:03,360 INFO L225 Difference]: With dead ends: 96 [2022-11-02 20:57:03,360 INFO L226 Difference]: Without dead ends: 96 [2022-11-02 20:57:03,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:03,364 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 105 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:03,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 151 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-02 20:57:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-02 20:57:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-02 20:57:03,375 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2022-11-02 20:57:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:03,375 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-02 20:57:03,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:57:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-02 20:57:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:57:03,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:03,377 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:57:03,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:03,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:57:03,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2022-11-02 20:57:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:03,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375361729] [2022-11-02 20:57:03,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:03,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:04,070 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:57:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375361729] [2022-11-02 20:57:04,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375361729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:04,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:04,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:57:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585256613] [2022-11-02 20:57:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:04,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:57:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:57:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:04,072 INFO L87 Difference]: Start difference. First operand 71 states and 79 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:57:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:04,404 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-11-02 20:57:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:57:04,405 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:57:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:04,406 INFO L225 Difference]: With dead ends: 107 [2022-11-02 20:57:04,406 INFO L226 Difference]: Without dead ends: 107 [2022-11-02 20:57:04,406 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:57:04,407 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 365 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:04,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 106 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-02 20:57:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2022-11-02 20:57:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 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:57:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-02 20:57:04,411 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2022-11-02 20:57:04,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:04,411 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-02 20:57:04,411 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:57:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-02 20:57:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:57:04,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:04,412 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:57:04,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:57:04,412 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-11-02 20:57:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:04,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100244864] [2022-11-02 20:57:04,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:05,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100244864] [2022-11-02 20:57:05,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100244864] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:05,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758899987] [2022-11-02 20:57:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:05,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:05,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:05,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:05,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:57:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:05,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 20:57:05,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:05,559 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:57:05,629 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:57:05,630 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:57:05,784 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:57:06,024 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:57:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:06,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:06,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758899987] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:06,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:06,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-11-02 20:57:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128338536] [2022-11-02 20:57:06,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:06,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:57:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:06,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:57:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 20:57:06,388 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 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:57:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:07,900 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-02 20:57:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:57:07,901 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 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 29 [2022-11-02 20:57:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:07,903 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:57:07,903 INFO L226 Difference]: Without dead ends: 105 [2022-11-02 20:57:07,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 20:57:07,906 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 789 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:07,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 491 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:57:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-02 20:57:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2022-11-02 20:57:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:57:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-02 20:57:07,911 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2022-11-02 20:57:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:07,911 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-02 20:57:07,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 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:57:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-02 20:57:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:57:07,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:07,913 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:57:07,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:57:08,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2022-11-02 20:57:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:08,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750670808] [2022-11-02 20:57:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:09,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:09,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750670808] [2022-11-02 20:57:09,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750670808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:09,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334309226] [2022-11-02 20:57:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:09,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:09,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:09,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:09,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:57:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:09,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-02 20:57:09,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:09,262 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:57:09,520 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:57:09,520 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:57:09,531 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 14 treesize of output 16 [2022-11-02 20:57:09,708 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:57:09,722 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:57:10,162 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:57:10,177 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:57:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:10,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:19,781 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:57:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:19,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334309226] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:19,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:19,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 43 [2022-11-02 20:57:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761440014] [2022-11-02 20:57:19,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:19,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:57:19,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:19,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:57:19,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2022-11-02 20:57:19,919 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 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:57:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:26,010 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2022-11-02 20:57:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:57:26,011 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 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) Word has length 29 [2022-11-02 20:57:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:26,014 INFO L225 Difference]: With dead ends: 213 [2022-11-02 20:57:26,014 INFO L226 Difference]: Without dead ends: 213 [2022-11-02 20:57:26,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=818, Invalid=3738, Unknown=0, NotChecked=0, Total=4556 [2022-11-02 20:57:26,017 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2835 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2835 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:26,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2835 Valid, 904 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1109 Invalid, 0 Unknown, 110 Unchecked, 1.3s Time] [2022-11-02 20:57:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-02 20:57:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2022-11-02 20:57:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:57:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-11-02 20:57:26,023 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2022-11-02 20:57:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:26,023 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-11-02 20:57:26,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 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:57:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-11-02 20:57:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:57:26,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:26,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:26,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:26,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:26,240 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2022-11-02 20:57:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:26,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372834327] [2022-11-02 20:57:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,434 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:57:26,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:26,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372834327] [2022-11-02 20:57:26,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372834327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:26,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125739944] [2022-11-02 20:57:26,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:57:26,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:26,440 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:26,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:57:26,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:57:26,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:57:26,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:57:26,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:57:26,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:57:26,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125739944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:26,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:57:26,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-02 20:57:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854268711] [2022-11-02 20:57:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:26,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:26,667 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:26,725 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-02 20:57:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:57:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:26,726 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:57:26,726 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:57:26,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:57:26,728 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:26,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 73 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:57:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 20:57:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 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:57:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-02 20:57:26,732 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2022-11-02 20:57:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:26,733 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-02 20:57:26,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-02 20:57:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:57:26,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:26,739 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, 1, 1, 1] [2022-11-02 20:57:26,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:26,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:26,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2022-11-02 20:57:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:26,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481312552] [2022-11-02 20:57:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:57:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:27,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481312552] [2022-11-02 20:57:27,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481312552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:27,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:27,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:57:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343835874] [2022-11-02 20:57:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:27,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:57:27,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:27,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:57:27,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:27,144 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:27,415 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-02 20:57:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:57:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:57:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:27,417 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:57:27,417 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:57:27,417 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:57:27,418 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 337 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:27,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 109 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:57:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2022-11-02 20:57:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 72 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:57:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-11-02 20:57:27,421 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2022-11-02 20:57:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:27,421 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-11-02 20:57:27,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-11-02 20:57:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:57:27,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:27,424 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, 1, 1, 1] [2022-11-02 20:57:27,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:57:27,425 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2022-11-02 20:57:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:27,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074040106] [2022-11-02 20:57:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:57:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:27,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074040106] [2022-11-02 20:57:27,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074040106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:27,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379901300] [2022-11-02 20:57:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:27,576 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:27,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:57:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:27,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:57:27,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:57:27,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:57:27,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379901300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:27,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:27,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-02 20:57:27,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332653470] [2022-11-02 20:57:27,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:27,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:27,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:27,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:27,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:27,876 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:27,945 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-11-02 20:57:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:27,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:57:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:27,946 INFO L225 Difference]: With dead ends: 95 [2022-11-02 20:57:27,946 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:57:27,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:57:27,947 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:27,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 167 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:57:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-11-02 20:57:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 88 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:57:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2022-11-02 20:57:27,952 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2022-11-02 20:57:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:27,952 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2022-11-02 20:57:27,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-11-02 20:57:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:57:27,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:27,954 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:57:28,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:28,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:28,172 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:57:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2022-11-02 20:57:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:28,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773728619] [2022-11-02 20:57:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:57:28,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:28,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773728619] [2022-11-02 20:57:28,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773728619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:28,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185093262] [2022-11-02 20:57:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:28,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:28,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:28,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:28,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:57:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:28,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:57:28,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:28,630 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:57:28,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:28,724 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:57:28,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185093262] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:28,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:28,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-02 20:57:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982623390] [2022-11-02 20:57:28,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:28,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:28,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:28,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:28,727 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:57:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:28,808 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-02 20:57:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:57:28,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 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:57:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:28,809 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:57:28,809 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:57:28,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:57:28,812 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 141 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:28,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 165 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:57:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-11-02 20:57:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:57:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-11-02 20:57:28,817 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2022-11-02 20:57:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:28,817 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-11-02 20:57:28,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:57:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-11-02 20:57:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:57:28,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:28,820 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:57:28,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:29,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:57:29,040 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:57:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2022-11-02 20:57:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:29,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304057193] [2022-11-02 20:57:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:57:29,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:29,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304057193] [2022-11-02 20:57:29,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304057193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:29,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277589014] [2022-11-02 20:57:29,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:57:29,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:29,206 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:29,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:57:29,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 20:57:29,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:57:29,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:57:29,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:57:29,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:57:29,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277589014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:29,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:57:29,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-02 20:57:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776927808] [2022-11-02 20:57:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:29,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:29,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:29,433 INFO L87 Difference]: Start difference. First operand 84 states and 100 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:57:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:29,494 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-02 20:57:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:29,495 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 41 [2022-11-02 20:57:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:29,495 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:57:29,496 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:57:29,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:29,497 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:29,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 136 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:57:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-11-02 20:57:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:57:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-11-02 20:57:29,503 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2022-11-02 20:57:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:29,503 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-11-02 20:57:29,503 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:57:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-11-02 20:57:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:57:29,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:29,506 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:57:29,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:29,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:57:29,720 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2022-11-02 20:57:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:29,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726493863] [2022-11-02 20:57:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:30,239 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:57:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:30,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726493863] [2022-11-02 20:57:30,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726493863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:30,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:30,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:57:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745797010] [2022-11-02 20:57:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:30,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:57:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:57:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:30,241 INFO L87 Difference]: Start difference. First operand 83 states and 97 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:57:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:30,573 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-11-02 20:57:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:57:30,574 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:57:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:30,575 INFO L225 Difference]: With dead ends: 107 [2022-11-02 20:57:30,575 INFO L226 Difference]: Without dead ends: 107 [2022-11-02 20:57:30,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:57:30,576 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 413 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:30,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 80 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-02 20:57:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2022-11-02 20:57:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 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:57:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-02 20:57:30,579 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2022-11-02 20:57:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:30,579 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-02 20:57:30,579 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:57:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-02 20:57:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:57:30,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:30,580 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:57:30,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:57:30,581 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:30,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2022-11-02 20:57:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:30,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759769741] [2022-11-02 20:57:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:57:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:32,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759769741] [2022-11-02 20:57:32,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759769741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:32,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726897026] [2022-11-02 20:57:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:32,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:32,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:32,128 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:32,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:57:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:32,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-02 20:57:32,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:32,386 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:57:32,448 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:57:32,448 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:57:32,557 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:57:32,880 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:32,880 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:57:33,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:33,032 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 33 treesize of output 26 [2022-11-02 20:57:33,128 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:57:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:57:33,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:38,777 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-02 20:57:38,778 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:57:38,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (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_976) |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:57:38,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (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_976) |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:57:38,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (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_976) |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:57:38,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (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))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2022-11-02 20:57:38,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2022-11-02 20:57:38,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) is different from false [2022-11-02 20:57:38,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)))) is different from false [2022-11-02 20:57:38,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:38,860 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 22 treesize of output 23 [2022-11-02 20:57:38,864 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:57:38,868 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:57:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-11-02 20:57:39,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726897026] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:39,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:39,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2022-11-02 20:57:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900153380] [2022-11-02 20:57:39,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:39,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:57:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:57:39,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1690, Unknown=7, NotChecked=616, Total=2450 [2022-11-02 20:57:39,057 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:57:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:41,774 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-11-02 20:57:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:57:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 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:57:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:41,776 INFO L225 Difference]: With dead ends: 136 [2022-11-02 20:57:41,776 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 20:57:41,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=617, Invalid=3826, Unknown=7, NotChecked=952, Total=5402 [2022-11-02 20:57:41,779 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 577 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 634 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:41,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 961 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1010 Invalid, 0 Unknown, 634 Unchecked, 0.9s Time] [2022-11-02 20:57:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 20:57:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2022-11-02 20:57:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 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:57:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-11-02 20:57:41,799 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2022-11-02 20:57:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:41,800 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-11-02 20:57:41,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.183673469387755) internal successors, (107), 50 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:57:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-11-02 20:57:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:57:41,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:41,803 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:57:41,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:42,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:57:42,028 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:57:42,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2022-11-02 20:57:42,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:42,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954623232] [2022-11-02 20:57:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:57:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954623232] [2022-11-02 20:57:43,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954623232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:43,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135994348] [2022-11-02 20:57:43,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:43,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:43,808 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:43,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:57:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:44,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-02 20:57:44,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:44,034 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:57:44,230 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:57:44,230 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:57:44,371 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:57:44,378 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:57:44,831 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:44,832 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:57:44,837 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:57:45,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:45,029 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:57:45,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:45,040 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:57:45,177 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:57:45,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, 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:57:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:57:45,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:47,723 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_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (forall ((v_ArrVal_1093 Int)) (<= 0 (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (forall ((v_ArrVal_1091 Int) (v_ArrVal_1093 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .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_22| v_ArrVal_1091) .cse1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))))) is different from false [2022-11-02 20:57:47,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:47,826 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 64 treesize of output 68 [2022-11-02 20:57:47,930 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (< (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse0) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_4) .cse0)))))) is different from false [2022-11-02 20:57:48,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (or (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_4) .cse0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (< (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse0) (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1)))))) is different from false [2022-11-02 20:57:48,060 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse1)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (< (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1)))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_4) .cse1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2)))))) is different from false [2022-11-02 20:57:48,130 WARN L833 $PredicateComparison]: unable to prove that (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))) (and (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_2 v_prenex_4) .cse1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_2))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (or (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|)))))) is different from false [2022-11-02 20:57:48,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (or (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse1) .cse0) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 1)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| v_prenex_2) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_sll_create_#res#1.base|) v_prenex_2 v_prenex_4) .cse1))))))) is different from false [2022-11-02 20:57:48,212 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse1)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (< (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 1)))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_prenex_2) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_prenex_2 v_prenex_4) .cse1))))))) is different from false [2022-11-02 20:57:48,304 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse1)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1093 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) 1)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_prenex_2) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_4) .cse1))))))) is different from false [2022-11-02 20:57:48,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:48,332 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 90 treesize of output 81 [2022-11-02 20:57:48,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:48,343 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 76 treesize of output 77 [2022-11-02 20:57:48,355 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 93 treesize of output 89 [2022-11-02 20:57:48,362 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 131 treesize of output 121 [2022-11-02 20:57:48,370 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 126 treesize of output 122 [2022-11-02 20:57:48,380 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 151 treesize of output 135 [2022-11-02 20:57:48,404 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 140 treesize of output 136 [2022-11-02 20:57:48,421 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 150 treesize of output 146 [2022-11-02 20:57:48,430 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 169 treesize of output 161 [2022-11-02 20:57:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-02 20:57:48,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135994348] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:48,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:48,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 55 [2022-11-02 20:57:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878296517] [2022-11-02 20:57:48,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:48,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 20:57:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:48,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 20:57:48,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2115, Unknown=8, NotChecked=792, Total=3080 [2022-11-02 20:57:48,977 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:58:03,144 WARN L234 SmtUtils]: Spent 11.01s on a formula simplification. DAG size of input: 74 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:58:14,235 WARN L234 SmtUtils]: Spent 10.88s on a formula simplification. DAG size of input: 62 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:58:16,239 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select .cse4 .cse3))) (and (<= (+ 4 .cse0) (select |c_#length| .cse1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|) (forall ((v_ArrVal_1093 Int)) (<= 0 (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse3))))) (<= 8 (select |c_#length| (select .cse4 4))) (= (select .cse2 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_22| Int)) (or (forall ((v_ArrVal_1091 Int) (v_ArrVal_1093 Int)) (<= (+ (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1093) .cse3) 4) (select |c_#length| (select (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_22| v_ArrVal_1091) .cse3)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_22|))) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1))))) is different from false [2022-11-02 20:58:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:17,210 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2022-11-02 20:58:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:58:17,210 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 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:58:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:17,211 INFO L225 Difference]: With dead ends: 151 [2022-11-02 20:58:17,212 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:58:17,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=644, Invalid=4494, Unknown=10, NotChecked=1332, Total=6480 [2022-11-02 20:58:17,214 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 547 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1068 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:17,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1487 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1089 Invalid, 0 Unknown, 1068 Unchecked, 1.0s Time] [2022-11-02 20:58:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:58:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 90. [2022-11-02 20:58:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-11-02 20:58:17,218 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2022-11-02 20:58:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:17,218 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-11-02 20:58:17,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 56 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:58:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-11-02 20:58:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:58:17,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:17,220 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:58:17,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:17,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:17,428 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2022-11-02 20:58:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:17,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127341181] [2022-11-02 20:58:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:17,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:58:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:17,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127341181] [2022-11-02 20:58:17,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127341181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:17,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592866520] [2022-11-02 20:58:17,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:58:17,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:17,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:17,608 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:17,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:58:17,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:58:17,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:58:17,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:58:17,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:58:17,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:17,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592866520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:17,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:17,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-02 20:58:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355039504] [2022-11-02 20:58:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:17,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:17,921 INFO L87 Difference]: Start difference. First operand 90 states and 103 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:58:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:17,983 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-02 20:58:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:17,984 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 47 [2022-11-02 20:58:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:17,985 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:58:17,987 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:58:17,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:17,990 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 85 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:17,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 93 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:58:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-02 20:58:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-02 20:58:17,998 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2022-11-02 20:58:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:17,999 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-02 20:58:17,999 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:58:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-02 20:58:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:58:18,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:18,000 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, 1, 1, 1] [2022-11-02 20:58:18,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:18,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-02 20:58:18,224 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2022-11-02 20:58:18,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:18,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929633186] [2022-11-02 20:58:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:20,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929633186] [2022-11-02 20:58:20,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929633186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:20,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594738462] [2022-11-02 20:58:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:20,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:20,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:20,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:20,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:58:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:20,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-02 20:58:20,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:20,951 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:58:21,065 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:58:21,065 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:58:21,203 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:58:21,209 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:58:21,676 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:21,677 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 68 treesize of output 65 [2022-11-02 20:58:21,685 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 33 treesize of output 23 [2022-11-02 20:58:21,690 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 36 treesize of output 38 [2022-11-02 20:58:21,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:21,894 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 45 treesize of output 38 [2022-11-02 20:58:21,904 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 30 treesize of output 32 [2022-11-02 20:58:21,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:21,914 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 35 treesize of output 34 [2022-11-02 20:58:22,168 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 71 treesize of output 47 [2022-11-02 20:58:22,180 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 49 treesize of output 31 [2022-11-02 20:58:22,370 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 23 [2022-11-02 20:58:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:58:22,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:23,006 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1312) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1310)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) 1) .cse3)) (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= .cse3 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1312) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1310)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) 1))))) is different from false [2022-11-02 20:58:23,053 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2)) 1) .cse0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))))) is different from false [2022-11-02 20:58:23,125 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:23,126 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 46 treesize of output 47 [2022-11-02 20:58:23,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:23,140 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 98 treesize of output 101 [2022-11-02 20:58:23,149 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 37 treesize of output 23 [2022-11-02 20:58:23,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:23,224 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 46 treesize of output 47 [2022-11-02 20:58:23,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:23,240 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 98 treesize of output 101 [2022-11-02 20:58:23,250 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 37 treesize of output 23 [2022-11-02 20:58:23,331 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |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_25|))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-02 20:58:23,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-02 20:58:23,484 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) (select (store (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4) |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_25|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-02 20:58:23,575 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |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|) .cse2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-02 20:58:23,614 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) |c_ULTIMATE.start_sll_create_#res#1.base|))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) .cse0)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-02 20:58:23,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-02 20:58:23,772 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-02 20:58:23,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:23,798 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 15 treesize of output 11 [2022-11-02 20:58:23,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:23,803 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 16 treesize of output 12 [2022-11-02 20:58:23,814 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:58:23,815 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 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-02 20:58:23,822 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:58:23,823 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 1 case distinctions, treesize of input 26 treesize of output 1 [2022-11-02 20:58:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-02 20:58:24,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594738462] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:24,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:24,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 26] total 68 [2022-11-02 20:58:24,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251370143] [2022-11-02 20:58:24,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:24,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-02 20:58:24,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:24,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-02 20:58:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3250, Unknown=9, NotChecked=1098, Total=4556 [2022-11-02 20:58:24,052 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 68 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:58:25,729 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (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|)) (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) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) (= |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_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-11-02 20:58:26,581 WARN L833 $PredicateComparison]: unable to prove that (let ((.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 ((.cse0 (select .cse2 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select .cse2 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:58:27,428 WARN L833 $PredicateComparison]: unable to prove that (let ((.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 ((.cse0 (select .cse2 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= (select .cse2 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:58:28,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse2 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) |c_ULTIMATE.start_sll_create_#res#1.base|))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) .cse0)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select .cse2 4))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-02 20:58:28,950 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse3)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse1 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-02 20:58:29,738 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse3)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse5))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (not (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse5) |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_25|))) (<= .cse2 .cse1) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse4 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse5))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-02 20:58:30,624 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))))) (<= .cse2 .cse3) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (not (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse3 .cse2) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) is different from false [2022-11-02 20:58:31,576 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .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_25|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.offset|) (<= .cse2 .cse3) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse3 .cse2) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-11-02 20:58:32,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (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|)) (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) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) (= |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_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-11-02 20:58:32,414 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (select .cse2 4)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3)) (select (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse3)) (select (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse3)) 1) .cse1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_int| .cse5) (select .cse4 4)) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-02 20:58:32,421 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse4 (select .cse1 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse5 (+ (select (select |c_#memory_int| .cse4) (select .cse3 4)) 1)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (<= .cse0 .cse5) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1310 Int) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1313 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1312) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2)) 1) .cse0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse5 .cse0))))) is different from false [2022-11-02 20:58:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:34,066 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-11-02 20:58:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-02 20:58:34,066 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-02 20:58:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:34,067 INFO L225 Difference]: With dead ends: 85 [2022-11-02 20:58:34,068 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:58:34,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=489, Invalid=5577, Unknown=20, NotChecked=3420, Total=9506 [2022-11-02 20:58:34,071 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 138 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:34,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 858 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1160 Invalid, 0 Unknown, 512 Unchecked, 1.0s Time] [2022-11-02 20:58:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:58:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-11-02 20:58:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-02 20:58:34,075 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2022-11-02 20:58:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:34,076 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-02 20:58:34,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 68 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:58:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-02 20:58:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:58:34,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:34,077 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:58:34,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:34,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:34,292 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2022-11-02 20:58:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:34,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348794600] [2022-11-02 20:58:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:58:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:35,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348794600] [2022-11-02 20:58:35,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348794600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:35,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739200390] [2022-11-02 20:58:35,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:35,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:35,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:35,106 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:35,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:58:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 20:58:35,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:35,847 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 15 treesize of output 11 [2022-11-02 20:58:36,221 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:58:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:58:36,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:36,504 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 32 [2022-11-02 20:58:36,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:36,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:58:36,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739200390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:36,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:36,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 12] total 34 [2022-11-02 20:58:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035099339] [2022-11-02 20:58:36,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:36,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:58:36,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:58:36,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:58:36,711 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 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:58:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:38,465 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-02 20:58:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:58:38,468 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 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) Word has length 55 [2022-11-02 20:58:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:38,469 INFO L225 Difference]: With dead ends: 99 [2022-11-02 20:58:38,469 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 20:58:38,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2022-11-02 20:58:38,471 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 751 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:38,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 552 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:58:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 20:58:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-11-02 20:58:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-02 20:58:38,477 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2022-11-02 20:58:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:38,477 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-02 20:58:38,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 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:58:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-02 20:58:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:58:38,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:38,478 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] [2022-11-02 20:58:38,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:38,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:38,694 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2022-11-02 20:58:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:38,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042333700] [2022-11-02 20:58:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:58:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042333700] [2022-11-02 20:58:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042333700] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972002348] [2022-11-02 20:58:38,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:58:38,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:38,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:38,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:38,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:58:39,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:58:39,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:58:39,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:58:39,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:58:39,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:58:39,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972002348] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:39,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:39,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-02 20:58:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315007747] [2022-11-02 20:58:39,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:39,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:58:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:58:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:39,418 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:39,515 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-11-02 20:58:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:58:39,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-02 20:58:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:39,516 INFO L225 Difference]: With dead ends: 71 [2022-11-02 20:58:39,516 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 20:58:39,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:58:39,517 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 78 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:39,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 147 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 20:58:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-02 20:58:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 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:58:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-02 20:58:39,520 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2022-11-02 20:58:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:39,521 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-02 20:58:39,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-02 20:58:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:58:39,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:39,522 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:58:39,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:39,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 20:58:39,732 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2022-11-02 20:58:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:39,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173569581] [2022-11-02 20:58:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 20:58:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173569581] [2022-11-02 20:58:39,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173569581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:39,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:39,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:58:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441217823] [2022-11-02 20:58:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:39,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:58:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:39,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:58:39,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:39,951 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 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:58:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:40,223 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-11-02 20:58:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:58:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 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 59 [2022-11-02 20:58:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:40,225 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:58:40,225 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:58:40,225 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:58:40,225 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 225 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:40,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 89 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:58:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:58:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-02 20:58:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 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:58:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-02 20:58:40,228 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2022-11-02 20:58:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:40,230 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-02 20:58:40,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 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:58:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-02 20:58:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:58:40,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:40,236 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:58:40,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:58:40,236 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2022-11-02 20:58:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:40,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122977628] [2022-11-02 20:58:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:40,622 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:58:40,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:40,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122977628] [2022-11-02 20:58:40,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122977628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:40,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:40,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:58:40,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029991328] [2022-11-02 20:58:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:40,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:58:40,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:40,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:58:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:40,625 INFO L87 Difference]: Start difference. First operand 72 states and 77 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:58:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:40,930 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-02 20:58:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:40,931 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:58:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:40,931 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:58:40,931 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:58:40,932 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:58:40,932 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:58:40,932 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:58:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:58:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-02 20:58:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-02 20:58:40,935 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2022-11-02 20:58:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:40,936 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-02 20:58:40,936 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:58:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-02 20:58:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:58:40,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:40,937 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:58:40,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:58:40,938 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2022-11-02 20:58:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:40,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560861089] [2022-11-02 20:58:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,115 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:58:41,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:41,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560861089] [2022-11-02 20:58:41,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560861089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:41,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:41,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:58:41,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635316243] [2022-11-02 20:58:41,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:41,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:58:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:41,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:58:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:41,118 INFO L87 Difference]: Start difference. First operand 74 states and 78 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:58:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:41,317 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-11-02 20:58:41,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:41,318 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:58:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:41,318 INFO L225 Difference]: With dead ends: 77 [2022-11-02 20:58:41,318 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 20:58:41,319 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:58:41,319 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:58:41,320 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:58:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 20:58:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-02 20:58:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 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:58:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-11-02 20:58:41,322 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2022-11-02 20:58:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:41,323 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-11-02 20:58:41,323 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:58:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-11-02 20:58:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:58:41,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:41,324 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:58:41,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:58:41,324 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2022-11-02 20:58:41,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:41,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909397189] [2022-11-02 20:58:41,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,551 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:58:41,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:41,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909397189] [2022-11-02 20:58:41,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909397189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:41,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:41,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:58:41,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743680982] [2022-11-02 20:58:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:41,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:58:41,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:58:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:41,554 INFO L87 Difference]: Start difference. First operand 74 states and 77 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:58:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:41,766 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-11-02 20:58:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:41,767 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:58:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:41,767 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:58:41,768 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:58:41,768 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:58:41,768 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:58:41,769 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:58:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:58:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-02 20:58:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-02 20:58:41,782 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2022-11-02 20:58:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:41,782 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-02 20:58:41,784 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:58:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-02 20:58:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:58:41,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:41,786 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:58:41,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:58:41,787 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2022-11-02 20:58:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:41,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323394136] [2022-11-02 20:58:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:58:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:43,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323394136] [2022-11-02 20:58:43,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323394136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:43,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300897322] [2022-11-02 20:58:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:43,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:43,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:43,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:58:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-02 20:58:43,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:43,875 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:58:43,944 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:58:43,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:58:44,000 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:58:44,222 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:44,222 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 23 treesize of output 26 [2022-11-02 20:58:44,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:44,324 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 24 treesize of output 23 [2022-11-02 20:58:44,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:44,506 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 22 treesize of output 20 [2022-11-02 20:58:44,663 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:44,664 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:58:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:58:44,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:45,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-02 20:58:45,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= 1 (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4))))) is different from false [2022-11-02 20:58:45,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-02 20:58:45,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (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_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-02 20:58:45,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2022-11-02 20:58:45,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2022-11-02 20:58:45,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-02 20:58:46,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-02 20:58:46,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:46,038 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 28 treesize of output 29 [2022-11-02 20:58:46,049 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 48 treesize of output 44 [2022-11-02 20:58:46,058 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 30 [2022-11-02 20:58:46,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:46,076 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 42 treesize of output 44 [2022-11-02 20:58:46,678 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:58:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300897322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:46,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:46,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 45 [2022-11-02 20:58:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204272193] [2022-11-02 20:58:46,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:46,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:58:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:58:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1291, Unknown=8, NotChecked=632, Total=2070 [2022-11-02 20:58:46,682 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:49,376 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0)) (.cse2 (select .cse1 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select .cse0 (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select .cse0 .cse2) 1) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse2)))) is different from false [2022-11-02 20:58:50,030 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0)) (.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_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select .cse0 (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select .cse0 (select .cse1 4)) 1))) is different from false [2022-11-02 20:58:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:50,380 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-11-02 20:58:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:58:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-02 20:58:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:50,382 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:58:50,382 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:58:50,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=509, Invalid=3061, Unknown=10, NotChecked=1250, Total=4830 [2022-11-02 20:58:50,385 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 182 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 790 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:50,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 400 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 556 Invalid, 0 Unknown, 790 Unchecked, 0.5s Time] [2022-11-02 20:58:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:58:50,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-11-02 20:58:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 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:58:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-02 20:58:50,388 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2022-11-02 20:58:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:50,389 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-02 20:58:50,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-02 20:58:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:58:50,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:50,391 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:58:50,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:50,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 20:58:50,604 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:58:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2022-11-02 20:58:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:50,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729555999] [2022-11-02 20:58:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:58:53,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:53,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729555999] [2022-11-02 20:58:53,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729555999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:53,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071416712] [2022-11-02 20:58:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:53,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:53,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:53,106 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:53,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:58:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 103 conjunts are in the unsatisfiable core [2022-11-02 20:58:53,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:53,366 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:58:53,372 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:58:53,619 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:58:53,619 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:58:53,638 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:58:53,638 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:58:53,725 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:58:53,736 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:58:54,143 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:54,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:58:54,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:58:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:54,338 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:58:54,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:54,348 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:58:54,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:54,682 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:58:54,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:54,695 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:58:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:58:54,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:57,587 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 8) (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_37| v_ArrVal_1962) 4)))))))) is different from false [2022-11-02 20:58:57,644 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))))) (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4)))))) is different from false [2022-11-02 20:58:57,688 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4))))))) is different from false [2022-11-02 20:58:57,714 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_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))))))) is different from false [2022-11-02 20:58:57,765 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_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))))) (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))))))) is different from false [2022-11-02 20:58:57,791 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))))) (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))))))) is different from false [2022-11-02 20:58:57,817 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))))) (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))))))) is different from false [2022-11-02 20:58:57,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))) (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1960) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|))))) is different from false [2022-11-02 20:58:57,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:57,901 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 47 treesize of output 48 [2022-11-02 20:58:57,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:57,911 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 37 treesize of output 38 [2022-11-02 20:58:57,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-02 20:58:57,923 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 112 treesize of output 106 [2022-11-02 20:58:57,932 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 86 treesize of output 82 [2022-11-02 20:58:57,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:57,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 96 [2022-11-02 20:58:57,970 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 222 treesize of output 214 [2022-11-02 20:58:57,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:57,989 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 278 treesize of output 274 [2022-11-02 20:58:58,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:58,301 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 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-02 20:58:58,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:58,308 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 19 [2022-11-02 20:58:58,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:58,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:58,317 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 16 treesize of output 10 [2022-11-02 20:59:07,315 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:59:07,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071416712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:07,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:07,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 56 [2022-11-02 20:59:07,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052129002] [2022-11-02 20:59:07,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:07,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-02 20:59:07,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-02 20:59:07,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2192, Unknown=8, NotChecked=808, Total=3192 [2022-11-02 20:59:07,319 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 57 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 57 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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:59:11,235 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))))) (= (select .cse0 4) 0) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 8) (select |c_#length| (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select .cse1 4)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_update_at_~head#1.base|)))) is different from false [2022-11-02 20:59:12,189 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)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (<= 8 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (<= 0 (+ (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 4))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select .cse1 4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (<= (+ (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964) 4) 8) (select |c_#length| (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4))))))))) is different from false [2022-11-02 20:59:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:13,135 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-02 20:59:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:59:13,136 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 57 states have internal predecessors, (150), 0 states have call successors, (0), 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:59:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:13,137 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:59:13,137 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:59:13,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 91 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=619, Invalid=4381, Unknown=10, NotChecked=1470, Total=6480 [2022-11-02 20:59:13,140 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 180 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:13,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 610 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 887 Invalid, 0 Unknown, 750 Unchecked, 0.8s Time] [2022-11-02 20:59:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:59:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2022-11-02 20:59:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-02 20:59:13,144 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2022-11-02 20:59:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:13,144 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-02 20:59:13,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.6785714285714284) internal successors, (150), 57 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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:59:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-02 20:59:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:59:13,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:13,146 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:59:13,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:13,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:59:13,372 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:59:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:13,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2022-11-02 20:59:13,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:13,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393832625] [2022-11-02 20:59:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:59:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393832625] [2022-11-02 20:59:15,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393832625] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814686322] [2022-11-02 20:59:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:15,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:15,182 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:15,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:59:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:15,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-02 20:59:15,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:16,156 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:59:17,116 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:59:17,116 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:59:17,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:17,139 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:59:17,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:17,619 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 72 treesize of output 59 [2022-11-02 20:59:18,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:18,676 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:59:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:59:19,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:33,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:33,418 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 24 treesize of output 25 [2022-11-02 20:59:33,423 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 41 treesize of output 37 [2022-11-02 20:59:33,429 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 39 treesize of output 37 [2022-11-02 20:59:33,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:33,443 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 57 treesize of output 59 [2022-11-02 20:59:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:59:34,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814686322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:34,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:34,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-11-02 20:59:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707494887] [2022-11-02 20:59:34,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:34,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-02 20:59:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:34,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-02 20:59:34,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4800, Unknown=30, NotChecked=0, Total=5112 [2022-11-02 20:59:34,636 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:59:51,777 WARN L234 SmtUtils]: Spent 14.89s on a formula simplification. DAG size of input: 61 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:59:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:52,570 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-11-02 20:59:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-02 20:59:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 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:59:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:52,571 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:59:52,571 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:59:52,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=535, Invalid=9737, Unknown=30, NotChecked=0, Total=10302 [2022-11-02 20:59:52,573 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 71 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:52,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 892 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 117 Unchecked, 0.0s Time] [2022-11-02 20:59:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:59:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2022-11-02 20:59:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 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:59:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-02 20:59:52,577 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2022-11-02 20:59:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:52,577 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-02 20:59:52,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:59:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-02 20:59:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:59:52,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:52,578 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:59:52,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:52,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:52,792 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:59:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2022-11-02 20:59:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:52,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327481080] [2022-11-02 20:59:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:52,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:59:54,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:54,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327481080] [2022-11-02 20:59:54,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327481080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:54,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889342896] [2022-11-02 20:59:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:54,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:54,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:54,281 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:54,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 20:59:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:54,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-02 20:59:54,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:54,513 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:59:54,597 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:54,597 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:59:54,648 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:59:54,863 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:59:54,863 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:59:54,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:54,960 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:59:55,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:55,145 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:59:55,247 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:59:55,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:56,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2191 Int)) (or (< (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-02 20:59:56,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:59:56,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-02 20:59:56,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (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_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-02 20:59:56,335 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:59:56,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:59:56,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:59:56,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-02 20:59:56,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:56,396 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 23 treesize of output 24 [2022-11-02 20:59:56,400 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 38 treesize of output 34 [2022-11-02 20:59:56,407 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 22 treesize of output 20 [2022-11-02 20:59:56,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:56,421 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 32 treesize of output 34 [2022-11-02 20:59:56,794 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:59:56,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889342896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:56,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:56,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 46 [2022-11-02 20:59:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086665792] [2022-11-02 20:59:56,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:56,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-02 20:59:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:56,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-02 20:59:56,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1367, Unknown=8, NotChecked=648, Total=2162 [2022-11-02 20:59:56,797 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 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:59:58,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2191 Int)) (or (< (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))))) is different from false [2022-11-02 20:59:58,917 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2191 Int)) (or (< (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))))) is different from false [2022-11-02 20:59:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:59,502 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-11-02 20:59:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:59:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 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 68 [2022-11-02 20:59:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:59,503 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:59:59,503 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:59:59,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=412, Invalid=2924, Unknown=10, NotChecked=1210, Total=4556 [2022-11-02 20:59:59,505 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 210 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:59,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 623 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 774 Invalid, 0 Unknown, 673 Unchecked, 0.5s Time] [2022-11-02 20:59:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:59:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-02 20:59:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-11-02 20:59:59,508 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2022-11-02 20:59:59,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:59,508 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-11-02 20:59:59,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 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:59:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-11-02 20:59:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:59:59,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:59,510 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:59:59,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-02 20:59:59,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-02 20:59:59,720 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:59:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2022-11-02 20:59:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:59,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468233178] [2022-11-02 20:59:59,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:00:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:03,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468233178] [2022-11-02 21:00:03,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468233178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214677342] [2022-11-02 21:00:03,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:00:03,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:03,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:03,060 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:03,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9612b4ff-8fca-4709-a5a1-f3eeb12356ab/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 21:00:03,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:00:03,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:00:03,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-02 21:00:03,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:03,302 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 21:00:03,435 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 21:00:03,440 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 21:00:03,534 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:00:03,534 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 21:00:03,614 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 21:00:03,624 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 21:00:03,645 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 21:00:03,653 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 21:00:03,780 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 21:00:03,787 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 21:00:04,402 INFO L356 Elim1Store]: treesize reduction 80, result has 38.5 percent of original size [2022-11-02 21:00:04,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 88 [2022-11-02 21:00:04,485 INFO L356 Elim1Store]: treesize reduction 52, result has 52.7 percent of original size [2022-11-02 21:00:04,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 74 [2022-11-02 21:00:05,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:05,499 INFO L356 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2022-11-02 21:00:05,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 132 treesize of output 149 [2022-11-02 21:00:05,552 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-02 21:00:05,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 120 [2022-11-02 21:00:06,150 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 21:00:06,171 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 21:00:06,221 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:00:06,221 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 13 treesize of output 11 [2022-11-02 21:00:06,327 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 21:00:09,669 INFO L356 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-02 21:00:09,670 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 21:00:09,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:09,676 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 21:00:09,733 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 21:00:09,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:22,911 WARN L234 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:00:25,201 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (select .cse2 4)))) 4) 0))) (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2317) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|)))))) is different from false [2022-11-02 21:00:25,231 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (and (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2317) (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse3 |c_ULTIMATE.start_sll_create_#res#1.base| .cse4) (select .cse4 4)))) 4) 0)))))) is different from false [2022-11-02 21:00:25,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 4)))) 4) 0) (< .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2317) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (< .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|)))))) is different from false [2022-11-02 21:00:25,350 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) (select .cse1 4)))) 4) 0) (< .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2317) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (< .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|)))))) is different from false [2022-11-02 21:00:25,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (.cse1 (select .cse9 4))) (let ((.cse4 (select .cse3 .cse1)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_2309 Int)) (or (not (<= v_ArrVal_2309 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2309))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2317) (select (store (select (store .cse3 .cse1 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (< (select .cse2 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|)))))) (forall ((v_ArrVal_2309 Int)) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse7 (store .cse3 .cse1 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse7 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse8) (select .cse8 4)))) 4) 0) (< (select (store .cse5 .cse6 v_ArrVal_2309) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) (not (<= v_ArrVal_2309 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))))) is different from false [2022-11-02 21:00:25,459 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse9)) (.cse2 (select .cse9 4))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) (.cse4 (select .cse3 .cse2))) (and (forall ((v_ArrVal_2309 Int)) (or (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse0 (store .cse5 .cse6 v_ArrVal_2309))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| .cse0))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316))) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2317) (select (store (select (store .cse3 .cse2 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_node_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0)))) (not (<= v_ArrVal_2309 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2309 Int)) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (< (select (store .cse5 .cse6 v_ArrVal_2309) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (= (select (let ((.cse7 (store .cse3 .cse2 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_node_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| .cse8) (select .cse8 4)))) 4) 0))) (not (<= v_ArrVal_2309 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))))) is different from false [2022-11-02 21:00:25,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse9)) (.cse3 (select .cse9 4))) (let ((.cse4 (select .cse2 .cse3)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (and (forall ((v_ArrVal_2309 Int)) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (= (select (let ((.cse0 (store .cse2 .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1) (select .cse1 4)))) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (< (select (store .cse5 .cse6 v_ArrVal_2309) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) (not (<= v_ArrVal_2309 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2309 Int)) (or (not (<= v_ArrVal_2309 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse8 (store .cse5 .cse6 v_ArrVal_2309))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8))) (store .cse7 .cse3 (store (select .cse7 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (store .cse2 .cse3 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (< (select .cse8 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))))))))))) is different from false [2022-11-02 21:00:25,571 INFO L356 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-02 21:00:25,572 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 118 [2022-11-02 21:00:25,623 INFO L356 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-02 21:00:25,624 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 119 [2022-11-02 21:00:26,464 INFO L356 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-02 21:00:26,465 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 210 treesize of output 157 [2022-11-02 21:00:26,476 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 18 treesize of output 16 [2022-11-02 21:00:26,743 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse16 (not .cse13)) (.cse6 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (forall ((v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (or (= (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1) (select .cse1 4)))) 4) 0) (= (select (let ((.cse3 (let ((.cse5 (select v_arrayElimArr_16 4))) (store .cse2 .cse5 (store (select .cse2 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse4) (select .cse4 4)))) 4) 0)))) (not (= (select v_arrayElimArr_16 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (or (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((v_ArrVal_2317 (Array Int Int)) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (or (= (select (let ((.cse8 (select v_arrayElimArr_15 4))) (select (store (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4))) 4) 0) (= (select (select (store (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse6))))) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) (not (<= (select v_arrayElimArr_14 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (or (forall ((v_ArrVal_2317 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (or (= (select (let ((.cse11 (select v_arrayElimArr_15 4))) (select (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (store .cse12 .cse11 (store (select .cse12 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse6))))) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) (not (<= (select v_arrayElimArr_14 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) .cse13) (or (forall ((v_ArrVal_2317 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (not (<= (select v_arrayElimArr_14 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse6))))) .cse16) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse17 (select v_arrayElimArr_14 .cse6))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (or (< .cse17 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((v_ArrVal_2317 (Array Int Int)) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (or (= (select (let ((.cse19 (select v_arrayElimArr_15 4))) (select (store (store .cse18 .cse19 (store (select .cse18 .cse19) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (store .cse20 .cse19 (store (select .cse20 .cse19) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4))) 4) 0) (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse6))))) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) (not (<= .cse17 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (not (= (select v_arrayElimArr_16 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse21 (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse24 (select v_arrayElimArr_16 4))) (store .cse23 .cse24 (store (select .cse23 .cse24) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))))) (let ((.cse22 (store (select .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse22) (select .cse22 4)))) 4) 0))) .cse13) (or .cse16 (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (or (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((v_ArrVal_2317 (Array Int Int)) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (= (select (select (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse6))))) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) (not (<= (select v_arrayElimArr_14 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int)) (or (forall ((v_arrayElimArr_15 (Array Int Int))) (or (forall ((v_ArrVal_2317 (Array Int Int)) (v_ArrVal_2314 Int) (v_arrayElimCell_138 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14)) (.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (or (= (select (select (store (store .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (store .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (= (select (select (store (store .cse27 v_arrayElimCell_138 (store (select .cse27 v_arrayElimCell_138) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (store .cse28 v_arrayElimCell_138 (store (select .cse28 v_arrayElimCell_138) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse6))))) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|))) (not (<= (select v_arrayElimArr_14 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))))) (or .cse13 (forall ((v_ArrVal_2317 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse29 (select v_arrayElimArr_14 .cse6))) (or (< .cse29 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (let ((.cse31 (select v_arrayElimArr_15 4))) (select (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse30 .cse31 (store (select .cse30 .cse31) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2317) (select (store (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_15))) (store .cse32 .cse31 (store (select .cse32 .cse31) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4))) 4) 0) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (not (<= .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse6))))))) (or .cse16 (forall ((v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (not (= (select v_arrayElimArr_16 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse33 (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (store .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))))) (let ((.cse34 (store (select .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse34) (select .cse34 4)))) 4) 0)))) (or .cse13 (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (forall ((v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16))) (or (= (select (let ((.cse36 (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)))) (let ((.cse37 (store (select .cse36 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse36 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse37) (select .cse37 4)))) 4) 0) (= (select (let ((.cse39 (let ((.cse41 (select v_arrayElimArr_16 4))) (store .cse38 .cse41 (store (select .cse38 .cse41) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))))) (let ((.cse40 (store (select .cse39 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse39 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse40) (select .cse40 4)))) 4) 0)))) (not (= (select v_arrayElimArr_16 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (forall ((v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (not (= (select v_arrayElimArr_16 .cse6) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse42 (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_16)) (.cse45 (select v_arrayElimArr_16 4))) (store .cse44 .cse45 (store (select .cse44 .cse45) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))))) (let ((.cse43 (store (select .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse43) (select .cse43 4)))) 4) 0)))))))) is different from false [2022-11-02 21:00:31,483 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int) (v_arrayElimArr_16 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2318 Int)) (or (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_16 4))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (= (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_16))) (store .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318))) (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| .cse1) (select .cse1 4)))) 4) 0))) (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse5 (select v_arrayElimArr_14 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_14))) (store .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2317) (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_15))) (store .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_15 4))) (< .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| .cse5)))) (forall ((v_ArrVal_2317 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_47| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int) (v_ArrVal_2314 Int) (v_arrayElimCell_138 Int) (v_ArrVal_2316 Int) (v_ArrVal_2318 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_14)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_15)) (.cse8 (select v_arrayElimArr_14 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (= (select (select (store (store .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2317) (select (store (select (store .cse7 |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select v_arrayElimArr_15 4))) (< .cse8 |v_ULTIMATE.start_sll_update_at_~head#1.offset_47|) (= (select (select (store (store .cse6 v_arrayElimCell_138 (store (select .cse6 v_arrayElimCell_138) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2316)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2317) (select (store (select (store .cse7 v_arrayElimCell_138 (store (select .cse7 v_arrayElimCell_138) |v_ULTIMATE.start_sll_update_at_~head#1.offset_47| v_ArrVal_2314)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2318) 4)) 4) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| .cse8))))) is different from false [2022-11-02 21:00:31,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:31,523 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 85 treesize of output 76 [2022-11-02 21:00:31,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:31,536 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 65 treesize of output 56 [2022-11-02 21:00:31,545 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 164 treesize of output 160 [2022-11-02 21:00:31,631 INFO L356 Elim1Store]: treesize reduction 67, result has 40.2 percent of original size [2022-11-02 21:00:31,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 10620 treesize of output 10148 [2022-11-02 21:00:31,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:00:31,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:31,774 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 5501 treesize of output 5351 [2022-11-02 21:00:31,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:00:31,875 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 9492 treesize of output 8164 [2022-11-02 21:00:32,154 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 4790 treesize of output 4736 [2022-11-02 21:00:32,200 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 4730 treesize of output 4570