./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8 --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- 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-2329fc7 [2022-12-13 18:55:52,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:55:52,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:55:52,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:55:52,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:55:52,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:55:52,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:55:52,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:55:52,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:55:52,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:55:52,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:55:52,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:55:52,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:55:52,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:55:52,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:55:52,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:55:52,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:55:52,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:55:52,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:55:52,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:55:52,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:55:52,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:55:52,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:55:52,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:55:52,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:55:52,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:55:52,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:55:52,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:55:52,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:55:52,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:55:52,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:55:52,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:55:52,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:55:52,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:55:52,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:55:52,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:55:52,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:55:52,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:55:52,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:55:52,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:55:52,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:55:52,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 18:55:52,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:55:52,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:55:52,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:55:52,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:55:52,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:55:52,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:55:52,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:55:52,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:55:52,847 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:55:52,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:55:52,847 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:55:52,847 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:55:52,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:55:52,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:55:52,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:55:52,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:55:52,850 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:55:52,850 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/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_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-12-13 18:55:53,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:55:53,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:55:53,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:55:53,041 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:55:53,041 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:55:53,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-12-13 18:55:55,635 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:55:55,788 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:55:55,789 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-12-13 18:55:55,797 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/data/4e877c05c/2844eba5e4674e24af7b75df2692fe8d/FLAG038f4ca0c [2022-12-13 18:55:55,807 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/data/4e877c05c/2844eba5e4674e24af7b75df2692fe8d [2022-12-13 18:55:55,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:55:55,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:55:55,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:55:55,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:55:55,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:55:55,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:55:55" (1/1) ... [2022-12-13 18:55:55,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a8dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:55, skipping insertion in model container [2022-12-13 18:55:55,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:55:55" (1/1) ... [2022-12-13 18:55:55,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:55:55,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:55:56,079 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-12-13 18:55:56,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:55:56,098 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:55:56,129 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-12-13 18:55:56,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:55:56,155 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:55:56,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56 WrapperNode [2022-12-13 18:55:56,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:55:56,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:55:56,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:55:56,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:55:56,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,198 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2022-12-13 18:55:56,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:55:56,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:55:56,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:55:56,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:55:56,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,226 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:55:56,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:55:56,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:55:56,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:55:56,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (1/1) ... [2022-12-13 18:55:56,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:55:56,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:55:56,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:55:56,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:55:56,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:55:56,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:55:56,296 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 18:55:56,296 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 18:55:56,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 18:55:56,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:55:56,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:55:56,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 18:55:56,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 18:55:56,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:55:56,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 18:55:56,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:55:56,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:55:56,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:55:56,389 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:55:56,391 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:55:56,631 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:55:56,636 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:55:56,636 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 18:55:56,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:55:56 BoogieIcfgContainer [2022-12-13 18:55:56,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:55:56,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:55:56,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:55:56,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:55:56,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:55:55" (1/3) ... [2022-12-13 18:55:56,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220c3df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:55:56, skipping insertion in model container [2022-12-13 18:55:56,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:56" (2/3) ... [2022-12-13 18:55:56,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220c3df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:55:56, skipping insertion in model container [2022-12-13 18:55:56,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:55:56" (3/3) ... [2022-12-13 18:55:56,643 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-12-13 18:55:56,661 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:55:56,661 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-12-13 18:55:56,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:55:56,709 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=PETRI_NET, 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;@6427193a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:55:56,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-12-13 18:55:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 18:55:56,718 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:56,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:56,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:55:56,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843193, now seen corresponding path program 1 times [2022-12-13 18:55:56,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:56,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435997023] [2022-12-13 18:55:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:56,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:56,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435997023] [2022-12-13 18:55:56,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435997023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:56,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:56,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:55:56,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350029837] [2022-12-13 18:55:56,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:56,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:56,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:56,982 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:55:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:57,062 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-12-13 18:55:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:57,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 18:55:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:57,069 INFO L225 Difference]: With dead ends: 80 [2022-12-13 18:55:57,069 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 18:55:57,070 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-12-13 18:55:57,072 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:57,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:55:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 18:55:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-12-13 18:55:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-12-13 18:55:57,099 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2022-12-13 18:55:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:57,099 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-12-13 18:55:57,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:55:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-12-13 18:55:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 18:55:57,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:57,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:57,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:55:57,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:55:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:57,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843194, now seen corresponding path program 1 times [2022-12-13 18:55:57,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:57,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736699655] [2022-12-13 18:55:57,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:57,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:57,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736699655] [2022-12-13 18:55:57,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736699655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:57,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:57,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:55:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311951144] [2022-12-13 18:55:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:57,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:57,178 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:55:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:57,226 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-12-13 18:55:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 18:55:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:57,228 INFO L225 Difference]: With dead ends: 75 [2022-12-13 18:55:57,228 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 18:55:57,228 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-12-13 18:55:57,229 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:57,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 18:55:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-12-13 18:55:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.711111111111111) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-12-13 18:55:57,237 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 7 [2022-12-13 18:55:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:57,238 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-12-13 18:55:57,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:55:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-12-13 18:55:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 18:55:57,239 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:57,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:57,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:55:57,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:55:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash 649951808, now seen corresponding path program 1 times [2022-12-13 18:55:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:57,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984639581] [2022-12-13 18:55:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:57,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:55:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:57,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984639581] [2022-12-13 18:55:57,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984639581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:57,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:57,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:55:57,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877420251] [2022-12-13 18:55:57,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:57,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:55:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:57,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:55:57,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:55:57,413 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:57,566 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-12-13 18:55:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:55:57,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-13 18:55:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:57,569 INFO L225 Difference]: With dead ends: 79 [2022-12-13 18:55:57,569 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 18:55:57,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:55:57,571 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 11 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:57,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:55:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 18:55:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-12-13 18:55:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-12-13 18:55:57,577 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 13 [2022-12-13 18:55:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:57,577 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-12-13 18:55:57,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-12-13 18:55:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 18:55:57,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:57,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:57,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:55:57,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:55:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash 649951809, now seen corresponding path program 1 times [2022-12-13 18:55:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:57,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639849110] [2022-12-13 18:55:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:57,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:55:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:57,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639849110] [2022-12-13 18:55:57,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639849110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:57,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:57,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:55:57,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451318951] [2022-12-13 18:55:57,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:57,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:55:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:57,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:55:57,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:55:57,791 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:57,933 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-12-13 18:55:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:55:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-13 18:55:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:57,935 INFO L225 Difference]: With dead ends: 78 [2022-12-13 18:55:57,935 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 18:55:57,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:55:57,936 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:57,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:55:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 18:55:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-12-13 18:55:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-12-13 18:55:57,942 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 13 [2022-12-13 18:55:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:57,942 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-12-13 18:55:57,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-12-13 18:55:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 18:55:57,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:57,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:57,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:55:57,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:55:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 87749440, now seen corresponding path program 1 times [2022-12-13 18:55:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108450831] [2022-12-13 18:55:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:57,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 18:55:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:58,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108450831] [2022-12-13 18:55:58,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108450831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:58,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:58,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:55:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516871229] [2022-12-13 18:55:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:58,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:55:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:55:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:55:58,010 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:58,064 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-12-13 18:55:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:55:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-13 18:55:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:58,065 INFO L225 Difference]: With dead ends: 79 [2022-12-13 18:55:58,065 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 18:55:58,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:55:58,066 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:58,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 18:55:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-12-13 18:55:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-12-13 18:55:58,071 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 15 [2022-12-13 18:55:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:58,072 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-12-13 18:55:58,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-12-13 18:55:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 18:55:58,072 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:58,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:58,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:55:58,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:55:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash -847170750, now seen corresponding path program 1 times [2022-12-13 18:55:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:58,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663207209] [2022-12-13 18:55:58,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:58,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:55:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:58,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 18:55:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 18:55:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:58,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663207209] [2022-12-13 18:55:58,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663207209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:55:58,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499585731] [2022-12-13 18:55:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:58,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:55:58,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:55:58,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:55:58,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:55:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:58,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 18:55:58,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:55:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:58,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:55:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 18:55:58,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499585731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:55:58,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:55:58,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-12-13 18:55:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716046066] [2022-12-13 18:55:58,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:55:58,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:55:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:55:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:55:58,353 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 18:55:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:58,417 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-12-13 18:55:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:55:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-12-13 18:55:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:58,419 INFO L225 Difference]: With dead ends: 80 [2022-12-13 18:55:58,419 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 18:55:58,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:55:58,420 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:58,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 255 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:55:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 18:55:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-13 18:55:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.588235294117647) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:55:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-12-13 18:55:58,423 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 28 [2022-12-13 18:55:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:58,424 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-12-13 18:55:58,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 18:55:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-12-13 18:55:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 18:55:58,424 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:58,424 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:58,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:55:58,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 18:55:58,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:55:58,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281600, now seen corresponding path program 2 times [2022-12-13 18:55:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:58,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177818523] [2022-12-13 18:55:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:58,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:55:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:55:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:59,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:55:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 18:55:59,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:59,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177818523] [2022-12-13 18:55:59,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177818523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:59,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:59,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:55:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990355392] [2022-12-13 18:55:59,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:59,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:55:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:59,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:55:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:55:59,182 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:59,297 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-12-13 18:55:59,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:55:59,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-12-13 18:55:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:59,298 INFO L225 Difference]: With dead ends: 88 [2022-12-13 18:55:59,298 INFO L226 Difference]: Without dead ends: 88 [2022-12-13 18:55:59,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:55:59,299 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:59,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 136 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:55:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-12-13 18:55:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2022-12-13 18:55:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 71 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:55:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-12-13 18:55:59,305 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 41 [2022-12-13 18:55:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:59,306 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-12-13 18:55:59,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-12-13 18:55:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 18:55:59,307 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:59,307 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:59,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:55:59,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:55:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281601, now seen corresponding path program 1 times [2022-12-13 18:55:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:59,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106525702] [2022-12-13 18:55:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:55:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:55:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:55:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:55:59,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:59,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106525702] [2022-12-13 18:55:59,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106525702] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:55:59,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306055982] [2022-12-13 18:55:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:59,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:55:59,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:55:59,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:55:59,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:55:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:00,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 18:56:00,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:00,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:56:00,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:00,102 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-12-13 18:56:00,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:00,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:56:00,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:00,215 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-12-13 18:56:00,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:00,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:56:00,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:00,325 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-12-13 18:56:00,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:00,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:56:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-12-13 18:56:00,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:56:00,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306055982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:00,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:56:00,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2022-12-13 18:56:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111710357] [2022-12-13 18:56:00,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:56:00,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 18:56:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 18:56:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2022-12-13 18:56:00,490 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:00,764 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-12-13 18:56:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:56:00,765 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-12-13 18:56:00,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:00,766 INFO L225 Difference]: With dead ends: 84 [2022-12-13 18:56:00,766 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 18:56:00,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552 [2022-12-13 18:56:00,767 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 245 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:00,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 178 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 0 Unknown, 195 Unchecked, 0.2s Time] [2022-12-13 18:56:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 18:56:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2022-12-13 18:56:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-12-13 18:56:00,772 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 41 [2022-12-13 18:56:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:00,772 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-12-13 18:56:00,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-12-13 18:56:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 18:56:00,773 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:00,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:00,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 18:56:00,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 18:56:00,975 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526433, now seen corresponding path program 1 times [2022-12-13 18:56:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:00,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624903126] [2022-12-13 18:56:00,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:01,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 18:56:01,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:01,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624903126] [2022-12-13 18:56:01,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624903126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:01,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183552239] [2022-12-13 18:56:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:01,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:01,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:01,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:01,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:56:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:01,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 18:56:01,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:01,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:56:01,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 18:56:01,983 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_615 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_615)))) is different from true [2022-12-13 18:56:02,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:02,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:56:02,028 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-12-13 18:56:02,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2022-12-13 18:56:02,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 18:56:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 18:56:02,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:56:02,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183552239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:02,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:56:02,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2022-12-13 18:56:02,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072014065] [2022-12-13 18:56:02,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:56:02,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 18:56:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:02,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 18:56:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-12-13 18:56:02,136 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:02,679 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-12-13 18:56:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:56:02,680 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-12-13 18:56:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:02,681 INFO L225 Difference]: With dead ends: 124 [2022-12-13 18:56:02,681 INFO L226 Difference]: Without dead ends: 124 [2022-12-13 18:56:02,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1064, Unknown=1, NotChecked=68, Total=1332 [2022-12-13 18:56:02,682 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 594 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:02,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 374 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 534 Invalid, 0 Unknown, 73 Unchecked, 0.3s Time] [2022-12-13 18:56:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-13 18:56:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2022-12-13 18:56:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 69 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-12-13 18:56:02,688 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 44 [2022-12-13 18:56:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:02,688 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-12-13 18:56:02,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-12-13 18:56:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 18:56:02,689 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:02,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:02,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 18:56:02,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:02,890 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:02,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:02,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526434, now seen corresponding path program 1 times [2022-12-13 18:56:02,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:02,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471088689] [2022-12-13 18:56:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:02,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:03,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:03,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:56:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:03,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471088689] [2022-12-13 18:56:03,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471088689] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:03,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806377071] [2022-12-13 18:56:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:03,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:03,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:03,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:03,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:56:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:03,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 18:56:03,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:03,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:56:03,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:56:04,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 18:56:04,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 18:56:04,412 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_782) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_783) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 18:56:04,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:04,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-13 18:56:04,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:04,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 18:56:04,462 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:56:04,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 18:56:04,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-12-13 18:56:04,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-13 18:56:04,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 18:56:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 18:56:04,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:56:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806377071] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:05,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:56:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-12-13 18:56:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652261681] [2022-12-13 18:56:05,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:56:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 18:56:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 18:56:05,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1085, Unknown=1, NotChecked=66, Total=1260 [2022-12-13 18:56:05,474 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:06,571 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-12-13 18:56:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:56:06,572 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-12-13 18:56:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:06,572 INFO L225 Difference]: With dead ends: 114 [2022-12-13 18:56:06,572 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 18:56:06,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=228, Invalid=1937, Unknown=1, NotChecked=90, Total=2256 [2022-12-13 18:56:06,573 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 297 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:06,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 623 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 866 Invalid, 0 Unknown, 116 Unchecked, 0.5s Time] [2022-12-13 18:56:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 18:56:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2022-12-13 18:56:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-12-13 18:56:06,576 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 44 [2022-12-13 18:56:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:06,577 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-12-13 18:56:06,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-12-13 18:56:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 18:56:06,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:06,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:06,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 18:56:06,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:06,778 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 91710248, now seen corresponding path program 1 times [2022-12-13 18:56:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:06,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253670735] [2022-12-13 18:56:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:06,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 18:56:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:06,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253670735] [2022-12-13 18:56:06,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253670735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:56:06,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:56:06,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:56:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412340987] [2022-12-13 18:56:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:56:06,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:56:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:56:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:56:06,854 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:06,895 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-12-13 18:56:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:56:06,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-12-13 18:56:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:06,896 INFO L225 Difference]: With dead ends: 109 [2022-12-13 18:56:06,896 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 18:56:06,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:56:06,897 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:06,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:56:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 18:56:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2022-12-13 18:56:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 70 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-12-13 18:56:06,901 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2022-12-13 18:56:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:06,902 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-12-13 18:56:06,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-12-13 18:56:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 18:56:06,903 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:06,903 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:06,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:56:06,903 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944619, now seen corresponding path program 1 times [2022-12-13 18:56:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:06,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891337142] [2022-12-13 18:56:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:06,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 18:56:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:06,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891337142] [2022-12-13 18:56:06,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891337142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:56:06,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:56:06,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:56:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281421583] [2022-12-13 18:56:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:56:06,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:56:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:56:07,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:56:07,000 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:07,103 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-12-13 18:56:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:56:07,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-12-13 18:56:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:07,104 INFO L225 Difference]: With dead ends: 86 [2022-12-13 18:56:07,104 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 18:56:07,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:56:07,104 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:07,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:56:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 18:56:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2022-12-13 18:56:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-12-13 18:56:07,109 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 46 [2022-12-13 18:56:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:07,109 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-12-13 18:56:07,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-12-13 18:56:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 18:56:07,110 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:07,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:07,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:56:07,110 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944618, now seen corresponding path program 1 times [2022-12-13 18:56:07,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:07,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071480363] [2022-12-13 18:56:07,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:07,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 18:56:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:07,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071480363] [2022-12-13 18:56:07,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071480363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:07,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965346223] [2022-12-13 18:56:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:07,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:07,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:07,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:07,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:56:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:56:07,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 18:56:07,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:56:07,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965346223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:56:07,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:56:07,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-12-13 18:56:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391918336] [2022-12-13 18:56:07,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:56:07,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:56:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:56:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:56:07,418 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:56:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:07,432 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-12-13 18:56:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:56:07,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-12-13 18:56:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:07,433 INFO L225 Difference]: With dead ends: 73 [2022-12-13 18:56:07,433 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 18:56:07,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:56:07,433 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:07,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 131 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:56:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 18:56:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-12-13 18:56:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-12-13 18:56:07,436 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 46 [2022-12-13 18:56:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:07,436 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-12-13 18:56:07,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:56:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-12-13 18:56:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 18:56:07,436 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:07,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:07,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 18:56:07,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 18:56:07,637 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:07,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2059192403, now seen corresponding path program 1 times [2022-12-13 18:56:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:07,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402806923] [2022-12-13 18:56:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 18:56:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:07,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402806923] [2022-12-13 18:56:07,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402806923] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:07,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100311565] [2022-12-13 18:56:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:07,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:07,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:07,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:07,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 18:56:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:07,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:56:07,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 18:56:07,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:56:07,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100311565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:56:07,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:56:07,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 18:56:07,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691119831] [2022-12-13 18:56:07,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:56:07,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:56:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:56:07,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:56:07,952 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:56:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:07,972 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-12-13 18:56:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:56:07,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-12-13 18:56:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:07,973 INFO L225 Difference]: With dead ends: 70 [2022-12-13 18:56:07,973 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 18:56:07,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:56:07,974 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 91 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:07,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 111 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:56:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 18:56:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-12-13 18:56:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-12-13 18:56:07,976 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 47 [2022-12-13 18:56:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:07,976 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-12-13 18:56:07,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:56:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-12-13 18:56:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 18:56:07,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:07,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:07,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 18:56:08,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 18:56:08,178 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash 589543324, now seen corresponding path program 1 times [2022-12-13 18:56:08,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:08,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681574769] [2022-12-13 18:56:08,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:08,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 18:56:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:08,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681574769] [2022-12-13 18:56:08,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681574769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:56:08,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:56:08,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:56:08,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682388673] [2022-12-13 18:56:08,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:56:08,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:56:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:08,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:56:08,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:56:08,313 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:08,368 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-12-13 18:56:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:56:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-12-13 18:56:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:08,369 INFO L225 Difference]: With dead ends: 81 [2022-12-13 18:56:08,369 INFO L226 Difference]: Without dead ends: 81 [2022-12-13 18:56:08,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:56:08,369 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:08,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 140 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:56:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-13 18:56:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-12-13 18:56:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-12-13 18:56:08,371 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 48 [2022-12-13 18:56:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:08,371 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-12-13 18:56:08,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-12-13 18:56:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 18:56:08,372 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:08,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:08,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 18:56:08,372 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 589543325, now seen corresponding path program 1 times [2022-12-13 18:56:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:08,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374344525] [2022-12-13 18:56:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:56:08,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:08,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374344525] [2022-12-13 18:56:08,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374344525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:08,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503052343] [2022-12-13 18:56:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:08,739 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:08,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 18:56:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:08,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 18:56:08,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 18:56:08,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:56:08,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503052343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:56:08,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:56:08,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2022-12-13 18:56:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244632881] [2022-12-13 18:56:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:56:08,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:56:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:56:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2022-12-13 18:56:08,909 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:08,959 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-12-13 18:56:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:56:08,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-12-13 18:56:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:08,960 INFO L225 Difference]: With dead ends: 68 [2022-12-13 18:56:08,960 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 18:56:08,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-12-13 18:56:08,961 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:08,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 111 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:56:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 18:56:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-13 18:56:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-12-13 18:56:08,963 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 48 [2022-12-13 18:56:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:08,963 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-12-13 18:56:08,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-12-13 18:56:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 18:56:08,964 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:08,964 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-12-13 18:56:08,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 18:56:09,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 18:56:09,166 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:09,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1095973890, now seen corresponding path program 1 times [2022-12-13 18:56:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:09,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967733443] [2022-12-13 18:56:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:09,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 18:56:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:09,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967733443] [2022-12-13 18:56:09,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967733443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:56:09,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:56:09,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:56:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17621358] [2022-12-13 18:56:09,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:56:09,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:56:09,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:09,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:56:09,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:56:09,343 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:09,428 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-12-13 18:56:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:56:09,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-12-13 18:56:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:09,429 INFO L225 Difference]: With dead ends: 67 [2022-12-13 18:56:09,430 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 18:56:09,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:56:09,430 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:09,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 206 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:56:09,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 18:56:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-13 18:56:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-12-13 18:56:09,432 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 49 [2022-12-13 18:56:09,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:09,432 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-12-13 18:56:09,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:56:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-12-13 18:56:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 18:56:09,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:09,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:09,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 18:56:09,433 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 15214980, now seen corresponding path program 1 times [2022-12-13 18:56:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:09,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143257464] [2022-12-13 18:56:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:09,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:09,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:56:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:09,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143257464] [2022-12-13 18:56:09,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143257464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:09,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644099044] [2022-12-13 18:56:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:09,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:09,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:09,919 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:09,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 18:56:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:10,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 18:56:10,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:10,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:56:10,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:10,117 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1852 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1852))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 18:56:10,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:10,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:56:10,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:10,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:56:10,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:10,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:56:10,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 18:56:10,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:10,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:10,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:10,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 18:56:10,681 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 18:56:10,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 18:56:10,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:10,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:56:10,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:56:10,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-12-13 18:56:10,983 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-12-13 18:56:10,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2022-12-13 18:56:11,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:11,238 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 18:56:11,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 90 [2022-12-13 18:56:11,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:56:11,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:56:11,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2022-12-13 18:56:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2022-12-13 18:56:11,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:56:15,854 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| Int) (v_ArrVal_1861 (Array Int Int)) (|ULTIMATE.start_sll_insert_#t~mem8#1.base| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 4))) (or (< (select |c_#length| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 8)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1861) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (<= 0 .cse0))))) is different from false [2022-12-13 18:56:17,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| Int) (v_ArrVal_1861 (Array Int Int)) (|ULTIMATE.start_sll_insert_#t~mem8#1.base| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 4))) (or (< (select |c_#length| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 8)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1861) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (<= 0 .cse0))))) is different from false [2022-12-13 18:56:18,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644099044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:18,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:56:18,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2022-12-13 18:56:18,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131466549] [2022-12-13 18:56:18,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:56:18,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 18:56:18,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:18,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 18:56:18,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2253, Unknown=23, NotChecked=294, Total=2756 [2022-12-13 18:56:18,025 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:20,651 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2022-12-13 18:56:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 18:56:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-12-13 18:56:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:20,653 INFO L225 Difference]: With dead ends: 147 [2022-12-13 18:56:20,653 INFO L226 Difference]: Without dead ends: 147 [2022-12-13 18:56:20,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=678, Invalid=4423, Unknown=23, NotChecked=426, Total=5550 [2022-12-13 18:56:20,654 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1340 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:20,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 505 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1084 Invalid, 2 Unknown, 113 Unchecked, 0.8s Time] [2022-12-13 18:56:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-13 18:56:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 68. [2022-12-13 18:56:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-12-13 18:56:20,657 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 54 [2022-12-13 18:56:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:20,657 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-12-13 18:56:20,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-12-13 18:56:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 18:56:20,657 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:20,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:20,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 18:56:20,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 18:56:20,859 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash 15214981, now seen corresponding path program 1 times [2022-12-13 18:56:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:20,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904625911] [2022-12-13 18:56:20,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:21,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:56:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:21,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904625911] [2022-12-13 18:56:21,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904625911] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:21,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712594768] [2022-12-13 18:56:21,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:21,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:21,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:21,950 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:21,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 18:56:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:22,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 18:56:22,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:22,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 18:56:22,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:56:22,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:22,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 18:56:22,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:22,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:56:22,711 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 18:56:22,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-12-13 18:56:22,901 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 18:56:22,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-12-13 18:56:22,914 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 18:56:22,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 18:56:26,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:26,983 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 18:56:26,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2022-12-13 18:56:26,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:26,999 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 18:56:26,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 57 [2022-12-13 18:56:27,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:56:27,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:56:27,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:56:27,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 18:56:27,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:56:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 18:56:27,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:56:27,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712594768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:56:27,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:56:27,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 39 [2022-12-13 18:56:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016852086] [2022-12-13 18:56:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:56:27,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 18:56:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 18:56:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1443, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 18:56:27,207 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 18:56:32,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:56:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:32,802 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-12-13 18:56:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 18:56:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-12-13 18:56:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:32,803 INFO L225 Difference]: With dead ends: 91 [2022-12-13 18:56:32,803 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 18:56:32,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2022-12-13 18:56:32,804 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 484 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:32,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 345 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 454 Invalid, 2 Unknown, 0 Unchecked, 2.3s Time] [2022-12-13 18:56:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 18:56:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2022-12-13 18:56:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 65 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-12-13 18:56:32,807 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 54 [2022-12-13 18:56:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:32,807 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-12-13 18:56:32,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 18:56:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-12-13 18:56:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 18:56:32,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:32,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:32,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 18:56:33,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:33,009 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash 471663079, now seen corresponding path program 1 times [2022-12-13 18:56:33,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:33,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797383791] [2022-12-13 18:56:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:33,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:33,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:56:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:33,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797383791] [2022-12-13 18:56:33,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797383791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:33,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159931413] [2022-12-13 18:56:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:33,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:33,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:33,880 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:33,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 18:56:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:34,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 18:56:34,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:34,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 18:56:34,395 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2238 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2238) |c_#memory_$Pointer$.base|)) (not (= |c_node_create_~temp~0#1.base| 0))) is different from true [2022-12-13 18:56:34,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:34,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 18:56:34,578 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 18:56:34,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2022-12-13 18:56:36,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:36,661 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 18:56:36,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2022-12-13 18:56:36,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:56:36,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 18:56:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-12-13 18:56:36,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:56:36,692 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2241 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2241) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-12-13 18:56:37,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159931413] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:37,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:56:37,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 39 [2022-12-13 18:56:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254724609] [2022-12-13 18:56:37,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:56:37,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 18:56:37,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 18:56:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1620, Unknown=63, NotChecked=166, Total=1980 [2022-12-13 18:56:37,186 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 39 states, 37 states have (on average 2.108108108108108) internal successors, (78), 33 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 18:56:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:43,074 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-12-13 18:56:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 18:56:43,075 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.108108108108108) internal successors, (78), 33 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-12-13 18:56:43,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:43,075 INFO L225 Difference]: With dead ends: 72 [2022-12-13 18:56:43,075 INFO L226 Difference]: Without dead ends: 72 [2022-12-13 18:56:43,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=447, Invalid=3156, Unknown=65, NotChecked=238, Total=3906 [2022-12-13 18:56:43,076 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 569 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 27 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:43,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 644 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 862 Invalid, 9 Unknown, 67 Unchecked, 0.6s Time] [2022-12-13 18:56:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-13 18:56:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-12-13 18:56:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-12-13 18:56:43,078 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2022-12-13 18:56:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:43,078 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-12-13 18:56:43,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.108108108108108) internal successors, (78), 33 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 18:56:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-12-13 18:56:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 18:56:43,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:43,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:43,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 18:56:43,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:43,280 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1777907541, now seen corresponding path program 1 times [2022-12-13 18:56:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:43,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109424918] [2022-12-13 18:56:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:44,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:44,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:56:44,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:44,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109424918] [2022-12-13 18:56:44,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109424918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:44,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103675682] [2022-12-13 18:56:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:44,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:44,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:44,760 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:44,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 18:56:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:44,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 111 conjunts are in the unsatisfiable core [2022-12-13 18:56:44,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:45,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:56:45,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 18:56:45,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-12-13 18:56:45,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-12-13 18:56:45,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:45,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:56:45,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:45,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2022-12-13 18:56:45,976 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:56:45,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 18:56:45,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-12-13 18:56:45,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:45,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2022-12-13 18:56:46,493 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:56:46,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2022-12-13 18:56:46,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-12-13 18:56:46,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:46,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-12-13 18:56:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:46,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 18:56:46,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 18:56:46,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:46,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-12-13 18:56:46,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-12-13 18:56:46,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-12-13 18:56:46,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:56:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:56:46,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:56:47,002 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2440 (Array Int Int)) (v_ArrVal_2437 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_2437)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2438) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2435) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2440) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2434) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2439) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-12-13 18:56:50,161 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2440 (Array Int Int)) (v_ArrVal_2437 Int)) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) v_ArrVal_2437)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2438) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2435) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2440) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2434) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2439) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-12-13 18:56:50,240 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2440 (Array Int Int)) (v_ArrVal_2450 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24| Int) (v_ArrVal_2437 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24| v_ArrVal_2452))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24| v_ArrVal_2451)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24| v_ArrVal_2450))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) v_ArrVal_2437))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24| v_ArrVal_2438) (select (select (store (store .cse3 .cse1 v_ArrVal_2435) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24| v_ArrVal_2440) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse2 .cse1 v_ArrVal_2434) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24| v_ArrVal_2439) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_24|) 0)))) is different from false [2022-12-13 18:56:50,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103675682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:50,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:56:50,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-12-13 18:56:50,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012583554] [2022-12-13 18:56:50,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:56:50,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 18:56:50,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:50,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 18:56:50,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2257, Unknown=129, NotChecked=300, Total=2862 [2022-12-13 18:56:50,244 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:56:54,724 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-12-13 18:56:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 18:56:54,725 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-12-13 18:56:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:56:54,725 INFO L225 Difference]: With dead ends: 82 [2022-12-13 18:56:54,725 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 18:56:54,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=482, Invalid=4647, Unknown=139, NotChecked=432, Total=5700 [2022-12-13 18:56:54,727 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 294 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 18:56:54,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 618 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 18:56:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 18:56:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-12-13 18:56:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:56:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-12-13 18:56:54,729 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2022-12-13 18:56:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:56:54,729 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-12-13 18:56:54,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:56:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-12-13 18:56:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 18:56:54,729 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:56:54,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:56:54,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 18:56:54,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:54,931 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:56:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:56:54,932 INFO L85 PathProgramCache]: Analyzing trace with hash 719441558, now seen corresponding path program 1 times [2022-12-13 18:56:54,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:56:54,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968873115] [2022-12-13 18:56:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:56:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:56:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:56:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:56:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:56:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:56,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968873115] [2022-12-13 18:56:56,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968873115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:56,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954002666] [2022-12-13 18:56:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:56:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:56:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:56:56,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:56:56,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 18:56:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:56:56,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-13 18:56:56,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:56:57,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 18:56:57,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:56:57,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:56:57,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:57,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-13 18:56:57,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:57,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 18:56:57,357 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 18:56:57,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 18:56:57,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:57,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2022-12-13 18:56:57,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:57,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-13 18:56:57,936 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 18:56:57,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 100 [2022-12-13 18:56:57,948 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:56:57,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 90 [2022-12-13 18:56:58,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 58 [2022-12-13 18:56:58,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:56:58,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:56:58,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 31 [2022-12-13 18:56:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:56:58,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:56:58,597 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-12-13 18:56:58,873 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2636) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-12-13 18:56:58,881 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) (+ |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2636) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-12-13 18:56:59,165 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2636) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2022-12-13 18:56:59,224 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| Int) (v_ArrVal_2639 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| 1) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| v_ArrVal_2649))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| v_ArrVal_2648)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store .cse3 .cse2 v_ArrVal_2636) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1))) is different from false [2022-12-13 18:56:59,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954002666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:56:59,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:56:59,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2022-12-13 18:56:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597725236] [2022-12-13 18:56:59,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:56:59,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-12-13 18:56:59,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-12-13 18:56:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3162, Unknown=90, NotChecked=590, Total=4032 [2022-12-13 18:56:59,229 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:57:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:57:02,532 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-12-13 18:57:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 18:57:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-12-13 18:57:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:57:02,532 INFO L225 Difference]: With dead ends: 105 [2022-12-13 18:57:02,532 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 18:57:02,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=648, Invalid=5598, Unknown=94, NotChecked=800, Total=7140 [2022-12-13 18:57:02,534 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 919 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:57:02,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 680 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1571 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 18:57:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 18:57:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2022-12-13 18:57:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:57:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-12-13 18:57:02,536 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2022-12-13 18:57:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:57:02,536 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-12-13 18:57:02,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:57:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-12-13 18:57:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 18:57:02,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:57:02,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:57:02,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 18:57:02,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:57:02,737 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:57:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:57:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash 719441559, now seen corresponding path program 1 times [2022-12-13 18:57:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:57:02,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561449355] [2022-12-13 18:57:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:57:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:57:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:57:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:57:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:57:04,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:57:04,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561449355] [2022-12-13 18:57:04,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561449355] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:57:04,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522052857] [2022-12-13 18:57:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:04,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:57:04,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:57:04,237 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:57:04,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 18:57:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:04,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-13 18:57:04,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:57:04,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 18:57:04,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:57:04,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:57:05,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:05,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-13 18:57:05,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:05,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 18:57:05,189 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:57:05,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 18:57:05,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:05,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-12-13 18:57:05,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:05,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2022-12-13 18:57:05,720 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 18:57:05,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 108 [2022-12-13 18:57:05,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:05,736 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 18:57:05,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 108 [2022-12-13 18:57:06,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:57:06,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:06,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:57:06,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 51 [2022-12-13 18:57:06,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:06,125 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-13 18:57:06,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2022-12-13 18:57:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:57:06,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:57:06,770 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2836))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2837 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 .cse4))) (<= (+ 8 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2836))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2837 (Array Int Int))) (<= 0 (+ (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse6)) 4))) (not (<= 0 .cse6))))))) is different from false [2022-12-13 18:57:06,791 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2836))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2837 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse0)) 4))))))) (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2836))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_2837 (Array Int Int))) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ 4 .cse4))) (<= (+ (select (select .cse5 .cse6) .cse7) 8) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))))))) is different from false [2022-12-13 18:57:06,867 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2836))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2837 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse0 4)) 4))))))) (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2836))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_2837 (Array Int Int))) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ .cse4 4))) (<= (+ (select (select .cse5 .cse6) .cse7) 8) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))))))) is different from false [2022-12-13 18:57:08,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:57:08,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 520 treesize of output 524 [2022-12-13 18:57:14,909 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:57:14,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522052857] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:57:14,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:57:14,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2022-12-13 18:57:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238781606] [2022-12-13 18:57:14,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:57:14,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 18:57:14,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:57:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 18:57:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3917, Unknown=51, NotChecked=384, Total=4556 [2022-12-13 18:57:14,912 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:57:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:57:20,693 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-12-13 18:57:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 18:57:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-12-13 18:57:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:57:20,694 INFO L225 Difference]: With dead ends: 120 [2022-12-13 18:57:20,694 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 18:57:20,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=609, Invalid=7362, Unknown=51, NotChecked=534, Total=8556 [2022-12-13 18:57:20,696 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 952 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:57:20,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 757 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 18:57:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 18:57:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 74. [2022-12-13 18:57:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:57:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-12-13 18:57:20,698 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2022-12-13 18:57:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:57:20,698 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-12-13 18:57:20,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:57:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-12-13 18:57:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 18:57:20,699 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:57:20,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:57:20,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 18:57:20,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 18:57:20,901 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:57:20,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:57:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash 827850517, now seen corresponding path program 1 times [2022-12-13 18:57:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:57:20,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011493515] [2022-12-13 18:57:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:57:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:57:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:57:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:22,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:57:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:57:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:57:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011493515] [2022-12-13 18:57:22,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011493515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:57:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582755612] [2022-12-13 18:57:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:22,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:57:22,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:57:22,521 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:57:22,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 18:57:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:22,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-13 18:57:22,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:57:23,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 18:57:23,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:57:23,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:57:23,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:23,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 18:57:23,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:23,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 18:57:23,551 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:57:23,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 18:57:23,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:23,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-12-13 18:57:23,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:23,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-12-13 18:57:24,131 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 18:57:24,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 92 [2022-12-13 18:57:24,145 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:57:24,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 84 [2022-12-13 18:57:24,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2022-12-13 18:57:24,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:57:24,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:24,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:57:24,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 28 [2022-12-13 18:57:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:57:24,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:57:26,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582755612] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:57:26,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:57:26,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 55 [2022-12-13 18:57:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098480063] [2022-12-13 18:57:26,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:57:26,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-13 18:57:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:57:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-13 18:57:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3797, Unknown=47, NotChecked=0, Total=4032 [2022-12-13 18:57:26,167 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 49 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:57:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:57:31,310 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-12-13 18:57:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 18:57:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 49 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2022-12-13 18:57:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:57:31,311 INFO L225 Difference]: With dead ends: 89 [2022-12-13 18:57:31,311 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 18:57:31,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=834, Invalid=7303, Unknown=53, NotChecked=0, Total=8190 [2022-12-13 18:57:31,312 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1035 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:57:31,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 732 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1332 Invalid, 2 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 18:57:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 18:57:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2022-12-13 18:57:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:57:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-12-13 18:57:31,314 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2022-12-13 18:57:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:57:31,314 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-12-13 18:57:31,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 49 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:57:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-12-13 18:57:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 18:57:31,315 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:57:31,315 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:57:31,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 18:57:31,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 18:57:31,516 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-12-13 18:57:31,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:57:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash 832836797, now seen corresponding path program 1 times [2022-12-13 18:57:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:57:31,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14166799] [2022-12-13 18:57:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:57:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 18:57:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:57:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 18:57:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:57:33,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:57:33,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14166799] [2022-12-13 18:57:33,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14166799] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:57:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834129627] [2022-12-13 18:57:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:33,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:57:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:57:33,924 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:57:33,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc5465a4-866f-4f37-a3de-60cfb235aee2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 18:57:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:34,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 131 conjunts are in the unsatisfiable core [2022-12-13 18:57:34,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:57:34,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 18:57:34,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:57:34,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:57:35,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:57:35,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:35,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2022-12-13 18:57:35,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:35,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 18:57:35,277 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:57:35,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 18:57:36,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:36,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2022-12-13 18:57:36,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:36,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2022-12-13 18:57:36,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 18:57:36,297 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 18:57:36,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 137 [2022-12-13 18:57:36,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:36,324 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 18:57:36,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 145 [2022-12-13 18:57:36,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2022-12-13 18:57:36,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:36,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:57:36,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 54 [2022-12-13 18:57:36,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:36,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2022-12-13 18:57:37,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:57:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:57:37,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:57:37,539 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-12-13 18:57:37,562 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-13 18:57:37,606 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-13 18:57:37,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-13 18:57:37,641 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) is different from false [2022-12-13 18:57:37,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3233)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3232))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) v_ArrVal_3231))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) is different from false [2022-12-13 18:57:37,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:57:37,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 312 [2022-12-13 18:57:37,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:57:37,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6836 treesize of output 6424 [2022-12-13 18:57:37,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7388 treesize of output 6300 [2022-12-13 18:57:38,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1852 treesize of output 1308 [2022-12-13 18:58:02,581 WARN L233 SmtUtils]: Spent 23.74s on a formula simplification that was a NOOP. DAG size: 257 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 18:58:02,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:58:02,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 3260 treesize of output 7162