./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/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_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-13 11:44:02,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:44:02,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:44:02,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:44:02,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:44:02,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:44:02,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:44:02,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:44:02,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:44:02,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:44:02,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:44:02,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:44:02,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:44:02,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:44:02,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:44:02,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:44:02,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:44:02,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:44:02,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:44:02,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:44:02,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:44:02,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:44:02,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:44:02,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:44:02,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:44:02,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:44:02,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:44:02,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:44:02,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:44:02,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:44:02,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:44:02,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:44:02,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:44:02,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:44:02,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:44:02,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:44:02,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:44:02,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:44:02,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:44:02,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:44:02,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:44:02,314 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 11:44:02,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:44:02,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:44:02,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:44:02,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:44:02,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:44:02,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:44:02,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:44:02,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:44:02,335 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:44:02,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:44:02,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:44:02,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 11:44:02,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:44:02,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:44:02,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:44:02,336 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 11:44:02,337 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 11:44:02,337 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 11:44:02,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:44:02,337 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 11:44:02,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:44:02,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:44:02,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:44:02,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:44:02,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:44:02,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:44:02,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:44:02,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:44:02,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:44:02,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:44:02,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:44:02,339 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:44:02,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:44:02,339 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:44:02,339 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_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2022-12-13 11:44:02,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:44:02,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:44:02,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:44:02,551 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:44:02,551 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:44:02,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-12-13 11:44:05,084 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:44:05,285 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:44:05,285 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-12-13 11:44:05,293 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/data/71c3af86e/f0890d71d1184798b12401c360fbdd35/FLAGad8d1f25c [2022-12-13 11:44:05,676 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/data/71c3af86e/f0890d71d1184798b12401c360fbdd35 [2022-12-13 11:44:05,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:44:05,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:44:05,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:44:05,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:44:05,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:44:05,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:05,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694cfe8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05, skipping insertion in model container [2022-12-13 11:44:05,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:05,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:44:05,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:44:05,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:44:05,895 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:44:05,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:44:05,955 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:44:05,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05 WrapperNode [2022-12-13 11:44:05,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:44:05,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:44:05,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:44:05,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:44:05,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:05,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:05,988 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2022-12-13 11:44:05,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:44:05,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:44:05,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:44:05,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:44:05,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:05,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:05,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:05,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:06,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:06,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:06,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:06,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:06,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:44:06,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:44:06,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:44:06,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:44:06,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (1/1) ... [2022-12-13 11:44:06,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:44:06,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:06,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:44:06,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:44:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:44:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:44:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:44:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:44:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 11:44:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 11:44:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:44:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:44:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:44:06,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:44:06,164 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:44:06,165 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:44:06,508 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:44:06,515 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:44:06,515 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 11:44:06,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:44:06 BoogieIcfgContainer [2022-12-13 11:44:06,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:44:06,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:44:06,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:44:06,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:44:06,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:44:05" (1/3) ... [2022-12-13 11:44:06,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1fca5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:44:06, skipping insertion in model container [2022-12-13 11:44:06,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:44:05" (2/3) ... [2022-12-13 11:44:06,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1fca5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:44:06, skipping insertion in model container [2022-12-13 11:44:06,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:44:06" (3/3) ... [2022-12-13 11:44:06,526 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2022-12-13 11:44:06,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:44:06,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-12-13 11:44:06,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:44:06,597 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;@17816e39, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:44:06,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-12-13 11:44:06,609 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-12-13 11:44:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 11:44:06,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:06,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:44:06,615 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-12-13 11:44:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash 28769460, now seen corresponding path program 1 times [2022-12-13 11:44:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:06,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515518557] [2022-12-13 11:44:06,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:06,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:06,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:06,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515518557] [2022-12-13 11:44:06,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515518557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:06,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:06,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:44:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171292424] [2022-12-13 11:44:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:06,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:44:06,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:06,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:44:06,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:44:06,783 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-12-13 11:44:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:06,800 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-12-13 11:44:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:44:06,802 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-12-13 11:44:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:06,811 INFO L225 Difference]: With dead ends: 151 [2022-12-13 11:44:06,811 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 11:44:06,812 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-12-13 11:44:06,815 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-12-13 11:44:06,815 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-12-13 11:44:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 11:44:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-12-13 11:44:06,841 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-12-13 11:44:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-12-13 11:44:06,843 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2022-12-13 11:44:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:06,844 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-12-13 11:44:06,844 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-12-13 11:44:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-12-13 11:44:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 11:44:06,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:06,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:44:06,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:44:06,845 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-12-13 11:44:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849456, now seen corresponding path program 1 times [2022-12-13 11:44:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:06,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272510723] [2022-12-13 11:44:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272510723] [2022-12-13 11:44:06,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272510723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:06,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:06,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:44:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907701906] [2022-12-13 11:44:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:06,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:44:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:44:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:06,887 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-12-13 11:44:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:07,020 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2022-12-13 11:44:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:44:07,020 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-12-13 11:44:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:07,023 INFO L225 Difference]: With dead ends: 196 [2022-12-13 11:44:07,023 INFO L226 Difference]: Without dead ends: 195 [2022-12-13 11:44:07,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,025 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:07,026 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.1s Time] [2022-12-13 11:44:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-12-13 11:44:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2022-12-13 11:44:07,036 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-12-13 11:44:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2022-12-13 11:44:07,038 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2022-12-13 11:44:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:07,038 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2022-12-13 11:44:07,038 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-12-13 11:44:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2022-12-13 11:44:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 11:44:07,039 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:07,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:44:07,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:44:07,040 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-12-13 11:44:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:07,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849360, now seen corresponding path program 1 times [2022-12-13 11:44:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:07,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404291966] [2022-12-13 11:44:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:07,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404291966] [2022-12-13 11:44:07,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404291966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:07,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:07,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:44:07,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892615955] [2022-12-13 11:44:07,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:07,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:44:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:07,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:44:07,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,089 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-12-13 11:44:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:07,142 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2022-12-13 11:44:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:44:07,142 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-12-13 11:44:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:07,143 INFO L225 Difference]: With dead ends: 173 [2022-12-13 11:44:07,143 INFO L226 Difference]: Without dead ends: 172 [2022-12-13 11:44:07,144 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-12-13 11:44:07,145 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:07,145 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.0s Time] [2022-12-13 11:44:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-13 11:44:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-12-13 11:44:07,153 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-12-13 11:44:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2022-12-13 11:44:07,154 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 7 [2022-12-13 11:44:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:07,154 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2022-12-13 11:44:07,154 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-12-13 11:44:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2022-12-13 11:44:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 11:44:07,155 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:07,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:44:07,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:44:07,155 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-12-13 11:44:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2022-12-13 11:44:07,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:07,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269881248] [2022-12-13 11:44:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:07,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269881248] [2022-12-13 11:44:07,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269881248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:07,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:07,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:44:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255497156] [2022-12-13 11:44:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:07,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:44:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:44:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,217 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-12-13 11:44:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:07,318 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2022-12-13 11:44:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:44:07,318 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-12-13 11:44:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:07,319 INFO L225 Difference]: With dead ends: 191 [2022-12-13 11:44:07,319 INFO L226 Difference]: Without dead ends: 191 [2022-12-13 11:44:07,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,320 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:07,321 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.1s Time] [2022-12-13 11:44:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-13 11:44:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2022-12-13 11:44:07,325 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-12-13 11:44:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2022-12-13 11:44:07,326 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2022-12-13 11:44:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:07,326 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2022-12-13 11:44:07,327 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-12-13 11:44:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2022-12-13 11:44:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 11:44:07,327 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:07,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:44:07,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:44:07,327 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-12-13 11:44:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2022-12-13 11:44:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:07,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344585800] [2022-12-13 11:44:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:07,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:07,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344585800] [2022-12-13 11:44:07,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344585800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:07,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:07,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:44:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431639889] [2022-12-13 11:44:07,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:07,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:44:07,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:07,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:44:07,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,382 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-12-13 11:44:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:07,462 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-12-13 11:44:07,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:44:07,462 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-12-13 11:44:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:07,463 INFO L225 Difference]: With dead ends: 157 [2022-12-13 11:44:07,463 INFO L226 Difference]: Without dead ends: 157 [2022-12-13 11:44:07,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,465 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-12-13 11:44:07,465 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-12-13 11:44:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-13 11:44:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-12-13 11:44:07,474 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-12-13 11:44:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2022-12-13 11:44:07,475 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 7 [2022-12-13 11:44:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:07,475 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2022-12-13 11:44:07,475 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-12-13 11:44:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-12-13 11:44:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 11:44:07,476 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:07,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:44:07,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:44:07,476 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-12-13 11:44:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1188718309, now seen corresponding path program 1 times [2022-12-13 11:44:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:07,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31816681] [2022-12-13 11:44:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:07,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:07,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31816681] [2022-12-13 11:44:07,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31816681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:07,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:07,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:44:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949225309] [2022-12-13 11:44:07,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:07,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:44:07,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:07,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:44:07,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:44:07,533 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-12-13 11:44:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:07,564 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2022-12-13 11:44:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:44:07,564 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-12-13 11:44:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:07,566 INFO L225 Difference]: With dead ends: 295 [2022-12-13 11:44:07,566 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 11:44:07,566 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-12-13 11:44:07,567 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-12-13 11:44:07,568 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-12-13 11:44:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 11:44:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2022-12-13 11:44:07,573 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-12-13 11:44:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2022-12-13 11:44:07,574 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2022-12-13 11:44:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:07,575 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2022-12-13 11:44:07,575 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-12-13 11:44:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2022-12-13 11:44:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 11:44:07,576 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:07,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:44:07,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:44:07,576 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-12-13 11:44:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682520, now seen corresponding path program 1 times [2022-12-13 11:44:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:07,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813464032] [2022-12-13 11:44:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:07,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:07,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813464032] [2022-12-13 11:44:07,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813464032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:07,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:07,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:44:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95428457] [2022-12-13 11:44:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:07,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:44:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:44:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,653 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-12-13 11:44:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:07,721 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-12-13 11:44:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:44:07,721 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-12-13 11:44:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:07,722 INFO L225 Difference]: With dead ends: 156 [2022-12-13 11:44:07,723 INFO L226 Difference]: Without dead ends: 156 [2022-12-13 11:44:07,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,723 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-13 11:44:07,724 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-12-13 11:44:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-12-13 11:44:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-12-13 11:44:07,726 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-12-13 11:44:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2022-12-13 11:44:07,727 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2022-12-13 11:44:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:07,727 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2022-12-13 11:44:07,727 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-12-13 11:44:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-12-13 11:44:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 11:44:07,728 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:07,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:44:07,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:44:07,728 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-12-13 11:44:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682519, now seen corresponding path program 1 times [2022-12-13 11:44:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:07,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673950772] [2022-12-13 11:44:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:07,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:07,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673950772] [2022-12-13 11:44:07,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673950772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:07,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:07,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:44:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898919791] [2022-12-13 11:44:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:07,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:44:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:44:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,795 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-12-13 11:44:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:07,862 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-12-13 11:44:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:44:07,862 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-12-13 11:44:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:07,863 INFO L225 Difference]: With dead ends: 153 [2022-12-13 11:44:07,863 INFO L226 Difference]: Without dead ends: 153 [2022-12-13 11:44:07,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:44:07,864 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-12-13 11:44:07,865 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-12-13 11:44:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-12-13 11:44:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-12-13 11:44:07,868 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-12-13 11:44:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2022-12-13 11:44:07,869 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2022-12-13 11:44:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:07,869 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2022-12-13 11:44:07,869 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-12-13 11:44:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-12-13 11:44:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 11:44:07,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:07,870 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-12-13 11:44:07,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:44:07,871 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-12-13 11:44:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351565, now seen corresponding path program 1 times [2022-12-13 11:44:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:07,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423884250] [2022-12-13 11:44:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:07,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:07,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:07,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423884250] [2022-12-13 11:44:07,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423884250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:07,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:07,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:44:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891002630] [2022-12-13 11:44:07,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:07,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:44:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:44:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:44:07,934 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-12-13 11:44:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:08,007 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2022-12-13 11:44:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:44:08,007 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-12-13 11:44:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:08,008 INFO L225 Difference]: With dead ends: 261 [2022-12-13 11:44:08,008 INFO L226 Difference]: Without dead ends: 261 [2022-12-13 11:44:08,008 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-12-13 11:44:08,008 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-12-13 11:44:08,008 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-12-13 11:44:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-13 11:44:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2022-12-13 11:44:08,011 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-12-13 11:44:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2022-12-13 11:44:08,011 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2022-12-13 11:44:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:08,011 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2022-12-13 11:44:08,011 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-12-13 11:44:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2022-12-13 11:44:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 11:44:08,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:08,012 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-12-13 11:44:08,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:44:08,012 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-12-13 11:44:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351469, now seen corresponding path program 1 times [2022-12-13 11:44:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:08,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674066204] [2022-12-13 11:44:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:08,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:08,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674066204] [2022-12-13 11:44:08,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674066204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:08,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:08,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:44:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651740889] [2022-12-13 11:44:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:08,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:44:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:44:08,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:44:08,086 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-12-13 11:44:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:08,189 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2022-12-13 11:44:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:44:08,189 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-12-13 11:44:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:08,190 INFO L225 Difference]: With dead ends: 147 [2022-12-13 11:44:08,190 INFO L226 Difference]: Without dead ends: 147 [2022-12-13 11:44:08,190 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-12-13 11:44:08,191 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:08,191 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.1s Time] [2022-12-13 11:44:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-13 11:44:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-12-13 11:44:08,193 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-12-13 11:44:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2022-12-13 11:44:08,194 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 24 [2022-12-13 11:44:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:08,194 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2022-12-13 11:44:08,194 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-12-13 11:44:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2022-12-13 11:44:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 11:44:08,195 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:08,195 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-12-13 11:44:08,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:44:08,195 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-12-13 11:44:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351470, now seen corresponding path program 1 times [2022-12-13 11:44:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:08,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734704114] [2022-12-13 11:44:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:08,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734704114] [2022-12-13 11:44:08,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734704114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:08,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:08,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:44:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979739588] [2022-12-13 11:44:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:08,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:44:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:44:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:44:08,324 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-12-13 11:44:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:08,501 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2022-12-13 11:44:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:44:08,502 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-12-13 11:44:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:08,503 INFO L225 Difference]: With dead ends: 239 [2022-12-13 11:44:08,503 INFO L226 Difference]: Without dead ends: 239 [2022-12-13 11:44:08,503 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-12-13 11:44:08,504 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 325 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:08,504 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.1s Time] [2022-12-13 11:44:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-12-13 11:44:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 185. [2022-12-13 11:44:08,508 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-12-13 11:44:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2022-12-13 11:44:08,509 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 24 [2022-12-13 11:44:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:08,509 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2022-12-13 11:44:08,510 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-12-13 11:44:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2022-12-13 11:44:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 11:44:08,510 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:08,510 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-12-13 11:44:08,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:44:08,511 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-12-13 11:44:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 611618329, now seen corresponding path program 1 times [2022-12-13 11:44:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:08,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639220604] [2022-12-13 11:44:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:08,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:08,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639220604] [2022-12-13 11:44:08,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639220604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:08,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:08,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:44:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601198302] [2022-12-13 11:44:08,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:08,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:44:08,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:44:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:44:08,579 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-12-13 11:44:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:08,679 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2022-12-13 11:44:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:44:08,679 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-12-13 11:44:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:08,681 INFO L225 Difference]: With dead ends: 238 [2022-12-13 11:44:08,681 INFO L226 Difference]: Without dead ends: 238 [2022-12-13 11:44:08,681 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-12-13 11:44:08,682 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-12-13 11:44:08,682 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-12-13 11:44:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-12-13 11:44:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2022-12-13 11:44:08,685 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-12-13 11:44:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2022-12-13 11:44:08,685 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 29 [2022-12-13 11:44:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:08,685 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2022-12-13 11:44:08,685 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-12-13 11:44:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2022-12-13 11:44:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 11:44:08,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:08,686 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-12-13 11:44:08,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:44:08,686 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-12-13 11:44:08,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash 610479294, now seen corresponding path program 1 times [2022-12-13 11:44:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:08,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065871240] [2022-12-13 11:44:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:08,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065871240] [2022-12-13 11:44:08,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065871240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:08,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:08,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:44:08,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438818280] [2022-12-13 11:44:08,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:08,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:44:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:44:08,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:44:08,838 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-12-13 11:44:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:09,024 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2022-12-13 11:44:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:44:09,024 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-12-13 11:44:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:09,025 INFO L225 Difference]: With dead ends: 213 [2022-12-13 11:44:09,025 INFO L226 Difference]: Without dead ends: 213 [2022-12-13 11:44:09,026 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-12-13 11:44:09,026 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 18 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:09,027 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.2s Time] [2022-12-13 11:44:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-12-13 11:44:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2022-12-13 11:44:09,031 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-12-13 11:44:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2022-12-13 11:44:09,031 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 29 [2022-12-13 11:44:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:09,032 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2022-12-13 11:44:09,032 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-12-13 11:44:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2022-12-13 11:44:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 11:44:09,032 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:09,033 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-12-13 11:44:09,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:44:09,033 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-12-13 11:44:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:09,033 INFO L85 PathProgramCache]: Analyzing trace with hash 610479295, now seen corresponding path program 1 times [2022-12-13 11:44:09,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:09,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103694455] [2022-12-13 11:44:09,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:09,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:09,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:09,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103694455] [2022-12-13 11:44:09,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103694455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:09,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:09,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:44:09,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411136829] [2022-12-13 11:44:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:09,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:44:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:44:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:44:09,264 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-12-13 11:44:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:09,362 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2022-12-13 11:44:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:44:09,362 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-12-13 11:44:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:09,363 INFO L225 Difference]: With dead ends: 225 [2022-12-13 11:44:09,363 INFO L226 Difference]: Without dead ends: 225 [2022-12-13 11:44:09,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-12-13 11:44:09,363 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:09,364 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.1s Time] [2022-12-13 11:44:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-13 11:44:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2022-12-13 11:44:09,366 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-12-13 11:44:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2022-12-13 11:44:09,367 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 29 [2022-12-13 11:44:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:09,367 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2022-12-13 11:44:09,367 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-12-13 11:44:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2022-12-13 11:44:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 11:44:09,368 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:09,368 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-12-13 11:44:09,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:44:09,368 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-12-13 11:44:09,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604246, now seen corresponding path program 1 times [2022-12-13 11:44:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:09,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598645714] [2022-12-13 11:44:09,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:09,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:09,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:09,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598645714] [2022-12-13 11:44:09,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598645714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:09,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:09,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:44:09,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817964787] [2022-12-13 11:44:09,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:09,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:44:09,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:09,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:44:09,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:44:09,662 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-12-13 11:44:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:10,096 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2022-12-13 11:44:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:44:10,097 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-12-13 11:44:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:10,099 INFO L225 Difference]: With dead ends: 307 [2022-12-13 11:44:10,099 INFO L226 Difference]: Without dead ends: 307 [2022-12-13 11:44:10,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:44:10,100 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 205 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:10,100 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.3s Time] [2022-12-13 11:44:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-13 11:44:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 220. [2022-12-13 11:44:10,106 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-12-13 11:44:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2022-12-13 11:44:10,107 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 32 [2022-12-13 11:44:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:10,107 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2022-12-13 11:44:10,107 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-12-13 11:44:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2022-12-13 11:44:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 11:44:10,107 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:10,107 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-12-13 11:44:10,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:44:10,108 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-12-13 11:44:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604247, now seen corresponding path program 1 times [2022-12-13 11:44:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:10,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674775806] [2022-12-13 11:44:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:10,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:10,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674775806] [2022-12-13 11:44:10,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674775806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:10,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:10,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:44:10,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291920610] [2022-12-13 11:44:10,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:10,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:44:10,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:10,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:44:10,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:44:10,457 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-12-13 11:44:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:10,825 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-12-13 11:44:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:44:10,826 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-12-13 11:44:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:10,827 INFO L225 Difference]: With dead ends: 309 [2022-12-13 11:44:10,827 INFO L226 Difference]: Without dead ends: 309 [2022-12-13 11:44:10,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:44:10,827 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 188 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:10,828 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.2s Time] [2022-12-13 11:44:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-12-13 11:44:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2022-12-13 11:44:10,830 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-12-13 11:44:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2022-12-13 11:44:10,831 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 32 [2022-12-13 11:44:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:10,831 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2022-12-13 11:44:10,831 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-12-13 11:44:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2022-12-13 11:44:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 11:44:10,832 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:10,832 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-12-13 11:44:10,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:44:10,832 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-12-13 11:44:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1655909309, now seen corresponding path program 1 times [2022-12-13 11:44:10,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:10,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223266375] [2022-12-13 11:44:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:11,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:11,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223266375] [2022-12-13 11:44:11,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223266375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:11,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:11,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:44:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981784269] [2022-12-13 11:44:11,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:11,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:44:11,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:11,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:44:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:44:11,020 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-12-13 11:44:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:11,190 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2022-12-13 11:44:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:44:11,190 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-12-13 11:44:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:11,191 INFO L225 Difference]: With dead ends: 254 [2022-12-13 11:44:11,191 INFO L226 Difference]: Without dead ends: 254 [2022-12-13 11:44:11,191 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-12-13 11:44:11,192 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 55 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:11,192 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.1s Time] [2022-12-13 11:44:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-12-13 11:44:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2022-12-13 11:44:11,196 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-12-13 11:44:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2022-12-13 11:44:11,197 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 33 [2022-12-13 11:44:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:11,197 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2022-12-13 11:44:11,197 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-12-13 11:44:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2022-12-13 11:44:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 11:44:11,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:11,198 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-12-13 11:44:11,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:44:11,198 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-12-13 11:44:11,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash 206446071, now seen corresponding path program 1 times [2022-12-13 11:44:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:11,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127049488] [2022-12-13 11:44:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:11,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:44:11,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:11,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127049488] [2022-12-13 11:44:11,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127049488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:11,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:11,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:44:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803380017] [2022-12-13 11:44:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:11,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:44:11,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:44:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:44:11,255 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-12-13 11:44:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:11,390 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-12-13 11:44:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:44:11,390 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-12-13 11:44:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:11,391 INFO L225 Difference]: With dead ends: 299 [2022-12-13 11:44:11,391 INFO L226 Difference]: Without dead ends: 299 [2022-12-13 11:44:11,391 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-12-13 11:44:11,392 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:11,392 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.1s Time] [2022-12-13 11:44:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-12-13 11:44:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 228. [2022-12-13 11:44:11,397 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-12-13 11:44:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2022-12-13 11:44:11,398 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 34 [2022-12-13 11:44:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:11,398 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2022-12-13 11:44:11,398 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-12-13 11:44:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2022-12-13 11:44:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 11:44:11,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:11,399 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-12-13 11:44:11,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:44:11,399 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-12-13 11:44:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash 206446072, now seen corresponding path program 1 times [2022-12-13 11:44:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:11,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199333084] [2022-12-13 11:44:11,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:11,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199333084] [2022-12-13 11:44:11,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199333084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:11,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:11,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:44:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118768516] [2022-12-13 11:44:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:11,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:44:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:44:11,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:44:11,925 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-12-13 11:44:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:12,579 INFO L93 Difference]: Finished difference Result 293 states and 367 transitions. [2022-12-13 11:44:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:44:12,579 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-12-13 11:44:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:12,580 INFO L225 Difference]: With dead ends: 293 [2022-12-13 11:44:12,580 INFO L226 Difference]: Without dead ends: 293 [2022-12-13 11:44:12,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2022-12-13 11:44:12,580 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:12,580 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.4s Time] [2022-12-13 11:44:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-12-13 11:44:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2022-12-13 11:44:12,583 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-12-13 11:44:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 305 transitions. [2022-12-13 11:44:12,584 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 305 transitions. Word has length 34 [2022-12-13 11:44:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:12,584 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 305 transitions. [2022-12-13 11:44:12,584 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-12-13 11:44:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 305 transitions. [2022-12-13 11:44:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 11:44:12,584 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:12,584 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-12-13 11:44:12,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:44:12,584 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-12-13 11:44:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1585985001, now seen corresponding path program 1 times [2022-12-13 11:44:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:12,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901689063] [2022-12-13 11:44:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:13,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901689063] [2022-12-13 11:44:13,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901689063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:13,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920986211] [2022-12-13 11:44:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:13,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:13,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:13,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:13,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:44:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:13,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 11:44:13,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:13,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:13,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:13,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:13,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:44:13,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:13,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:44:13,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:13,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:44:13,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:13,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:44:13,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:13,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:44:13,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:13,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:44:13,515 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:44:13,515 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-12-13 11:44:13,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 11:44:13,539 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:44:13,539 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-12-13 11:44:13,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 11:44:13,640 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-12-13 11:44:13,645 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-12-13 11:44:14,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:44:14,333 INFO L321 Elim1Store]: treesize reduction 116, result has 24.2 percent of original size [2022-12-13 11:44:14,333 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-12-13 11:44:14,394 INFO L321 Elim1Store]: treesize reduction 116, result has 24.2 percent of original size [2022-12-13 11:44:14,394 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-12-13 11:44:14,420 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-12-13 11:44:14,420 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-12-13 11:44:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:14,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:44:14,612 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-12-13 11:44:15,244 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-12-13 11:44:15,244 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-12-13 11:44:15,251 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-12-13 11:44:15,663 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-12-13 11:44:15,664 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-12-13 11:44:15,670 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-12-13 11:44:16,196 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-12-13 11:44:16,935 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-12-13 11:44:17,136 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-12-13 11:44:17,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:44:17,836 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 11:44:17,837 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-12-13 11:44:17,841 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-12-13 11:44:17,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 29 treesize of output 1 [2022-12-13 11:44:17,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:44:17,847 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 11:44:17,848 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-12-13 11:44:17,852 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-12-13 11:44:17,853 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-12-13 11:44:17,858 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-12-13 11:44:17,858 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-12-13 11:44:17,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:44:17,864 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 11:44:17,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 49 treesize of output 1 [2022-12-13 11:44:17,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:44:17,870 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 11:44:17,870 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-12-13 11:44:17,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:44:17,877 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 11:44:17,877 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-12-13 11:44:17,881 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-12-13 11:44:17,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-12-13 11:44:17,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:44:17,887 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 11:44:17,887 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-12-13 11:44:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:17,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920986211] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:44:17,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:44:17,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2022-12-13 11:44:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953185445] [2022-12-13 11:44:17,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:44:17,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 11:44:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 11:44:17,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1210, Unknown=3, NotChecked=216, Total=1560 [2022-12-13 11:44:17,892 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-12-13 11:44:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:23,420 INFO L93 Difference]: Finished difference Result 265 states and 334 transitions. [2022-12-13 11:44:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 11:44:23,421 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-12-13 11:44:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:23,421 INFO L225 Difference]: With dead ends: 265 [2022-12-13 11:44:23,421 INFO L226 Difference]: Without dead ends: 265 [2022-12-13 11:44:23,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=582, Invalid=3457, Unknown=5, NotChecked=378, Total=4422 [2022-12-13 11:44:23,422 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 400 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 51 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:23,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1787 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2001 Invalid, 6 Unknown, 393 Unchecked, 1.6s Time] [2022-12-13 11:44:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-12-13 11:44:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 240. [2022-12-13 11:44:23,425 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-12-13 11:44:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 308 transitions. [2022-12-13 11:44:23,426 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 308 transitions. Word has length 39 [2022-12-13 11:44:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:23,426 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 308 transitions. [2022-12-13 11:44:23,426 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-12-13 11:44:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 308 transitions. [2022-12-13 11:44:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 11:44:23,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:23,427 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-12-13 11:44:23,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 11:44:23,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:23,628 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-12-13 11:44:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:23,630 INFO L85 PathProgramCache]: Analyzing trace with hash 394802097, now seen corresponding path program 1 times [2022-12-13 11:44:23,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:23,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060227522] [2022-12-13 11:44:23,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:23,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060227522] [2022-12-13 11:44:23,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060227522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:23,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:23,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:44:23,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178926072] [2022-12-13 11:44:23,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:23,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:44:23,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:23,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:44:23,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:44:23,860 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-12-13 11:44:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:24,160 INFO L93 Difference]: Finished difference Result 345 states and 420 transitions. [2022-12-13 11:44:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:44:24,160 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-12-13 11:44:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:24,161 INFO L225 Difference]: With dead ends: 345 [2022-12-13 11:44:24,161 INFO L226 Difference]: Without dead ends: 345 [2022-12-13 11:44:24,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:44:24,162 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 240 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:24,162 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.2s Time] [2022-12-13 11:44:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-12-13 11:44:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 249. [2022-12-13 11:44:24,171 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-12-13 11:44:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 321 transitions. [2022-12-13 11:44:24,171 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 321 transitions. Word has length 41 [2022-12-13 11:44:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:24,172 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 321 transitions. [2022-12-13 11:44:24,172 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-12-13 11:44:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 321 transitions. [2022-12-13 11:44:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 11:44:24,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:24,172 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-12-13 11:44:24,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 11:44:24,173 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-12-13 11:44:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash -645822017, now seen corresponding path program 1 times [2022-12-13 11:44:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:24,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396838636] [2022-12-13 11:44:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396838636] [2022-12-13 11:44:24,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396838636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:24,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:24,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-13 11:44:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307734989] [2022-12-13 11:44:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:24,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 11:44:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 11:44:24,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:44:24,830 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-12-13 11:44:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:25,688 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2022-12-13 11:44:25,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 11:44:25,688 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-12-13 11:44:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:25,689 INFO L225 Difference]: With dead ends: 271 [2022-12-13 11:44:25,689 INFO L226 Difference]: Without dead ends: 271 [2022-12-13 11:44:25,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 11:44:25,689 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 192 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:25,689 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.4s Time] [2022-12-13 11:44:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-12-13 11:44:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 249. [2022-12-13 11:44:25,692 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-12-13 11:44:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 320 transitions. [2022-12-13 11:44:25,692 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 320 transitions. Word has length 42 [2022-12-13 11:44:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:25,692 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 320 transitions. [2022-12-13 11:44:25,692 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-12-13 11:44:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 320 transitions. [2022-12-13 11:44:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:44:25,693 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:25,693 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-12-13 11:44:25,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 11:44:25,693 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-12-13 11:44:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -327922889, now seen corresponding path program 1 times [2022-12-13 11:44:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:25,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966286505] [2022-12-13 11:44:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:25,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:25,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966286505] [2022-12-13 11:44:25,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966286505] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:25,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695482693] [2022-12-13 11:44:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:25,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:25,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:25,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:25,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 11:44:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:26,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 11:44:26,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:26,093 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:44:26,094 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-12-13 11:44:26,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:26,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:44:26,205 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-12-13 11:44:26,316 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:44:26,317 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-12-13 11:44:26,443 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:44:26,443 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-12-13 11:44:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:26,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:44:26,579 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-12-13 11:44:26,611 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-12-13 11:44:28,645 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-12-13 11:44:49,016 WARN L233 SmtUtils]: Spent 14.05s 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-12-13 11:44:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:44:51,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695482693] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:44:51,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:44:51,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2022-12-13 11:44:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733082827] [2022-12-13 11:44:51,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:44:51,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 11:44:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 11:44:51,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=613, Unknown=5, NotChecked=102, Total=812 [2022-12-13 11:44:51,145 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-12-13 11:44:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:52,281 INFO L93 Difference]: Finished difference Result 251 states and 321 transitions. [2022-12-13 11:44:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:44:52,281 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-12-13 11:44:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:52,282 INFO L225 Difference]: With dead ends: 251 [2022-12-13 11:44:52,282 INFO L226 Difference]: Without dead ends: 228 [2022-12-13 11:44:52,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=179, Invalid=946, Unknown=5, NotChecked=130, Total=1260 [2022-12-13 11:44:52,283 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 39 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:52,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1228 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1292 Invalid, 0 Unknown, 213 Unchecked, 0.8s Time] [2022-12-13 11:44:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-12-13 11:44:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-12-13 11:44:52,285 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-12-13 11:44:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2022-12-13 11:44:52,286 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2022-12-13 11:44:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:52,286 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2022-12-13 11:44:52,286 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-12-13 11:44:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2022-12-13 11:44:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:44:52,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:52,287 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-12-13 11:44:52,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 11:44:52,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 11:44:52,488 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-12-13 11:44:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:52,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1291794435, now seen corresponding path program 1 times [2022-12-13 11:44:52,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:52,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692336611] [2022-12-13 11:44:52,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692336611] [2022-12-13 11:44:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692336611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148768734] [2022-12-13 11:44:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:52,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:52,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:52,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:52,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 11:44:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:52,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:44:52,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 11:44:52,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:44:52,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148768734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:52,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:44:52,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 11:44:52,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761573172] [2022-12-13 11:44:52,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:52,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:44:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:52,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:44:52,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:44:52,699 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-12-13 11:44:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:52,721 INFO L93 Difference]: Finished difference Result 391 states and 508 transitions. [2022-12-13 11:44:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:44:52,722 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-12-13 11:44:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:52,723 INFO L225 Difference]: With dead ends: 391 [2022-12-13 11:44:52,723 INFO L226 Difference]: Without dead ends: 389 [2022-12-13 11:44:52,723 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-12-13 11:44:52,724 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-12-13 11:44:52,724 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-12-13 11:44:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-12-13 11:44:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 239. [2022-12-13 11:44:52,728 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-12-13 11:44:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 305 transitions. [2022-12-13 11:44:52,729 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 305 transitions. Word has length 45 [2022-12-13 11:44:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:52,729 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 305 transitions. [2022-12-13 11:44:52,729 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-12-13 11:44:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 305 transitions. [2022-12-13 11:44:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:44:52,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:52,730 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-12-13 11:44:52,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 11:44:52,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:52,930 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-12-13 11:44:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:52,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1971852805, now seen corresponding path program 1 times [2022-12-13 11:44:52,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:52,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171120164] [2022-12-13 11:44:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:52,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171120164] [2022-12-13 11:44:52,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171120164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:52,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786851975] [2022-12-13 11:44:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:52,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:52,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:52,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:52,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 11:44:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:53,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:44:53,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:53,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:44:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:53,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786851975] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:44:53,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:44:53,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-13 11:44:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232619633] [2022-12-13 11:44:53,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:44:53,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:44:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:44:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:44:53,160 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-12-13 11:44:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:53,213 INFO L93 Difference]: Finished difference Result 1027 states and 1353 transitions. [2022-12-13 11:44:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:44:53,213 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-12-13 11:44:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:53,215 INFO L225 Difference]: With dead ends: 1027 [2022-12-13 11:44:53,215 INFO L226 Difference]: Without dead ends: 1027 [2022-12-13 11:44:53,215 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-12-13 11:44:53,215 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 695 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:53,216 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.0s Time] [2022-12-13 11:44:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-12-13 11:44:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 273. [2022-12-13 11:44:53,221 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-12-13 11:44:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2022-12-13 11:44:53,221 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 45 [2022-12-13 11:44:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:53,221 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2022-12-13 11:44:53,221 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-12-13 11:44:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2022-12-13 11:44:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 11:44:53,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:53,222 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-12-13 11:44:53,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 11:44:53,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 11:44:53,423 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-12-13 11:44:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash 69553884, now seen corresponding path program 1 times [2022-12-13 11:44:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:53,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045745280] [2022-12-13 11:44:53,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:53,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045745280] [2022-12-13 11:44:53,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045745280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:53,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486096257] [2022-12-13 11:44:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:53,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:53,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:53,729 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:53,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 11:44:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:53,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 11:44:53,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:53,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:44:53,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:53,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:53,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:53,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-12-13 11:44:53,998 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-13 11:44:53,998 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-12-13 11:44:54,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:44:54,118 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-12-13 11:44:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:54,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:44:54,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486096257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:54,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:44:54,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2022-12-13 11:44:54,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593710334] [2022-12-13 11:44:54,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:54,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:44:54,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:44:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:44:54,122 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-12-13 11:44:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:54,412 INFO L93 Difference]: Finished difference Result 299 states and 346 transitions. [2022-12-13 11:44:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:44:54,413 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-12-13 11:44:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:54,413 INFO L225 Difference]: With dead ends: 299 [2022-12-13 11:44:54,413 INFO L226 Difference]: Without dead ends: 299 [2022-12-13 11:44:54,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-12-13 11:44:54,414 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 285 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:54,414 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.2s Time] [2022-12-13 11:44:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-12-13 11:44:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 273. [2022-12-13 11:44:54,416 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-12-13 11:44:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2022-12-13 11:44:54,417 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 47 [2022-12-13 11:44:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:54,417 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2022-12-13 11:44:54,417 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-12-13 11:44:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2022-12-13 11:44:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 11:44:54,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:54,418 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-12-13 11:44:54,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 11:44:54,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:54,618 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-12-13 11:44:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash 69553885, now seen corresponding path program 1 times [2022-12-13 11:44:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:54,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981844698] [2022-12-13 11:44:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:55,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:55,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981844698] [2022-12-13 11:44:55,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981844698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:55,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795958121] [2022-12-13 11:44:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:55,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:55,029 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:55,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 11:44:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:55,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 11:44:55,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:55,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:44:55,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:55,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:55,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:55,256 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-12-13 11:44:55,268 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-13 11:44:55,268 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-12-13 11:44:55,373 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-12-13 11:44:55,377 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-12-13 11:44:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:55,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:44:55,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795958121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:55,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:44:55,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2022-12-13 11:44:55,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888062327] [2022-12-13 11:44:55,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:55,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:44:55,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:44:55,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:44:55,393 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-12-13 11:44:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:55,655 INFO L93 Difference]: Finished difference Result 319 states and 368 transitions. [2022-12-13 11:44:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:44:55,656 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-12-13 11:44:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:55,656 INFO L225 Difference]: With dead ends: 319 [2022-12-13 11:44:55,656 INFO L226 Difference]: Without dead ends: 319 [2022-12-13 11:44:55,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-12-13 11:44:55,657 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 365 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:55,657 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.2s Time] [2022-12-13 11:44:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-12-13 11:44:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 273. [2022-12-13 11:44:55,660 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-12-13 11:44:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2022-12-13 11:44:55,660 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 47 [2022-12-13 11:44:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:55,661 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2022-12-13 11:44:55,661 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-12-13 11:44:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2022-12-13 11:44:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 11:44:55,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:55,661 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-12-13 11:44:55,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 11:44:55,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 11:44:55,863 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-12-13 11:44:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1479009528, now seen corresponding path program 1 times [2022-12-13 11:44:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:55,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343860347] [2022-12-13 11:44:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:56,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343860347] [2022-12-13 11:44:56,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343860347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:56,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606963937] [2022-12-13 11:44:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:56,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:56,071 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:56,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 11:44:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:56,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 11:44:56,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:56,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:44:56,222 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:44:56,222 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-12-13 11:44:56,236 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:44:56,236 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-12-13 11:44:56,244 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-12-13 11:44:56,253 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:44:56,254 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-12-13 11:44:56,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 11:44:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:56,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:44:56,273 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-12-13 11:44:56,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:44:56,278 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-12-13 11:44:56,280 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-12-13 11:44:56,283 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-12-13 11:44:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 11:44:56,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606963937] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:44:56,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:44:56,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-12-13 11:44:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670164701] [2022-12-13 11:44:56,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:44:56,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:44:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:44:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-12-13 11:44:56,323 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-12-13 11:44:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:56,578 INFO L93 Difference]: Finished difference Result 273 states and 338 transitions. [2022-12-13 11:44:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:44:56,578 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-12-13 11:44:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:56,580 INFO L225 Difference]: With dead ends: 273 [2022-12-13 11:44:56,580 INFO L226 Difference]: Without dead ends: 273 [2022-12-13 11:44:56,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=251, Unknown=1, NotChecked=34, Total=380 [2022-12-13 11:44:56,581 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-12-13 11:44:56,581 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-12-13 11:44:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-12-13 11:44:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2022-12-13 11:44:56,584 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-12-13 11:44:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 336 transitions. [2022-12-13 11:44:56,584 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 336 transitions. Word has length 50 [2022-12-13 11:44:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:56,584 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 336 transitions. [2022-12-13 11:44:56,584 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-12-13 11:44:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 336 transitions. [2022-12-13 11:44:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 11:44:56,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:56,585 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-12-13 11:44:56,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 11:44:56,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 11:44:56,786 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-12-13 11:44:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909602, now seen corresponding path program 1 times [2022-12-13 11:44:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:56,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717828476] [2022-12-13 11:44:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:56,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 11:44:56,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:56,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717828476] [2022-12-13 11:44:56,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717828476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:56,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:56,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:44:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797494314] [2022-12-13 11:44:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:56,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:44:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:44:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:44:56,901 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-12-13 11:44:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:57,051 INFO L93 Difference]: Finished difference Result 268 states and 334 transitions. [2022-12-13 11:44:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:44:57,052 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-12-13 11:44:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:57,053 INFO L225 Difference]: With dead ends: 268 [2022-12-13 11:44:57,053 INFO L226 Difference]: Without dead ends: 268 [2022-12-13 11:44:57,054 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-12-13 11:44:57,054 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 27 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:57,054 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.1s Time] [2022-12-13 11:44:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-12-13 11:44:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-12-13 11:44:57,058 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-12-13 11:44:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 334 transitions. [2022-12-13 11:44:57,059 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 334 transitions. Word has length 51 [2022-12-13 11:44:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:57,059 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 334 transitions. [2022-12-13 11:44:57,059 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-12-13 11:44:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 334 transitions. [2022-12-13 11:44:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 11:44:57,059 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:57,059 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-12-13 11:44:57,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 11:44:57,059 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-12-13 11:44:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909601, now seen corresponding path program 1 times [2022-12-13 11:44:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:57,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202360391] [2022-12-13 11:44:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:57,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:57,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202360391] [2022-12-13 11:44:57,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202360391] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:57,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290327610] [2022-12-13 11:44:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:57,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:57,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:57,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:57,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:44:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:57,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 11:44:57,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:57,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:57,580 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 11:44:57,580 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-12-13 11:44:57,678 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-12-13 11:44:57,680 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-12-13 11:44:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:57,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:44:57,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290327610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:57,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:44:57,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2022-12-13 11:44:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074605839] [2022-12-13 11:44:57,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:57,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:44:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:57,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:44:57,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:44:57,710 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-12-13 11:44:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:58,030 INFO L93 Difference]: Finished difference Result 338 states and 388 transitions. [2022-12-13 11:44:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:44:58,031 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-12-13 11:44:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:58,032 INFO L225 Difference]: With dead ends: 338 [2022-12-13 11:44:58,032 INFO L226 Difference]: Without dead ends: 338 [2022-12-13 11:44:58,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2022-12-13 11:44:58,033 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 458 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:58,034 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.2s Time] [2022-12-13 11:44:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-12-13 11:44:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2022-12-13 11:44:58,036 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-12-13 11:44:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 332 transitions. [2022-12-13 11:44:58,036 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 332 transitions. Word has length 51 [2022-12-13 11:44:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:58,037 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 332 transitions. [2022-12-13 11:44:58,037 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-12-13 11:44:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 332 transitions. [2022-12-13 11:44:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 11:44:58,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:58,037 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-12-13 11:44:58,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 11:44:58,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:58,239 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-12-13 11:44:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 455851009, now seen corresponding path program 1 times [2022-12-13 11:44:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:58,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822756674] [2022-12-13 11:44:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:58,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822756674] [2022-12-13 11:44:58,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822756674] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:44:58,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459827440] [2022-12-13 11:44:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:58,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:44:58,491 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:44:58,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:44:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:58,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 11:44:58,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:44:58,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:44:58,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:44:58,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:44:58,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 11:44:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:58,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:44:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:58,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459827440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:44:58,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:44:58,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-13 11:44:58,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531847607] [2022-12-13 11:44:58,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:44:58,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:44:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:44:58,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:44:58,889 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-12-13 11:44:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:59,230 INFO L93 Difference]: Finished difference Result 288 states and 334 transitions. [2022-12-13 11:44:59,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:44:59,230 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-12-13 11:44:59,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:59,231 INFO L225 Difference]: With dead ends: 288 [2022-12-13 11:44:59,231 INFO L226 Difference]: Without dead ends: 288 [2022-12-13 11:44:59,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-12-13 11:44:59,231 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 671 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:59,232 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.2s Time] [2022-12-13 11:44:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-12-13 11:44:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2022-12-13 11:44:59,234 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-12-13 11:44:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 331 transitions. [2022-12-13 11:44:59,234 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 331 transitions. Word has length 55 [2022-12-13 11:44:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:59,235 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 331 transitions. [2022-12-13 11:44:59,235 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-12-13 11:44:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 331 transitions. [2022-12-13 11:44:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 11:44:59,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:59,235 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-12-13 11:44:59,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 11:44:59,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:44:59,436 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-12-13 11:44:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash -429024641, now seen corresponding path program 1 times [2022-12-13 11:44:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:59,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861155137] [2022-12-13 11:44:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:00,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:00,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861155137] [2022-12-13 11:45:00,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861155137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:45:00,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997380196] [2022-12-13 11:45:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:00,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:45:00,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:45:00,316 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:45:00,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 11:45:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:00,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 11:45:00,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:45:00,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:45:00,459 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:45:00,459 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-12-13 11:45:00,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:45:00,563 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-12-13 11:45:00,563 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-12-13 11:45:00,607 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-12-13 11:45:00,638 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-12-13 11:45:00,663 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-12-13 11:45:00,731 INFO L321 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2022-12-13 11:45:00,731 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-12-13 11:45:00,850 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-12-13 11:45:00,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:45:00,892 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-12-13 11:45:00,961 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:45:00,962 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-12-13 11:45:01,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:45:01,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:45:01,488 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-12-13 11:45:01,494 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-12-13 11:45:01,737 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 11:45:01,737 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-12-13 11:45:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:01,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:45:02,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-12-13 11:45:03,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:45:03,541 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-12-13 11:45:03,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:45:03,557 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-12-13 11:45:03,569 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-12-13 11:45:03,580 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-12-13 11:45:03,590 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-12-13 11:45:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:04,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997380196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:45:04,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:45:04,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 23] total 58 [2022-12-13 11:45:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512870543] [2022-12-13 11:45:04,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:45:04,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-13 11:45:04,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:04,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-13 11:45:04,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=3054, Unknown=13, NotChecked=0, Total=3422 [2022-12-13 11:45:04,970 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-12-13 11:45:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:09,333 INFO L93 Difference]: Finished difference Result 448 states and 544 transitions. [2022-12-13 11:45:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 11:45:09,334 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-12-13 11:45:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:09,334 INFO L225 Difference]: With dead ends: 448 [2022-12-13 11:45:09,334 INFO L226 Difference]: Without dead ends: 448 [2022-12-13 11:45:09,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=820, Invalid=5645, Unknown=15, NotChecked=0, Total=6480 [2022-12-13 11:45:09,336 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 534 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 92 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:09,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 2074 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2967 Invalid, 18 Unknown, 0 Unchecked, 2.8s Time] [2022-12-13 11:45:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-12-13 11:45:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 266. [2022-12-13 11:45:09,338 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-12-13 11:45:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 326 transitions. [2022-12-13 11:45:09,338 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 326 transitions. Word has length 58 [2022-12-13 11:45:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:09,339 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 326 transitions. [2022-12-13 11:45:09,339 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-12-13 11:45:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 326 transitions. [2022-12-13 11:45:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 11:45:09,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:09,339 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-12-13 11:45:09,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 11:45:09,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 11:45:09,540 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-12-13 11:45:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -429024640, now seen corresponding path program 1 times [2022-12-13 11:45:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:09,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131741969] [2022-12-13 11:45:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:10,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:10,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131741969] [2022-12-13 11:45:10,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131741969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:45:10,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130089663] [2022-12-13 11:45:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:10,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:45:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:45:10,489 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:45:10,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 11:45:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 11:45:10,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:45:10,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:45:10,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:45:10,700 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:45:10,700 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-12-13 11:45:10,716 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:45:10,716 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-12-13 11:45:10,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:45:10,785 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-12-13 11:45:10,855 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-12-13 11:45:10,855 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-12-13 11:45:10,869 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-12-13 11:45:10,912 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-12-13 11:45:10,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:45:10,964 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-12-13 11:45:10,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:45:10,995 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-12-13 11:45:11,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:45:11,037 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 11:45:11,037 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-12-13 11:45:11,043 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-12-13 11:45:11,146 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-12-13 11:45:11,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:45:11,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:45:11,193 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-12-13 11:45:11,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:45:11,207 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-12-13 11:45:11,268 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:45:11,269 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-12-13 11:45:11,277 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-12-13 11:45:11,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:45:11,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:45:11,587 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-12-13 11:45:11,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:45:11,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:45:11,768 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-12-13 11:45:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:12,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:45:17,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:45:17,773 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-12-13 11:45:17,786 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-12-13 11:45:17,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:45:17,797 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-12-13 11:45:17,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:45:17,826 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-12-13 11:45:17,854 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-12-13 11:45:17,881 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-12-13 11:45:17,940 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-12-13 11:45:18,014 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-12-13 11:45:18,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:45:18,194 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-12-13 11:48:24,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:48:24,139 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-12-13 11:48:24,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:48:24,168 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-12-13 11:48:24,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:48:24,188 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-12-13 11:48:24,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:48:24,237 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-12-13 11:48:24,298 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-12-13 11:48:24,363 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-12-13 11:48:24,482 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-12-13 11:48:24,633 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-12-13 11:48:24,711 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-12-13 11:48:24,811 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-12-13 11:49:29,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:49:29,423 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 [2022-12-13 11:55:53,711 WARN L233 SmtUtils]: Spent 3.34m on a formula simplification. DAG size of input: 2975 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:55:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:55:55,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130089663] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:55:55,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:55:55,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 20] total 51 [2022-12-13 11:55:55,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696531437] [2022-12-13 11:55:55,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:55:55,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 11:55:55,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:55,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 11:55:55,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2313, Unknown=10, NotChecked=0, Total=2652 [2022-12-13 11:55:55,010 INFO L87 Difference]: Start difference. First operand 266 states and 326 transitions. Second operand has 52 states, 51 states have (on average 3.2549019607843137) internal successors, (166), 52 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:55:57,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:55:59,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:56:01,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:56:03,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:56:06,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:56:08,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:56:25,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:56:27,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:56:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:56:28,007 INFO L93 Difference]: Finished difference Result 455 states and 540 transitions. [2022-12-13 11:56:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 11:56:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 3.2549019607843137) internal successors, (166), 52 states have internal predecessors, (166), 0 states have call successors, (0), 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-12-13 11:56:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:56:28,009 INFO L225 Difference]: With dead ends: 455 [2022-12-13 11:56:28,009 INFO L226 Difference]: Without dead ends: 455 [2022-12-13 11:56:28,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 228.5s TimeCoverageRelationStatistics Valid=1255, Invalid=5540, Unknown=11, NotChecked=0, Total=6806 [2022-12-13 11:56:28,011 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 832 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 3518 mSolverCounterSat, 66 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3518 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:56:28,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1638 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3518 Invalid, 8 Unknown, 0 Unchecked, 22.4s Time] [2022-12-13 11:56:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-12-13 11:56:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 277. [2022-12-13 11:56:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 238 states have (on average 1.453781512605042) internal successors, (346), 276 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 346 transitions. [2022-12-13 11:56:28,014 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 346 transitions. Word has length 58 [2022-12-13 11:56:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:56:28,014 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 346 transitions. [2022-12-13 11:56:28,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.2549019607843137) internal successors, (166), 52 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 346 transitions. [2022-12-13 11:56:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 11:56:28,014 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:56:28,014 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, 1] [2022-12-13 11:56:28,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 11:56:28,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:56:28,215 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 11:56:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash -414862677, now seen corresponding path program 1 times [2022-12-13 11:56:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:28,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911180633] [2022-12-13 11:56:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:28,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:28,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911180633] [2022-12-13 11:56:28,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911180633] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:56:28,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323718692] [2022-12-13 11:56:28,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:28,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:56:28,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:56:28,608 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:56:28,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 11:56:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:28,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 11:56:28,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:56:28,953 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 17 [2022-12-13 11:56:28,956 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 21 treesize of output 13 [2022-12-13 11:56:29,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 11:56:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:29,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:56:29,345 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 30 treesize of output 22 [2022-12-13 11:56:29,348 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 28 treesize of output 16 [2022-12-13 11:56:29,406 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-12-13 11:56:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:29,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323718692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:56:29,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:56:29,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-12-13 11:56:29,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438204685] [2022-12-13 11:56:29,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:56:29,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 11:56:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:29,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 11:56:29,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-12-13 11:56:29,447 INFO L87 Difference]: Start difference. First operand 277 states and 346 transitions. Second operand has 26 states, 25 states have (on average 4.52) internal successors, (113), 26 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:56:30,713 INFO L93 Difference]: Finished difference Result 352 states and 410 transitions. [2022-12-13 11:56:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 11:56:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.52) internal successors, (113), 26 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-12-13 11:56:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:56:30,714 INFO L225 Difference]: With dead ends: 352 [2022-12-13 11:56:30,714 INFO L226 Difference]: Without dead ends: 352 [2022-12-13 11:56:30,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2022-12-13 11:56:30,714 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 878 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:56:30,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1291 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 11:56:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-12-13 11:56:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286. [2022-12-13 11:56:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 248 states have (on average 1.4516129032258065) internal successors, (360), 285 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 360 transitions. [2022-12-13 11:56:30,717 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 360 transitions. Word has length 59 [2022-12-13 11:56:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:56:30,717 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 360 transitions. [2022-12-13 11:56:30,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.52) internal successors, (113), 26 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 360 transitions. [2022-12-13 11:56:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 11:56:30,718 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:56:30,718 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, 1] [2022-12-13 11:56:30,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 11:56:30,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:56:30,919 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 11:56:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -414862676, now seen corresponding path program 1 times [2022-12-13 11:56:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:30,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024649456] [2022-12-13 11:56:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:56:31,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:31,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024649456] [2022-12-13 11:56:31,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024649456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:56:31,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961162818] [2022-12-13 11:56:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:31,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:56:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:56:31,044 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:56:31,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 11:56:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:31,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 11:56:31,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:56:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 11:56:31,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:56:31,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961162818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:31,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:56:31,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-13 11:56:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579723813] [2022-12-13 11:56:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:56:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:56:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:56:31,263 INFO L87 Difference]: Start difference. First operand 286 states and 360 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:56:31,424 INFO L93 Difference]: Finished difference Result 340 states and 413 transitions. [2022-12-13 11:56:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:56:31,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-12-13 11:56:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:56:31,425 INFO L225 Difference]: With dead ends: 340 [2022-12-13 11:56:31,426 INFO L226 Difference]: Without dead ends: 340 [2022-12-13 11:56:31,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:56:31,426 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 252 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:56:31,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 171 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:56:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-12-13 11:56:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 302. [2022-12-13 11:56:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 268 states have (on average 1.4328358208955223) internal successors, (384), 301 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 384 transitions. [2022-12-13 11:56:31,429 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 384 transitions. Word has length 59 [2022-12-13 11:56:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:56:31,429 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 384 transitions. [2022-12-13 11:56:31,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 384 transitions. [2022-12-13 11:56:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 11:56:31,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:56:31,429 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, 1] [2022-12-13 11:56:31,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 11:56:31,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 11:56:31,631 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 11:56:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -414861873, now seen corresponding path program 1 times [2022-12-13 11:56:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:31,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071035341] [2022-12-13 11:56:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:31,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071035341] [2022-12-13 11:56:32,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071035341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:56:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448808775] [2022-12-13 11:56:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:56:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:56:32,384 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:56:32,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 11:56:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:32,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 11:56:32,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:56:32,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:56:32,609 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:56:32,609 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-12-13 11:56:32,718 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 11:56:32,718 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 22 treesize of output 33 [2022-12-13 11:56:32,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:56:32,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:32,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2022-12-13 11:56:33,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:33,459 INFO L321 Elim1Store]: treesize reduction 19, result has 38.7 percent of original size [2022-12-13 11:56:33,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 39 [2022-12-13 11:56:33,464 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 20 treesize of output 12 [2022-12-13 11:56:33,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-13 11:56:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:34,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:56:34,494 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 43 treesize of output 31 [2022-12-13 11:56:34,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:56:34,757 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 674 treesize of output 658 [2022-12-13 11:56:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:36,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448808775] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:56:36,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:56:36,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 46 [2022-12-13 11:56:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383672266] [2022-12-13 11:56:36,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:56:36,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 11:56:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:36,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 11:56:36,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1958, Unknown=0, NotChecked=0, Total=2162 [2022-12-13 11:56:36,979 INFO L87 Difference]: Start difference. First operand 302 states and 384 transitions. Second operand has 47 states, 46 states have (on average 3.369565217391304) internal successors, (155), 47 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:56:42,098 INFO L93 Difference]: Finished difference Result 439 states and 510 transitions. [2022-12-13 11:56:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 11:56:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.369565217391304) internal successors, (155), 47 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-12-13 11:56:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:56:42,099 INFO L225 Difference]: With dead ends: 439 [2022-12-13 11:56:42,099 INFO L226 Difference]: Without dead ends: 439 [2022-12-13 11:56:42,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=878, Invalid=6432, Unknown=0, NotChecked=0, Total=7310 [2022-12-13 11:56:42,101 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 838 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:56:42,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1608 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 11:56:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-12-13 11:56:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 302. [2022-12-13 11:56:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 268 states have (on average 1.4291044776119404) internal successors, (383), 301 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 383 transitions. [2022-12-13 11:56:42,103 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 383 transitions. Word has length 59 [2022-12-13 11:56:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:56:42,104 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 383 transitions. [2022-12-13 11:56:42,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.369565217391304) internal successors, (155), 47 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 383 transitions. [2022-12-13 11:56:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 11:56:42,104 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:56:42,104 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, 1] [2022-12-13 11:56:42,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 11:56:42,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 11:56:42,305 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 11:56:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -414861872, now seen corresponding path program 1 times [2022-12-13 11:56:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:42,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121690727] [2022-12-13 11:56:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121690727] [2022-12-13 11:56:43,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121690727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:56:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895410935] [2022-12-13 11:56:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:43,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:56:43,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:56:43,114 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:56:43,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 11:56:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:43,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 11:56:43,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:56:43,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:56:43,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:56:43,345 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:56:43,345 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-12-13 11:56:43,452 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 11:56:43,452 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 16 treesize of output 18 [2022-12-13 11:56:43,459 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 12 treesize of output 14 [2022-12-13 11:56:43,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:56:43,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:43,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2022-12-13 11:56:43,685 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 19 treesize of output 11 [2022-12-13 11:56:43,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:43,971 INFO L321 Elim1Store]: treesize reduction 19, result has 38.7 percent of original size [2022-12-13 11:56:43,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 56 [2022-12-13 11:56:44,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:44,276 INFO L321 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2022-12-13 11:56:44,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 118 [2022-12-13 11:56:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:45,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:56:46,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:56:46,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 578 treesize of output 526 [2022-12-13 11:56:49,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:49,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:49,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:56:49,346 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 206 treesize of output 202 [2022-12-13 11:56:49,417 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 239 treesize of output 227 [2022-12-13 11:56:49,574 INFO L321 Elim1Store]: treesize reduction 113, result has 27.1 percent of original size [2022-12-13 11:56:49,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 752 treesize of output 749 [2022-12-13 11:56:49,648 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-13 11:56:49,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 205 [2022-12-13 11:56:49,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:56:49,696 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 135 treesize of output 129 [2022-12-13 11:56:49,879 INFO L321 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2022-12-13 11:56:49,880 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 147 treesize of output 137 [2022-12-13 11:56:50,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:56:50,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:56:50,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:50,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:56:50,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:56:50,747 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 28 treesize of output 24 [2022-12-13 11:56:50,800 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 11:56:50,800 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 280 treesize of output 1 [2022-12-13 11:56:58,564 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:56:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:59,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895410935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:56:59,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:56:59,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2022-12-13 11:56:59,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671349566] [2022-12-13 11:56:59,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:56:59,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 11:56:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 11:56:59,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1472, Unknown=0, NotChecked=0, Total=1640 [2022-12-13 11:56:59,061 INFO L87 Difference]: Start difference. First operand 302 states and 383 transitions. Second operand has 41 states, 40 states have (on average 3.875) internal successors, (155), 41 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:06,055 INFO L93 Difference]: Finished difference Result 487 states and 559 transitions. [2022-12-13 11:57:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-13 11:57:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.875) internal successors, (155), 41 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-12-13 11:57:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:06,058 INFO L225 Difference]: With dead ends: 487 [2022-12-13 11:57:06,058 INFO L226 Difference]: Without dead ends: 487 [2022-12-13 11:57:06,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=906, Invalid=5900, Unknown=0, NotChecked=0, Total=6806 [2022-12-13 11:57:06,060 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1010 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:06,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1049 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 11:57:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-12-13 11:57:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 312. [2022-12-13 11:57:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 279 states have (on average 1.4301075268817205) internal successors, (399), 311 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 399 transitions. [2022-12-13 11:57:06,064 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 399 transitions. Word has length 59 [2022-12-13 11:57:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:06,064 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 399 transitions. [2022-12-13 11:57:06,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.875) internal successors, (155), 41 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 399 transitions. [2022-12-13 11:57:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 11:57:06,065 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:06,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 11:57:06,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 11:57:06,266 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 11:57:06,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:06,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1647086193, now seen corresponding path program 1 times [2022-12-13 11:57:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:06,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371946643] [2022-12-13 11:57:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371946643] [2022-12-13 11:57:06,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371946643] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:57:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348826246] [2022-12-13 11:57:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:06,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:06,885 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:57:06,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20657687-a531-4b8e-9d4a-1062bbb49cba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 11:57:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:07,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 11:57:07,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:57:07,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:57:07,153 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-12-13 11:57:07,215 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:57:07,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:57:07,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 11:57:07,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 11:57:07,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 11:57:07,425 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:57:07,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-12-13 11:57:07,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:57:07,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-12-13 11:57:07,543 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 11:57:07,544 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 1 case distinctions, treesize of input 24 treesize of output 27 [2022-12-13 11:57:07,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:57:07,699 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-12-13 11:57:07,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 11:57:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:07,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:57:07,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:57:07,877 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-12-13 11:57:07,886 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_20) |c_ULTIMATE.start_main_~data~0#1.base|) (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) 0)))) is different from false [2022-12-13 11:57:08,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:57:08,273 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 28 treesize of output 29 [2022-12-13 11:57:08,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:57:08,283 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 79 treesize of output 78 [2022-12-13 11:57:08,288 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 62 treesize of output 58 [2022-12-13 11:57:08,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:57:08,298 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 72 treesize of output 64 [2022-12-13 11:57:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:08,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348826246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:57:08,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:57:08,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 37 [2022-12-13 11:57:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100821935] [2022-12-13 11:57:08,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:57:08,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 11:57:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 11:57:08,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1137, Unknown=8, NotChecked=68, Total=1332 [2022-12-13 11:57:08,636 INFO L87 Difference]: Start difference. First operand 312 states and 399 transitions. Second operand has 37 states, 37 states have (on average 4.135135135135135) internal successors, (153), 37 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:10,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:57:17,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:57:19,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:57:21,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:57:32,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:57:41,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:58:07,694 WARN L233 SmtUtils]: Spent 18.31s on a formula simplification. DAG size of input: 56 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:58:10,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 11:58:12,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 11:58:14,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:58:16,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 11:58:18,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:58:20,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 11:58:40,089 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 59 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)