./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0513_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R --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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- 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-38b53e6 [2022-11-25 16:50:19,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:50:19,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:50:20,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:50:20,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:50:20,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:50:20,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:50:20,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:50:20,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:50:20,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:50:20,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:50:20,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:50:20,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:50:20,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:50:20,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:50:20,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:50:20,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:50:20,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:50:20,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:50:20,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:50:20,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:50:20,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:50:20,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:50:20,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:50:20,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:50:20,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:50:20,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:50:20,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:50:20,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:50:20,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:50:20,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:50:20,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:50:20,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:50:20,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:50:20,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:50:20,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:50:20,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:50:20,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:50:20,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:50:20,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:50:20,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:50:20,086 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 16:50:20,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:50:20,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:50:20,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:50:20,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:50:20,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:50:20,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:50:20,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:50:20,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:50:20,134 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:50:20,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:50:20,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:50:20,136 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:50:20,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:50:20,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:50:20,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:50:20,138 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:50:20,138 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:50:20,139 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:50:20,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:50:20,139 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:50:20,140 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:50:20,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:50:20,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:50:20,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:50:20,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:50:20,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:50:20,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:50:20,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:50:20,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:50:20,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:50:20,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:50:20,144 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:50:20,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:50:20,144 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_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/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_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2022-11-25 16:50:20,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:50:20,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:50:20,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:50:20,458 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:50:20,458 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:50:20,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-11-25 16:50:23,612 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:50:23,910 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:50:23,910 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-11-25 16:50:23,923 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/data/710cddccf/3c795f24533645aea3380f4d3465df21/FLAG1a445f0d2 [2022-11-25 16:50:23,940 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/data/710cddccf/3c795f24533645aea3380f4d3465df21 [2022-11-25 16:50:23,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:50:23,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:50:23,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:50:23,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:50:23,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:50:23,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:50:23" (1/1) ... [2022-11-25 16:50:23,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9c64ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:23, skipping insertion in model container [2022-11-25 16:50:23,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:50:23" (1/1) ... [2022-11-25 16:50:23,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:50:23,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:50:24,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:50:24,383 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:50:24,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:50:24,504 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:50:24,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24 WrapperNode [2022-11-25 16:50:24,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:50:24,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:50:24,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:50:24,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:50:24,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,561 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2022-11-25 16:50:24,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:50:24,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:50:24,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:50:24,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:50:24,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:50:24,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:50:24,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:50:24,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:50:24,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (1/1) ... [2022-11-25 16:50:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:50:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:24,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:24,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:50:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:50:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:50:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 16:50:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:50:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 16:50:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 16:50:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:50:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:50:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:50:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:50:24,881 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:50:24,883 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:50:25,479 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:50:25,488 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:50:25,488 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 16:50:25,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:50:25 BoogieIcfgContainer [2022-11-25 16:50:25,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:50:25,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:50:25,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:50:25,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:50:25,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:50:23" (1/3) ... [2022-11-25 16:50:25,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bafebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:50:25, skipping insertion in model container [2022-11-25 16:50:25,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:24" (2/3) ... [2022-11-25 16:50:25,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bafebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:50:25, skipping insertion in model container [2022-11-25 16:50:25,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:50:25" (3/3) ... [2022-11-25 16:50:25,502 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2022-11-25 16:50:25,525 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:50:25,525 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-11-25 16:50:25,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:50:25,589 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;@49ae6b68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:50:25,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-11-25 16:50:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 16:50:25,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:25,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 16:50:25,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash 28769460, now seen corresponding path program 1 times [2022-11-25 16:50:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:25,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960469869] [2022-11-25 16:50:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:25,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:25,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960469869] [2022-11-25 16:50:25,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960469869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:25,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:25,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:50:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765197362] [2022-11-25 16:50:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:25,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:50:25,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:25,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:50:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:50:25,905 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:25,960 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-11-25 16:50:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:50:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 16:50:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:25,985 INFO L225 Difference]: With dead ends: 151 [2022-11-25 16:50:25,989 INFO L226 Difference]: Without dead ends: 149 [2022-11-25 16:50:25,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:50:25,999 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:26,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:50:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-25 16:50:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-25 16:50:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-11-25 16:50:26,075 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2022-11-25 16:50:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:26,075 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-11-25 16:50:26,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-11-25 16:50:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 16:50:26,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:26,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:26,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:50:26,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849456, now seen corresponding path program 1 times [2022-11-25 16:50:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:26,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146429661] [2022-11-25 16:50:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:26,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146429661] [2022-11-25 16:50:26,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146429661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:26,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:26,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:50:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495534101] [2022-11-25 16:50:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:26,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:26,218 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:26,459 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2022-11-25 16:50:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:26,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 16:50:26,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:26,463 INFO L225 Difference]: With dead ends: 196 [2022-11-25 16:50:26,463 INFO L226 Difference]: Without dead ends: 195 [2022-11-25 16:50:26,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:26,465 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:26,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:50:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-25 16:50:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2022-11-25 16:50:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2022-11-25 16:50:26,476 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2022-11-25 16:50:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:26,476 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2022-11-25 16:50:26,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2022-11-25 16:50:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 16:50:26,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:26,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:26,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:50:26,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:26,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849360, now seen corresponding path program 1 times [2022-11-25 16:50:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:26,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464990452] [2022-11-25 16:50:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:26,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:26,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464990452] [2022-11-25 16:50:26,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464990452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:26,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:26,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840696214] [2022-11-25 16:50:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:26,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:26,532 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:26,598 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2022-11-25 16:50:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:26,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 16:50:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:26,600 INFO L225 Difference]: With dead ends: 173 [2022-11-25 16:50:26,600 INFO L226 Difference]: Without dead ends: 172 [2022-11-25 16:50:26,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:26,601 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:26,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 279 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:50:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-25 16:50:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-11-25 16:50:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2022-11-25 16:50:26,611 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 7 [2022-11-25 16:50:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:26,611 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2022-11-25 16:50:26,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2022-11-25 16:50:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 16:50:26,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:26,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:26,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:50:26,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2022-11-25 16:50:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:26,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231103654] [2022-11-25 16:50:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:26,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:26,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231103654] [2022-11-25 16:50:26,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231103654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:26,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:26,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:50:26,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015064687] [2022-11-25 16:50:26,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:26,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:26,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:26,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:26,735 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:26,918 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2022-11-25 16:50:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:26,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 16:50:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:26,920 INFO L225 Difference]: With dead ends: 191 [2022-11-25 16:50:26,920 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 16:50:26,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:26,922 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:26,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 196 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:50:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 16:50:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2022-11-25 16:50:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2022-11-25 16:50:26,932 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2022-11-25 16:50:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:26,932 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2022-11-25 16:50:26,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2022-11-25 16:50:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 16:50:26,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:26,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:26,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:50:26,934 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2022-11-25 16:50:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:26,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121161175] [2022-11-25 16:50:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:27,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:27,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121161175] [2022-11-25 16:50:27,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121161175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:27,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:27,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:50:27,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585743255] [2022-11-25 16:50:27,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:27,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:27,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:27,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:27,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:27,054 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:27,193 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-11-25 16:50:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:27,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 16:50:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:27,195 INFO L225 Difference]: With dead ends: 157 [2022-11-25 16:50:27,195 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 16:50:27,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:27,196 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:27,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:50:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 16:50:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-25 16:50:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2022-11-25 16:50:27,205 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 7 [2022-11-25 16:50:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:27,205 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2022-11-25 16:50:27,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-11-25 16:50:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 16:50:27,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:27,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:27,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:50:27,207 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1188718309, now seen corresponding path program 1 times [2022-11-25 16:50:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:27,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284807865] [2022-11-25 16:50:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:27,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:27,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284807865] [2022-11-25 16:50:27,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284807865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:27,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:27,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407380118] [2022-11-25 16:50:27,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:27,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:50:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:27,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:27,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:27,277 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:27,322 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2022-11-25 16:50:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:50:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 16:50:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:27,324 INFO L225 Difference]: With dead ends: 295 [2022-11-25 16:50:27,324 INFO L226 Difference]: Without dead ends: 295 [2022-11-25 16:50:27,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:27,326 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 147 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:27,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 454 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:50:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-25 16:50:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2022-11-25 16:50:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2022-11-25 16:50:27,334 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2022-11-25 16:50:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:27,334 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2022-11-25 16:50:27,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2022-11-25 16:50:27,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:50:27,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:27,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:27,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:50:27,336 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682520, now seen corresponding path program 1 times [2022-11-25 16:50:27,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:27,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625398130] [2022-11-25 16:50:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:27,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625398130] [2022-11-25 16:50:27,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625398130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:27,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:27,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:50:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555013237] [2022-11-25 16:50:27,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:27,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:27,521 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:27,670 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-11-25 16:50:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:27,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 16:50:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:27,672 INFO L225 Difference]: With dead ends: 156 [2022-11-25 16:50:27,672 INFO L226 Difference]: Without dead ends: 156 [2022-11-25 16:50:27,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:27,674 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:27,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:50:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-25 16:50:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-25 16:50:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2022-11-25 16:50:27,680 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2022-11-25 16:50:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:27,680 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2022-11-25 16:50:27,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-11-25 16:50:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:50:27,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:27,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:27,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:50:27,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:27,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682519, now seen corresponding path program 1 times [2022-11-25 16:50:27,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:27,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247696074] [2022-11-25 16:50:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:27,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:27,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247696074] [2022-11-25 16:50:27,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247696074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:27,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:27,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:50:27,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329389900] [2022-11-25 16:50:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:27,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:50:27,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:27,800 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:27,904 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-11-25 16:50:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:27,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 16:50:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:27,906 INFO L225 Difference]: With dead ends: 153 [2022-11-25 16:50:27,907 INFO L226 Difference]: Without dead ends: 153 [2022-11-25 16:50:27,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:27,908 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:27,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 215 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:50:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-25 16:50:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-11-25 16:50:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2022-11-25 16:50:27,914 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2022-11-25 16:50:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:27,914 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2022-11-25 16:50:27,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-11-25 16:50:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 16:50:27,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:27,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:27,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:50:27,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351565, now seen corresponding path program 1 times [2022-11-25 16:50:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:27,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55223564] [2022-11-25 16:50:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:27,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55223564] [2022-11-25 16:50:27,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55223564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:27,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:27,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524170468] [2022-11-25 16:50:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:27,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:50:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:27,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:27,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:27,999 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:28,136 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2022-11-25 16:50:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:50:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 16:50:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:28,138 INFO L225 Difference]: With dead ends: 261 [2022-11-25 16:50:28,138 INFO L226 Difference]: Without dead ends: 261 [2022-11-25 16:50:28,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:28,141 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:28,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:50:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-25 16:50:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2022-11-25 16:50:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2022-11-25 16:50:28,153 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2022-11-25 16:50:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:28,154 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2022-11-25 16:50:28,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2022-11-25 16:50:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 16:50:28,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:28,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:28,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:50:28,156 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351469, now seen corresponding path program 1 times [2022-11-25 16:50:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:28,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481124923] [2022-11-25 16:50:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:28,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:28,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:28,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481124923] [2022-11-25 16:50:28,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481124923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:28,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:28,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378102801] [2022-11-25 16:50:28,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:28,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:50:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:50:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:28,332 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:28,516 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2022-11-25 16:50:28,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:50:28,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 16:50:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:28,518 INFO L225 Difference]: With dead ends: 147 [2022-11-25 16:50:28,518 INFO L226 Difference]: Without dead ends: 147 [2022-11-25 16:50:28,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:28,519 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 68 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:28,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 224 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:50:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-25 16:50:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-11-25 16:50:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2022-11-25 16:50:28,524 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 24 [2022-11-25 16:50:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:28,524 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2022-11-25 16:50:28,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2022-11-25 16:50:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 16:50:28,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:28,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:28,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:50:28,526 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351470, now seen corresponding path program 1 times [2022-11-25 16:50:28,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:28,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143646016] [2022-11-25 16:50:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:28,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143646016] [2022-11-25 16:50:28,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143646016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:28,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:28,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479781316] [2022-11-25 16:50:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:28,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:50:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:50:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:28,723 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:29,007 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2022-11-25 16:50:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:50:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 16:50:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:29,009 INFO L225 Difference]: With dead ends: 239 [2022-11-25 16:50:29,009 INFO L226 Difference]: Without dead ends: 239 [2022-11-25 16:50:29,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:50:29,010 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 325 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:29,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 226 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:50:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-25 16:50:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 185. [2022-11-25 16:50:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2022-11-25 16:50:29,023 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 24 [2022-11-25 16:50:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:29,023 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2022-11-25 16:50:29,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2022-11-25 16:50:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:50:29,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:29,025 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 16:50:29,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:50:29,025 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:29,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash 611618329, now seen corresponding path program 1 times [2022-11-25 16:50:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:29,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185717688] [2022-11-25 16:50:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:29,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185717688] [2022-11-25 16:50:29,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185717688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:29,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:29,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430277544] [2022-11-25 16:50:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:29,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:50:29,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:50:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:29,174 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:29,321 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2022-11-25 16:50:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:50:29,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 16:50:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:29,324 INFO L225 Difference]: With dead ends: 238 [2022-11-25 16:50:29,324 INFO L226 Difference]: Without dead ends: 238 [2022-11-25 16:50:29,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:50:29,326 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 257 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:29,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 360 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:50:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-25 16:50:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2022-11-25 16:50:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2022-11-25 16:50:29,333 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 29 [2022-11-25 16:50:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:29,334 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2022-11-25 16:50:29,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2022-11-25 16:50:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:50:29,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:29,341 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 16:50:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:50:29,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 610479294, now seen corresponding path program 1 times [2022-11-25 16:50:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:29,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161502926] [2022-11-25 16:50:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:29,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:29,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161502926] [2022-11-25 16:50:29,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161502926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:29,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:29,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:50:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455726580] [2022-11-25 16:50:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:29,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:50:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:29,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:50:29,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:50:29,594 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:29,911 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2022-11-25 16:50:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:50:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 16:50:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:29,914 INFO L225 Difference]: With dead ends: 213 [2022-11-25 16:50:29,914 INFO L226 Difference]: Without dead ends: 213 [2022-11-25 16:50:29,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:50:29,915 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 18 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:29,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 396 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:50:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-25 16:50:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2022-11-25 16:50:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2022-11-25 16:50:29,922 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 29 [2022-11-25 16:50:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:29,923 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2022-11-25 16:50:29,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2022-11-25 16:50:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:50:29,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:29,924 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 16:50:29,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:50:29,925 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash 610479295, now seen corresponding path program 1 times [2022-11-25 16:50:29,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:29,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271105305] [2022-11-25 16:50:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:29,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:30,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:30,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271105305] [2022-11-25 16:50:30,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271105305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:30,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:30,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:50:30,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715669790] [2022-11-25 16:50:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:30,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:50:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:50:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:50:30,224 INFO L87 Difference]: Start difference. First operand 198 states and 252 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:30,405 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2022-11-25 16:50:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:50:30,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 16:50:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:30,406 INFO L225 Difference]: With dead ends: 225 [2022-11-25 16:50:30,407 INFO L226 Difference]: Without dead ends: 225 [2022-11-25 16:50:30,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:50:30,408 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 36 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:30,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 455 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:50:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-25 16:50:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2022-11-25 16:50:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2022-11-25 16:50:30,413 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 29 [2022-11-25 16:50:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:30,414 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2022-11-25 16:50:30,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2022-11-25 16:50:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 16:50:30,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:30,415 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 16:50:30,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:50:30,415 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604246, now seen corresponding path program 1 times [2022-11-25 16:50:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:30,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364162054] [2022-11-25 16:50:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:31,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:31,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364162054] [2022-11-25 16:50:31,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364162054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:31,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:31,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 16:50:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435248410] [2022-11-25 16:50:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:31,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:50:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:31,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:50:31,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:50:31,032 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:31,759 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2022-11-25 16:50:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 16:50:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 16:50:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:31,762 INFO L225 Difference]: With dead ends: 307 [2022-11-25 16:50:31,762 INFO L226 Difference]: Without dead ends: 307 [2022-11-25 16:50:31,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-11-25 16:50:31,763 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 205 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:31,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 530 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:50:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-25 16:50:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 220. [2022-11-25 16:50:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2022-11-25 16:50:31,769 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 32 [2022-11-25 16:50:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:31,769 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2022-11-25 16:50:31,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2022-11-25 16:50:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 16:50:31,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:31,771 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 16:50:31,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:50:31,773 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604247, now seen corresponding path program 1 times [2022-11-25 16:50:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447693336] [2022-11-25 16:50:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:32,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447693336] [2022-11-25 16:50:32,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447693336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:32,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:32,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:50:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299418539] [2022-11-25 16:50:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:32,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:50:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:50:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:50:32,493 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:33,187 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-11-25 16:50:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:50:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 16:50:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:33,189 INFO L225 Difference]: With dead ends: 309 [2022-11-25 16:50:33,189 INFO L226 Difference]: Without dead ends: 309 [2022-11-25 16:50:33,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-11-25 16:50:33,190 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 188 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:33,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 359 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:50:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-25 16:50:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2022-11-25 16:50:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2022-11-25 16:50:33,197 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 32 [2022-11-25 16:50:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:33,197 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2022-11-25 16:50:33,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2022-11-25 16:50:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 16:50:33,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:33,199 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-11-25 16:50:33,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:50:33,199 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:33,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1655909309, now seen corresponding path program 1 times [2022-11-25 16:50:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:33,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427021533] [2022-11-25 16:50:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:33,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:33,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427021533] [2022-11-25 16:50:33,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427021533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:33,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:33,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:50:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047313797] [2022-11-25 16:50:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:33,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:50:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:50:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:50:33,569 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:33,832 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2022-11-25 16:50:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:50:33,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-25 16:50:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:33,834 INFO L225 Difference]: With dead ends: 254 [2022-11-25 16:50:33,834 INFO L226 Difference]: Without dead ends: 254 [2022-11-25 16:50:33,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:50:33,835 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 55 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:33,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 575 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:50:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-25 16:50:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2022-11-25 16:50:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2022-11-25 16:50:33,842 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 33 [2022-11-25 16:50:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:33,842 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2022-11-25 16:50:33,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2022-11-25 16:50:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 16:50:33,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:33,844 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-11-25 16:50:33,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:50:33,844 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash 206446071, now seen corresponding path program 1 times [2022-11-25 16:50:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:33,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515334227] [2022-11-25 16:50:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:50:33,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:33,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515334227] [2022-11-25 16:50:33,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515334227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:33,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:33,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594769273] [2022-11-25 16:50:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:33,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:50:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:33,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:33,973 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:34,204 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-11-25 16:50:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:50:34,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-25 16:50:34,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:34,207 INFO L225 Difference]: With dead ends: 299 [2022-11-25 16:50:34,207 INFO L226 Difference]: Without dead ends: 299 [2022-11-25 16:50:34,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:34,208 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:34,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 265 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:50:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-25 16:50:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 228. [2022-11-25 16:50:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2022-11-25 16:50:34,215 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 34 [2022-11-25 16:50:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:34,216 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2022-11-25 16:50:34,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2022-11-25 16:50:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 16:50:34,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:34,218 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-11-25 16:50:34,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:50:34,219 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash 206446072, now seen corresponding path program 1 times [2022-11-25 16:50:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:34,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822337323] [2022-11-25 16:50:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:35,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822337323] [2022-11-25 16:50:35,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822337323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:35,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:35,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 16:50:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908797539] [2022-11-25 16:50:35,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:35,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 16:50:35,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:35,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 16:50:35,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:50:35,140 INFO L87 Difference]: Start difference. First operand 228 states and 294 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:36,270 INFO L93 Difference]: Finished difference Result 293 states and 367 transitions. [2022-11-25 16:50:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 16:50:36,271 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-25 16:50:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:36,272 INFO L225 Difference]: With dead ends: 293 [2022-11-25 16:50:36,273 INFO L226 Difference]: Without dead ends: 293 [2022-11-25 16:50:36,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2022-11-25 16:50:36,274 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:36,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 394 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:50:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-25 16:50:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2022-11-25 16:50:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 197 states have (on average 1.5482233502538072) internal successors, (305), 236 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 305 transitions. [2022-11-25 16:50:36,280 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 305 transitions. Word has length 34 [2022-11-25 16:50:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:36,281 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 305 transitions. [2022-11-25 16:50:36,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 305 transitions. [2022-11-25 16:50:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 16:50:36,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:36,282 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-11-25 16:50:36,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 16:50:36,282 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1585985001, now seen corresponding path program 1 times [2022-11-25 16:50:36,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:36,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845624771] [2022-11-25 16:50:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:37,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:37,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845624771] [2022-11-25 16:50:37,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845624771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:37,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709396547] [2022-11-25 16:50:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:37,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:37,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:37,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:37,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:50:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:37,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 16:50:37,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:37,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:50:37,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:50:37,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:37,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:50:37,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:37,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:50:37,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:37,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:50:37,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:37,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:50:37,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:37,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:50:37,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:50:37,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:50:38,071 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:50:38,071 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 14 treesize of output 20 [2022-11-25 16:50:38,084 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-11-25 16:50:38,103 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:50:38,103 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 14 treesize of output 20 [2022-11-25 16:50:38,114 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-11-25 16:50:38,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:50:38,250 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 31 treesize of output 30 [2022-11-25 16:50:38,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:50:39,363 INFO L321 Elim1Store]: treesize reduction 116, result has 24.2 percent of original size [2022-11-25 16:50:39,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 119 [2022-11-25 16:50:39,476 INFO L321 Elim1Store]: treesize reduction 116, result has 24.2 percent of original size [2022-11-25 16:50:39,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 92 [2022-11-25 16:50:39,523 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-11-25 16:50:39,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2022-11-25 16:50:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:39,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:39,861 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 10 treesize of output 8 [2022-11-25 16:50:40,931 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-25 16:50:40,931 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2022-11-25 16:50:40,943 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 97 treesize of output 85 [2022-11-25 16:50:41,587 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-25 16:50:41,592 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 84 [2022-11-25 16:50:41,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-11-25 16:50:42,490 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse3 (not (<= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (.cse28 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse4 (not (<= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)))) (and (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse1 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse1) v_arrayElimCell_32) 0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse2 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse2) v_arrayElimCell_32) 0)))))) (or .cse3 .cse4 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse6 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse5 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse6 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse7 .cse6) v_arrayElimCell_32) 0))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse8 (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30))) (or (= (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse8 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (or .cse3 .cse4 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse10 (select v_arrayElimArr_1 .cse0))) (or (= (select (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse10)) (= (select (select .cse9 v_arrayElimCell_30) .cse10) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse11 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse13 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse12 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse13 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select .cse12 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse14 .cse13) v_arrayElimCell_32) 0))))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select .cse15 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select .cse15 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (or .cse3 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse17 (select v_arrayElimArr_1 .cse0))) (or (= (select (select .cse16 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse17)) (= (select (select .cse16 v_arrayElimCell_30) .cse17) 0)))) .cse4) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2)) (.cse19 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select (select .cse18 |c_ULTIMATE.start_main_~item~0#1.base|) v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse19 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select .cse18 .cse19) v_arrayElimCell_32) 0)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_32 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2)) (.cse21 (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select (select .cse20 |c_ULTIMATE.start_main_~item~0#1.base|) v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse21 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select .cse20 .cse21) v_arrayElimCell_32) 0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_30) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse23 (select .cse22 v_arrayElimCell_30))) (or (= (select (select .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse23 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse23 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (or .cse3 .cse4 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (forall ((v_arrayElimCell_30 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (let ((.cse25 (select .cse24 v_arrayElimCell_30))) (or (= (select (select .cse24 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse25 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse25 (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0))))))))))) (or .cse3 .cse4 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_31 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse27 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse26 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse27 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse26 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) .cse28)) (or .cse3 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse29 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse29 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) .cse28 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse31 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse30 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse31 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse30 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse4)))) is different from false [2022-11-25 16:50:44,174 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse0 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse2 (select v_arrayElimArr_1 4))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse2)) (= 0 (select (select .cse1 v_arrayElimCell_30) .cse2))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse4)) (= 0 (select (select .cse3 v_arrayElimCell_30) .cse4))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse5 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse6 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))))))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_31 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse7 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse8 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse7 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse9 v_arrayElimCell_32) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse10 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-11-25 16:50:44,619 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse1 (select v_arrayElimArr_1 4))) (or (= (select (select .cse0 v_arrayElimCell_30) .cse1) 0) (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse1))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse5 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse4 v_arrayElimCell_32) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse7 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse7 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse7 v_arrayElimCell_32) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse9 (select v_arrayElimArr_1 4))) (or (= (select (select .cse8 v_arrayElimCell_30) .cse9) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select .cse8 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse9))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_31 Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse10 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse11 v_arrayElimCell_31) v_arrayElimCell_32) 0) (= (select .cse10 v_arrayElimCell_32) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_31))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse12 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse6 .cse3 v_ArrVal_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_30) (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select .cse13 v_arrayElimCell_30) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))))) is different from false [2022-11-25 16:50:45,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:50:45,813 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-25 16:50:45,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2022-11-25 16:50:45,819 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-25 16:50:45,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2022-11-25 16:50:45,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:50:45,833 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-25 16:50:45,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2022-11-25 16:50:45,840 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-25 16:50:45,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 1 [2022-11-25 16:50:45,848 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-25 16:50:45,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 1 [2022-11-25 16:50:45,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:50:45,856 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-25 16:50:45,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 1 [2022-11-25 16:50:45,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:50:45,865 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-25 16:50:45,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 16:50:45,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:50:45,874 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-25 16:50:45,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 1 [2022-11-25 16:50:45,880 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-25 16:50:45,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 1 [2022-11-25 16:50:45,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:50:45,888 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-25 16:50:45,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 16:50:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:45,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709396547] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:45,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:45,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2022-11-25 16:50:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709851211] [2022-11-25 16:50:45,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:45,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-25 16:50:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:45,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-25 16:50:45,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1210, Unknown=3, NotChecked=216, Total=1560 [2022-11-25 16:50:45,896 INFO L87 Difference]: Start difference. First operand 237 states and 305 transitions. Second operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:54,596 INFO L93 Difference]: Finished difference Result 265 states and 334 transitions. [2022-11-25 16:50:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 16:50:54,597 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-25 16:50:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:54,598 INFO L225 Difference]: With dead ends: 265 [2022-11-25 16:50:54,598 INFO L226 Difference]: Without dead ends: 265 [2022-11-25 16:50:54,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=582, Invalid=3457, Unknown=5, NotChecked=378, Total=4422 [2022-11-25 16:50:54,603 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 400 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 51 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:54,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1787 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2001 Invalid, 6 Unknown, 393 Unchecked, 2.5s Time] [2022-11-25 16:50:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-25 16:50:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 240. [2022-11-25 16:50:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 200 states have (on average 1.54) internal successors, (308), 239 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 308 transitions. [2022-11-25 16:50:54,615 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 308 transitions. Word has length 39 [2022-11-25 16:50:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:54,615 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 308 transitions. [2022-11-25 16:50:54,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 308 transitions. [2022-11-25 16:50:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 16:50:54,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:54,617 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:54,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:54,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:54,824 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash 394802097, now seen corresponding path program 1 times [2022-11-25 16:50:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:54,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344750669] [2022-11-25 16:50:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:55,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:55,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344750669] [2022-11-25 16:50:55,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344750669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:55,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:55,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 16:50:55,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840354794] [2022-11-25 16:50:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:55,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 16:50:55,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:55,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 16:50:55,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:50:55,205 INFO L87 Difference]: Start difference. First operand 240 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:55,728 INFO L93 Difference]: Finished difference Result 345 states and 420 transitions. [2022-11-25 16:50:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:50:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 16:50:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:55,730 INFO L225 Difference]: With dead ends: 345 [2022-11-25 16:50:55,730 INFO L226 Difference]: Without dead ends: 345 [2022-11-25 16:50:55,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:50:55,731 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 240 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:55,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 429 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:50:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-25 16:50:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 249. [2022-11-25 16:50:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5358851674641147) internal successors, (321), 248 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 321 transitions. [2022-11-25 16:50:55,738 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 321 transitions. Word has length 41 [2022-11-25 16:50:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:55,739 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 321 transitions. [2022-11-25 16:50:55,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 321 transitions. [2022-11-25 16:50:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 16:50:55,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:55,740 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:55,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 16:50:55,740 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash -645822017, now seen corresponding path program 1 times [2022-11-25 16:50:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:55,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176451468] [2022-11-25 16:50:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:56,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:56,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176451468] [2022-11-25 16:50:56,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176451468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:56,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:56,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-25 16:50:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078094709] [2022-11-25 16:50:56,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:56,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 16:50:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:56,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 16:50:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:50:56,941 INFO L87 Difference]: Start difference. First operand 249 states and 321 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:58,594 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2022-11-25 16:50:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 16:50:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-25 16:50:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:50:58,599 INFO L225 Difference]: With dead ends: 271 [2022-11-25 16:50:58,599 INFO L226 Difference]: Without dead ends: 271 [2022-11-25 16:50:58,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 16:50:58,601 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 192 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:50:58,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 903 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:50:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-25 16:50:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 249. [2022-11-25 16:50:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5311004784688995) internal successors, (320), 248 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 320 transitions. [2022-11-25 16:50:58,607 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 320 transitions. Word has length 42 [2022-11-25 16:50:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:50:58,607 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 320 transitions. [2022-11-25 16:50:58,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 320 transitions. [2022-11-25 16:50:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 16:50:58,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:50:58,609 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:58,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 16:50:58,609 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:50:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash -327922889, now seen corresponding path program 1 times [2022-11-25 16:50:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:58,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414195362] [2022-11-25 16:50:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:59,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:59,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414195362] [2022-11-25 16:50:59,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414195362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:59,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813897999] [2022-11-25 16:50:59,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:59,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:59,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:59,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:59,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:50:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:59,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 16:50:59,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:59,387 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:50:59,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2022-11-25 16:50:59,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:50:59,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:50:59,647 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 40 treesize of output 30 [2022-11-25 16:50:59,871 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:50:59,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2022-11-25 16:51:00,117 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:51:00,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-11-25 16:51:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:00,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:51:00,386 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))) is different from false [2022-11-25 16:51:00,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 50 treesize of output 44 [2022-11-25 16:51:02,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| 0))) (let ((.cse3 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_37 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_37 0) v_antiDerIndex_entry0_1)))) (.cse4 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse2 (store .cse1 |c_ULTIMATE.start_main_~item~0#1.base| 0))) (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_37 Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse0 (select (store .cse1 v_arrayElimCell_37 0) v_antiDerIndex_entry0_1)) (= .cse0 (select .cse2 v_antiDerIndex_entry0_1))))) (or (and (< |c_ULTIMATE.start_main_~lItem~0#1.offset| 1) (< 0 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 1))) .cse3) (or .cse4 .cse3) (or (not (<= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (not .cse4) (not (<= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse2 v_antiDerIndex_entry0_1))))))) is different from false [2022-11-25 16:51:20,890 WARN L233 SmtUtils]: Spent 14.10s on a formula simplification. DAG size of input: 32 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:51:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 16:51:23,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813897999] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:51:23,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:51:23,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2022-11-25 16:51:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443211701] [2022-11-25 16:51:23,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:51:23,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 16:51:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 16:51:23,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=614, Unknown=4, NotChecked=102, Total=812 [2022-11-25 16:51:23,098 INFO L87 Difference]: Start difference. First operand 249 states and 320 transitions. Second operand has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:24,829 INFO L93 Difference]: Finished difference Result 251 states and 321 transitions. [2022-11-25 16:51:24,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:51:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 16:51:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:24,830 INFO L225 Difference]: With dead ends: 251 [2022-11-25 16:51:24,830 INFO L226 Difference]: Without dead ends: 228 [2022-11-25 16:51:24,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=179, Invalid=947, Unknown=4, NotChecked=130, Total=1260 [2022-11-25 16:51:24,832 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 39 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:24,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1228 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1292 Invalid, 0 Unknown, 213 Unchecked, 1.3s Time] [2022-11-25 16:51:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-25 16:51:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-11-25 16:51:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5851063829787233) internal successors, (298), 227 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2022-11-25 16:51:24,837 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2022-11-25 16:51:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:24,837 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2022-11-25 16:51:24,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2022-11-25 16:51:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 16:51:24,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:24,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:24,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:25,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 16:51:25,045 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1291794435, now seen corresponding path program 1 times [2022-11-25 16:51:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:25,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190081479] [2022-11-25 16:51:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:25,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:25,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190081479] [2022-11-25 16:51:25,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190081479] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:25,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437756779] [2022-11-25 16:51:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:25,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:25,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:25,154 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:25,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:51:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:25,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:51:25,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 16:51:25,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:51:25,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437756779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:25,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:51:25,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 16:51:25,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698126751] [2022-11-25 16:51:25,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:25,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:51:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:25,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:51:25,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:51:25,351 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:25,383 INFO L93 Difference]: Finished difference Result 391 states and 508 transitions. [2022-11-25 16:51:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:51:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 16:51:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:25,385 INFO L225 Difference]: With dead ends: 391 [2022-11-25 16:51:25,385 INFO L226 Difference]: Without dead ends: 389 [2022-11-25 16:51:25,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:51:25,387 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:25,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 384 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:51:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-25 16:51:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 239. [2022-11-25 16:51:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 199 states have (on average 1.5326633165829147) internal successors, (305), 238 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 305 transitions. [2022-11-25 16:51:25,393 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 305 transitions. Word has length 45 [2022-11-25 16:51:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:25,393 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 305 transitions. [2022-11-25 16:51:25,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 305 transitions. [2022-11-25 16:51:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 16:51:25,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:25,394 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 16:51:25,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:25,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 16:51:25,600 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1971852805, now seen corresponding path program 1 times [2022-11-25 16:51:25,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:25,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417175193] [2022-11-25 16:51:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:25,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:25,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417175193] [2022-11-25 16:51:25,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417175193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:25,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241397280] [2022-11-25 16:51:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:25,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:25,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:25,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:25,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:51:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:25,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 16:51:25,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:25,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:51:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:25,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241397280] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:51:25,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:51:25,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-11-25 16:51:25,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179195802] [2022-11-25 16:51:25,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:51:25,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:51:25,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:25,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:51:25,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:51:25,967 INFO L87 Difference]: Start difference. First operand 239 states and 305 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:26,084 INFO L93 Difference]: Finished difference Result 1027 states and 1353 transitions. [2022-11-25 16:51:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:51:26,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 16:51:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:26,088 INFO L225 Difference]: With dead ends: 1027 [2022-11-25 16:51:26,088 INFO L226 Difference]: Without dead ends: 1027 [2022-11-25 16:51:26,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:51:26,089 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 695 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:26,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1045 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:51:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-11-25 16:51:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 273. [2022-11-25 16:51:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.4721030042918455) internal successors, (343), 272 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2022-11-25 16:51:26,105 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 45 [2022-11-25 16:51:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:26,105 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2022-11-25 16:51:26,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2022-11-25 16:51:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 16:51:26,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:26,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:26,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:26,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 16:51:26,314 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 69553884, now seen corresponding path program 1 times [2022-11-25 16:51:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:26,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142260980] [2022-11-25 16:51:26,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:26,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:26,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142260980] [2022-11-25 16:51:26,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142260980] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:26,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989457024] [2022-11-25 16:51:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:26,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:26,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:26,656 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:26,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 16:51:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:26,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 16:51:26,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:26,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:51:27,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:27,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:27,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:27,059 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 60 treesize of output 46 [2022-11-25 16:51:27,077 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 16:51:27,077 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 33 treesize of output 27 [2022-11-25 16:51:27,156 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-11-25 16:51:27,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 16:51:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:27,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:51:27,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989457024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:27,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:51:27,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2022-11-25 16:51:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405536243] [2022-11-25 16:51:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:27,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:51:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:51:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-25 16:51:27,254 INFO L87 Difference]: Start difference. First operand 273 states and 343 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:27,720 INFO L93 Difference]: Finished difference Result 299 states and 346 transitions. [2022-11-25 16:51:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:51:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-25 16:51:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:27,722 INFO L225 Difference]: With dead ends: 299 [2022-11-25 16:51:27,722 INFO L226 Difference]: Without dead ends: 299 [2022-11-25 16:51:27,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-11-25 16:51:27,723 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 285 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:27,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 555 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:51:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-25 16:51:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 273. [2022-11-25 16:51:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.4678111587982832) internal successors, (342), 272 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2022-11-25 16:51:27,729 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 47 [2022-11-25 16:51:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:27,729 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2022-11-25 16:51:27,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2022-11-25 16:51:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 16:51:27,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:27,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:27,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:27,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-25 16:51:27,937 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash 69553885, now seen corresponding path program 1 times [2022-11-25 16:51:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:27,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732761189] [2022-11-25 16:51:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:28,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:28,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732761189] [2022-11-25 16:51:28,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732761189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:28,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955886910] [2022-11-25 16:51:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:28,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:28,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:28,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:28,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 16:51:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:28,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 16:51:28,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:28,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:51:29,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:29,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:29,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:29,108 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 60 treesize of output 46 [2022-11-25 16:51:29,126 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 16:51:29,126 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 33 treesize of output 27 [2022-11-25 16:51:29,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 16:51:29,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 16:51:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:29,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:51:29,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955886910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:29,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:51:29,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2022-11-25 16:51:29,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561923213] [2022-11-25 16:51:29,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:29,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:51:29,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:29,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:51:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-11-25 16:51:29,372 INFO L87 Difference]: Start difference. First operand 273 states and 342 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:29,804 INFO L93 Difference]: Finished difference Result 319 states and 368 transitions. [2022-11-25 16:51:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:51:29,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-25 16:51:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:29,806 INFO L225 Difference]: With dead ends: 319 [2022-11-25 16:51:29,806 INFO L226 Difference]: Without dead ends: 319 [2022-11-25 16:51:29,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-11-25 16:51:29,807 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 365 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:29,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 490 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:51:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-25 16:51:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 273. [2022-11-25 16:51:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 233 states have (on average 1.463519313304721) internal successors, (341), 272 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2022-11-25 16:51:29,818 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 47 [2022-11-25 16:51:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:29,818 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2022-11-25 16:51:29,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2022-11-25 16:51:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 16:51:29,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:29,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:29,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:30,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:30,020 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1479009528, now seen corresponding path program 1 times [2022-11-25 16:51:30,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:30,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073783079] [2022-11-25 16:51:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:30,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:30,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073783079] [2022-11-25 16:51:30,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073783079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384701632] [2022-11-25 16:51:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:30,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:30,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:51:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:30,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 16:51:30,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:30,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:51:30,537 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 16:51:30,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 16:51:30,560 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:51:30,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 16:51:30,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:30,588 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:51:30,588 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 19 treesize of output 22 [2022-11-25 16:51:30,608 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-11-25 16:51:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:30,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:51:30,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1569) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) is different from false [2022-11-25 16:51:30,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:51:30,637 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 19 treesize of output 20 [2022-11-25 16:51:30,639 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 25 [2022-11-25 16:51:30,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 16:51:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 16:51:30,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384701632] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:51:30,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:51:30,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-11-25 16:51:30,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914935271] [2022-11-25 16:51:30,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:51:30,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 16:51:30,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:30,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 16:51:30,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-11-25 16:51:30,717 INFO L87 Difference]: Start difference. First operand 273 states and 341 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:31,053 INFO L93 Difference]: Finished difference Result 273 states and 338 transitions. [2022-11-25 16:51:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:51:31,056 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-25 16:51:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:31,057 INFO L225 Difference]: With dead ends: 273 [2022-11-25 16:51:31,057 INFO L226 Difference]: Without dead ends: 273 [2022-11-25 16:51:31,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=251, Unknown=1, NotChecked=34, Total=380 [2022-11-25 16:51:31,058 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 157 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:31,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 582 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 320 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2022-11-25 16:51:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-25 16:51:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2022-11-25 16:51:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 229 states have (on average 1.4672489082969433) internal successors, (336), 268 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 336 transitions. [2022-11-25 16:51:31,064 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 336 transitions. Word has length 50 [2022-11-25 16:51:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:31,064 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 336 transitions. [2022-11-25 16:51:31,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 336 transitions. [2022-11-25 16:51:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 16:51:31,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:31,065 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:31,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:31,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 16:51:31,272 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:31,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909602, now seen corresponding path program 1 times [2022-11-25 16:51:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:31,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073724191] [2022-11-25 16:51:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 16:51:31,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:31,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073724191] [2022-11-25 16:51:31,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073724191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:31,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:31,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:51:31,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179634224] [2022-11-25 16:51:31,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:31,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:51:31,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:31,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:51:31,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:51:31,393 INFO L87 Difference]: Start difference. First operand 269 states and 336 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:31,605 INFO L93 Difference]: Finished difference Result 268 states and 334 transitions. [2022-11-25 16:51:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:51:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-25 16:51:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:31,607 INFO L225 Difference]: With dead ends: 268 [2022-11-25 16:51:31,607 INFO L226 Difference]: Without dead ends: 268 [2022-11-25 16:51:31,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:51:31,608 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 27 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:31,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 386 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:51:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-25 16:51:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-11-25 16:51:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.4585152838427948) internal successors, (334), 267 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 334 transitions. [2022-11-25 16:51:31,641 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 334 transitions. Word has length 51 [2022-11-25 16:51:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:31,642 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 334 transitions. [2022-11-25 16:51:31,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 334 transitions. [2022-11-25 16:51:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 16:51:31,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:31,642 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:31,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 16:51:31,643 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:31,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909601, now seen corresponding path program 1 times [2022-11-25 16:51:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:31,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099444786] [2022-11-25 16:51:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099444786] [2022-11-25 16:51:32,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099444786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767313641] [2022-11-25 16:51:32,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:32,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:32,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:32,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:32,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 16:51:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:32,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 16:51:32,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:32,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:32,627 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 16:51:32,627 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 25 treesize of output 23 [2022-11-25 16:51:32,808 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 23 treesize of output 15 [2022-11-25 16:51:32,811 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 26 treesize of output 14 [2022-11-25 16:51:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:32,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:51:32,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767313641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:32,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:51:32,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2022-11-25 16:51:32,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876933044] [2022-11-25 16:51:32,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:32,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 16:51:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 16:51:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-11-25 16:51:32,869 INFO L87 Difference]: Start difference. First operand 268 states and 334 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:33,506 INFO L93 Difference]: Finished difference Result 338 states and 388 transitions. [2022-11-25 16:51:33,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:51:33,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-25 16:51:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:33,508 INFO L225 Difference]: With dead ends: 338 [2022-11-25 16:51:33,508 INFO L226 Difference]: Without dead ends: 338 [2022-11-25 16:51:33,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2022-11-25 16:51:33,509 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 458 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:33,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 594 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:51:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-25 16:51:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2022-11-25 16:51:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 267 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 332 transitions. [2022-11-25 16:51:33,525 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 332 transitions. Word has length 51 [2022-11-25 16:51:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:33,525 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 332 transitions. [2022-11-25 16:51:33,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 332 transitions. [2022-11-25 16:51:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:51:33,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:33,526 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:33,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:33,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:33,732 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash 455851009, now seen corresponding path program 1 times [2022-11-25 16:51:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:33,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21863211] [2022-11-25 16:51:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:34,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21863211] [2022-11-25 16:51:34,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21863211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:34,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091012338] [2022-11-25 16:51:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:34,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:34,152 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:34,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 16:51:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:34,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 16:51:34,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:34,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:34,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:34,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:51:34,588 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-11-25 16:51:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:34,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:51:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:34,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091012338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:51:34,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:51:34,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-25 16:51:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615030067] [2022-11-25 16:51:34,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:51:34,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 16:51:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 16:51:34,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-25 16:51:34,809 INFO L87 Difference]: Start difference. First operand 268 states and 332 transitions. Second operand has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:35,331 INFO L93 Difference]: Finished difference Result 288 states and 334 transitions. [2022-11-25 16:51:35,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:51:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-25 16:51:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:35,345 INFO L225 Difference]: With dead ends: 288 [2022-11-25 16:51:35,345 INFO L226 Difference]: Without dead ends: 288 [2022-11-25 16:51:35,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-11-25 16:51:35,346 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 671 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:35,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 779 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:51:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-25 16:51:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2022-11-25 16:51:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.445414847161572) internal successors, (331), 267 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 331 transitions. [2022-11-25 16:51:35,352 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 331 transitions. Word has length 55 [2022-11-25 16:51:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:35,352 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 331 transitions. [2022-11-25 16:51:35,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 331 transitions. [2022-11-25 16:51:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 16:51:35,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:35,354 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:35,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:35,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:35,560 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash -429024641, now seen corresponding path program 1 times [2022-11-25 16:51:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:35,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363949929] [2022-11-25 16:51:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:37,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:37,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363949929] [2022-11-25 16:51:37,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363949929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:37,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259574836] [2022-11-25 16:51:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:37,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:37,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:37,059 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:37,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 16:51:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:37,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 16:51:37,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:37,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:51:37,349 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:51:37,350 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 12 treesize of output 14 [2022-11-25 16:51:37,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:37,542 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-25 16:51:37,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-25 16:51:37,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-25 16:51:37,654 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 24 [2022-11-25 16:51:37,703 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 24 [2022-11-25 16:51:37,809 INFO L321 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2022-11-25 16:51:37,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2022-11-25 16:51:37,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 16:51:38,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:38,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-25 16:51:38,168 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:51:38,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2022-11-25 16:51:38,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:51:38,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:38,991 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 33 [2022-11-25 16:51:38,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 16:51:39,385 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 16:51:39,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-11-25 16:51:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:39,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:51:40,090 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-11-25 16:51:42,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:51:42,179 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 220 treesize of output 150 [2022-11-25 16:51:42,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:51:42,201 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 871 treesize of output 864 [2022-11-25 16:51:42,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 849 treesize of output 769 [2022-11-25 16:51:42,230 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 187 treesize of output 179 [2022-11-25 16:51:42,257 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 366 treesize of output 350 [2022-11-25 16:51:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:44,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259574836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:51:44,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:51:44,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 23] total 58 [2022-11-25 16:51:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440104640] [2022-11-25 16:51:44,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:51:44,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-25 16:51:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-25 16:51:44,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=3049, Unknown=18, NotChecked=0, Total=3422 [2022-11-25 16:51:44,210 INFO L87 Difference]: Start difference. First operand 268 states and 331 transitions. Second operand has 59 states, 58 states have (on average 2.8275862068965516) internal successors, (164), 59 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:50,779 INFO L93 Difference]: Finished difference Result 437 states and 518 transitions. [2022-11-25 16:51:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 16:51:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.8275862068965516) internal successors, (164), 59 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 16:51:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:50,782 INFO L225 Difference]: With dead ends: 437 [2022-11-25 16:51:50,782 INFO L226 Difference]: Without dead ends: 437 [2022-11-25 16:51:50,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=820, Invalid=5640, Unknown=20, NotChecked=0, Total=6480 [2022-11-25 16:51:50,784 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 522 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 91 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:50,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 2119 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3021 Invalid, 20 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 16:51:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-25 16:51:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 266. [2022-11-25 16:51:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 265 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 326 transitions. [2022-11-25 16:51:50,791 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 326 transitions. Word has length 58 [2022-11-25 16:51:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:50,791 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 326 transitions. [2022-11-25 16:51:50,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.8275862068965516) internal successors, (164), 59 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:51:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 326 transitions. [2022-11-25 16:51:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 16:51:50,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:50,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:50,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 16:51:50,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-25 16:51:50,999 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-25 16:51:50,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:50,999 INFO L85 PathProgramCache]: Analyzing trace with hash -429024640, now seen corresponding path program 1 times [2022-11-25 16:51:51,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:51,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518208444] [2022-11-25 16:51:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:52,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:52,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518208444] [2022-11-25 16:51:52,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518208444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:51:52,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688462076] [2022-11-25 16:51:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:52,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:51:52,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:52,699 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:51:52,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c705d013-27b8-4d92-977f-20cb6edae3fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 16:51:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:52,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-25 16:51:52,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:51:52,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:51:52,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:51:53,035 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:51:53,035 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 12 treesize of output 18 [2022-11-25 16:51:53,057 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 16:51:53,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 16:51:53,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:53,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:51:53,307 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-25 16:51:53,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-11-25 16:51:53,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 16:51:53,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-25 16:51:53,424 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-11-25 16:51:53,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-25 16:51:53,510 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-11-25 16:51:53,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-25 16:51:53,568 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-11-25 16:51:53,633 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-25 16:51:53,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 16:51:53,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 16:51:53,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 16:51:53,809 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-11-25 16:51:53,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:53,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-25 16:51:53,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:53,877 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 19 treesize of output 18 [2022-11-25 16:51:53,950 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:51:53,950 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 67 treesize of output 58 [2022-11-25 16:51:53,964 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 27 treesize of output 22 [2022-11-25 16:51:54,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:51:54,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:54,332 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 31 [2022-11-25 16:51:54,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:51:54,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:51:54,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2022-11-25 16:51:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:51:54,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:52:04,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:52:04,899 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 152 treesize of output 143 [2022-11-25 16:52:04,914 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 896 treesize of output 890 [2022-11-25 16:52:04,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:52:04,928 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 1177 treesize of output 747 [2022-11-25 16:52:04,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:52:04,970 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 3863 treesize of output 3843 [2022-11-25 16:52:05,004 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 2966 treesize of output 2838 [2022-11-25 16:52:05,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 3611 treesize of output 3599 [2022-11-25 16:52:05,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4423 treesize of output 4303 [2022-11-25 16:52:05,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 16:52:05,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:52:05,535 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 4065 treesize of output 4061 [2022-11-25 16:56:47,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:56:47,694 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 309 treesize of output 279 [2022-11-25 16:56:47,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:56:47,735 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 3721 treesize of output 3714 [2022-11-25 16:56:47,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:56:47,763 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 3891 treesize of output 2541 [2022-11-25 16:56:47,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:56:47,819 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 14989 treesize of output 14863 [2022-11-25 16:56:47,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14315 treesize of output 13547 [2022-11-25 16:56:47,951 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 14489 treesize of output 14297 [2022-11-25 16:56:48,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17299 treesize of output 16515 [2022-11-25 16:56:48,237 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 4535 treesize of output 4351 [2022-11-25 16:56:48,326 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 8886 treesize of output 8518 [2022-11-25 16:56:48,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 16:58:16,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:16,962 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 10622 treesize of output 10302