./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test27-2.c --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_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/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_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test27-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/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_07a28f7b-aafd-4d6d-9c70-2e299318850e/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 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da --- 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 20:09:14,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:09:14,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:09:14,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:09:14,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:09:14,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:09:14,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:09:14,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:09:14,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:09:14,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:09:14,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:09:14,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:09:14,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:09:14,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:09:14,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:09:14,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:09:14,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:09:14,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:09:14,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:09:14,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:09:14,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:09:14,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:09:14,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:09:14,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:09:14,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:09:14,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:09:14,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:09:14,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:09:14,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:09:14,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:09:14,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:09:14,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:09:14,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:09:14,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:09:14,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:09:14,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:09:14,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:09:14,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:09:14,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:09:14,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:09:14,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:09:14,403 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 20:09:14,424 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:09:14,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:09:14,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:09:14,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:09:14,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:09:14,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:09:14,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:09:14,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:09:14,427 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:09:14,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:09:14,427 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:09:14,427 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:09:14,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:09:14,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:09:14,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:09:14,428 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 20:09:14,428 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 20:09:14,429 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 20:09:14,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:09:14,429 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 20:09:14,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:09:14,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:09:14,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:09:14,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:09:14,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:09:14,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:09:14,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:09:14,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:09:14,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:09:14,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:09:14,431 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:09:14,431 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:09:14,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:09:14,432 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:09:14,432 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_07a28f7b-aafd-4d6d-9c70-2e299318850e/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_07a28f7b-aafd-4d6d-9c70-2e299318850e/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 -> 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da [2022-12-13 20:09:14,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:09:14,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:09:14,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:09:14,660 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:09:14,660 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:09:14,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-regression/test27-2.c [2022-12-13 20:09:17,235 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:09:17,384 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:09:17,385 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/sv-benchmarks/c/ldv-regression/test27-2.c [2022-12-13 20:09:17,389 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/data/6495740f8/0bb8d6e003514955b90cd8ae5b2f6cbe/FLAG38f76ba24 [2022-12-13 20:09:17,801 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/data/6495740f8/0bb8d6e003514955b90cd8ae5b2f6cbe [2022-12-13 20:09:17,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:09:17,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:09:17,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:09:17,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:09:17,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:09:17,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:17,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa8e472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17, skipping insertion in model container [2022-12-13 20:09:17,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:17,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:09:17,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:09:17,956 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/sv-benchmarks/c/ldv-regression/test27-2.c[1224,1237] [2022-12-13 20:09:17,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:09:17,967 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:09:17,984 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/sv-benchmarks/c/ldv-regression/test27-2.c[1224,1237] [2022-12-13 20:09:17,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:09:17,996 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:09:17,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17 WrapperNode [2022-12-13 20:09:17,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:09:17,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:09:17,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:09:17,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:09:18,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,028 INFO L138 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2022-12-13 20:09:18,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:09:18,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:09:18,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:09:18,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:09:18,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,051 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:09:18,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:09:18,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:09:18,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:09:18,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (1/1) ... [2022-12-13 20:09:18,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:09:18,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:09:18,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:09:18,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:09:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 20:09:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:09:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:09:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 20:09:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:09:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:09:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:09:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:09:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:09:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:09:18,170 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:09:18,171 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:09:18,415 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:09:18,420 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:09:18,420 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 20:09:18,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:09:18 BoogieIcfgContainer [2022-12-13 20:09:18,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:09:18,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:09:18,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:09:18,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:09:18,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:09:17" (1/3) ... [2022-12-13 20:09:18,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0a6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:09:18, skipping insertion in model container [2022-12-13 20:09:18,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:09:17" (2/3) ... [2022-12-13 20:09:18,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0a6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:09:18, skipping insertion in model container [2022-12-13 20:09:18,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:09:18" (3/3) ... [2022-12-13 20:09:18,428 INFO L112 eAbstractionObserver]: Analyzing ICFG test27-2.c [2022-12-13 20:09:18,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:09:18,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-12-13 20:09:18,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:09:18,477 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;@fb0ca1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:09:18,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-12-13 20:09:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 36 states have (on average 2.25) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 20:09:18,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:18,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 20:09:18,485 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-12-13 20:09:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:18,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589387506] [2022-12-13 20:09:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:18,681 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 20:09:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:18,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589387506] [2022-12-13 20:09:18,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589387506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:18,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:18,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:09:18,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169444572] [2022-12-13 20:09:18,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:18,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:09:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:18,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:09:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:09:18,711 INFO L87 Difference]: Start difference. First operand has 75 states, 36 states have (on average 2.25) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 20:09:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:18,788 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-12-13 20:09:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:09:18,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-13 20:09:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:18,796 INFO L225 Difference]: With dead ends: 72 [2022-12-13 20:09:18,796 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 20:09:18,797 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 20:09:18,799 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 68 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:18,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 39 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:09:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 20:09:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-12-13 20:09:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 35 states have (on average 2.085714285714286) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 20:09:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-12-13 20:09:18,824 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 4 [2022-12-13 20:09:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:18,824 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-12-13 20:09:18,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 20:09:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-12-13 20:09:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 20:09:18,825 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:18,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 20:09:18,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:09:18,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:18,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-12-13 20:09:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:18,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139797857] [2022-12-13 20:09:18,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:18,936 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 20:09:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:18,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139797857] [2022-12-13 20:09:18,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139797857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:18,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:18,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:09:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84438765] [2022-12-13 20:09:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:18,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:09:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:09:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:09:18,939 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 20:09:19,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:19,012 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-12-13 20:09:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:09:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-13 20:09:19,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:19,013 INFO L225 Difference]: With dead ends: 77 [2022-12-13 20:09:19,013 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 20:09:19,014 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 20:09:19,014 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:19,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:09:19,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 20:09:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-12-13 20:09:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-12-13 20:09:19,020 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2022-12-13 20:09:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:19,020 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-12-13 20:09:19,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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 20:09:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-12-13 20:09:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 20:09:19,021 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:19,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 20:09:19,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:09:19,021 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:19,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash 889659654, now seen corresponding path program 1 times [2022-12-13 20:09:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:19,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288158938] [2022-12-13 20:09:19,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:19,100 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 20:09:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:19,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288158938] [2022-12-13 20:09:19,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288158938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:19,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:19,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:09:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819838629] [2022-12-13 20:09:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:19,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:09:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:09:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:09:19,103 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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 20:09:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:19,153 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-12-13 20:09:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:09:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-13 20:09:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:19,154 INFO L225 Difference]: With dead ends: 69 [2022-12-13 20:09:19,155 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 20:09:19,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:09:19,156 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:19,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 36 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:09:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 20:09:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-13 20:09:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.945945945945946) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-12-13 20:09:19,160 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 6 [2022-12-13 20:09:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:19,160 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-12-13 20:09:19,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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 20:09:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-12-13 20:09:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 20:09:19,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:19,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 20:09:19,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:09:19,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 889659655, now seen corresponding path program 1 times [2022-12-13 20:09:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:19,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878570229] [2022-12-13 20:09:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:19,270 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 20:09:19,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:19,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878570229] [2022-12-13 20:09:19,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878570229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:19,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:19,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:09:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073574553] [2022-12-13 20:09:19,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:19,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:09:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:19,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:09:19,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:09:19,273 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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 20:09:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:19,365 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-12-13 20:09:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:09:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-13 20:09:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:19,366 INFO L225 Difference]: With dead ends: 72 [2022-12-13 20:09:19,366 INFO L226 Difference]: Without dead ends: 72 [2022-12-13 20:09:19,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:09:19,368 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:19,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 122 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:09:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-13 20:09:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-12-13 20:09:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-12-13 20:09:19,374 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 6 [2022-12-13 20:09:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:19,374 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-12-13 20:09:19,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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 20:09:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-12-13 20:09:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 20:09:19,375 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:19,375 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:19,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:09:19,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash -392442511, now seen corresponding path program 1 times [2022-12-13 20:09:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:19,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616861498] [2022-12-13 20:09:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:19,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:19,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616861498] [2022-12-13 20:09:19,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616861498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:09:19,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978227542] [2022-12-13 20:09:19,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:19,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:19,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:09:19,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:09:19,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:09:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:19,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 20:09:19,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:09:19,680 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-13 20:09:19,681 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-12-13 20:09:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:19,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:09:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:19,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978227542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:09:19,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:09:19,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-13 20:09:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705604500] [2022-12-13 20:09:19,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:09:19,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:09:19,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:09:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:09:19,824 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 20:09:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:20,040 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-12-13 20:09:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:09:20,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-13 20:09:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:20,042 INFO L225 Difference]: With dead ends: 84 [2022-12-13 20:09:20,042 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 20:09:20,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:09:20,043 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:20,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 172 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:09:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 20:09:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-12-13 20:09:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-12-13 20:09:20,049 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 9 [2022-12-13 20:09:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:20,050 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-12-13 20:09:20,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 20:09:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-12-13 20:09:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 20:09:20,051 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:20,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 20:09:20,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:09:20,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:20,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash 819867506, now seen corresponding path program 1 times [2022-12-13 20:09:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:20,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277617734] [2022-12-13 20:09:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:20,461 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 20:09:20,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:20,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277617734] [2022-12-13 20:09:20,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277617734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:09:20,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392584134] [2022-12-13 20:09:20,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:20,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:20,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:09:20,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:09:20,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:09:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:20,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 20:09:20,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:09:20,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:09:20,581 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-12-13 20:09:20,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 38 [2022-12-13 20:09:20,596 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 414 treesize of output 406 [2022-12-13 20:09:20,697 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 20:09:20,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:09:20,766 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 20:09:20,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392584134] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:09:20,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:09:20,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-13 20:09:20,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329028873] [2022-12-13 20:09:20,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:09:20,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:09:20,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:20,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:09:20,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:09:20,768 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 20:09:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:20,905 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-12-13 20:09:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:09:20,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 11 [2022-12-13 20:09:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:20,906 INFO L225 Difference]: With dead ends: 85 [2022-12-13 20:09:20,906 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 20:09:20,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:09:20,907 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:20,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 178 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:09:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 20:09:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-12-13 20:09:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 20:09:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-12-13 20:09:20,912 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 11 [2022-12-13 20:09:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:20,913 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-12-13 20:09:20,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 20:09:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-12-13 20:09:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 20:09:20,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:20,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-12-13 20:09:20,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:09:21,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 20:09:21,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash 963161288, now seen corresponding path program 1 times [2022-12-13 20:09:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:21,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410733570] [2022-12-13 20:09:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 20:09:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:21,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410733570] [2022-12-13 20:09:21,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410733570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:21,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:21,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:09:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595025403] [2022-12-13 20:09:21,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:21,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:09:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:21,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:09:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:09:21,305 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 20:09:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:21,369 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-12-13 20:09:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:09:21,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 25 [2022-12-13 20:09:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:21,370 INFO L225 Difference]: With dead ends: 84 [2022-12-13 20:09:21,370 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 20:09:21,370 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 20:09:21,371 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 87 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:21,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 48 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:09:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 20:09:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-12-13 20:09:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 82 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 20:09:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-12-13 20:09:21,374 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 25 [2022-12-13 20:09:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:21,375 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-12-13 20:09:21,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 20:09:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-12-13 20:09:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:09:21,375 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:21,375 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:21,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:09:21,376 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash -206692696, now seen corresponding path program 1 times [2022-12-13 20:09:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:21,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948691232] [2022-12-13 20:09:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:21,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:21,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948691232] [2022-12-13 20:09:21,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948691232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:09:21,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132006957] [2022-12-13 20:09:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:09:21,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:09:21,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:09:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:21,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:09:21,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:09:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:21,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:09:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:21,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132006957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:09:21,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:09:21,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 20:09:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144521208] [2022-12-13 20:09:21,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:09:21,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 20:09:21,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 20:09:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:09:21,623 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:21,676 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-12-13 20:09:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:09:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 20:09:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:21,677 INFO L225 Difference]: With dead ends: 115 [2022-12-13 20:09:21,677 INFO L226 Difference]: Without dead ends: 115 [2022-12-13 20:09:21,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:09:21,678 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 17 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:21,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 307 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:09:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-13 20:09:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2022-12-13 20:09:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 109 states have internal predecessors, (118), 0 states have call successors, (0), 0 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 20:09:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-12-13 20:09:21,685 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 26 [2022-12-13 20:09:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:21,685 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-12-13 20:09:21,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-12-13 20:09:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:09:21,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:21,686 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2022-12-13 20:09:21,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 20:09:21,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:21,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -206725433, now seen corresponding path program 2 times [2022-12-13 20:09:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:21,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817770697] [2022-12-13 20:09:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:22,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:22,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817770697] [2022-12-13 20:09:22,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817770697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:09:22,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515306882] [2022-12-13 20:09:22,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:09:22,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:09:22,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:09:22,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:09:22,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 20:09:22,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:09:22,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 20:09:22,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:09:22,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:09:22,324 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-12-13 20:09:22,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 38 [2022-12-13 20:09:22,333 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 202 treesize of output 198 [2022-12-13 20:09:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 20:09:22,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:09:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 20:09:22,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515306882] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:09:22,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:09:22,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-12-13 20:09:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227748555] [2022-12-13 20:09:22,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:09:22,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 20:09:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 20:09:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 20:09:22,820 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:23,219 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-12-13 20:09:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 20:09:23,220 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 20:09:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:23,221 INFO L225 Difference]: With dead ends: 109 [2022-12-13 20:09:23,221 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 20:09:23,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2022-12-13 20:09:23,222 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 142 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:23,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 275 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:09:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 20:09:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-12-13 20:09:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.382716049382716) internal successors, (112), 108 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 20:09:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2022-12-13 20:09:23,227 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 26 [2022-12-13 20:09:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:23,227 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2022-12-13 20:09:23,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-12-13 20:09:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 20:09:23,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:23,229 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:23,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 20:09:23,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:23,430 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:23,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1940969656, now seen corresponding path program 2 times [2022-12-13 20:09:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:23,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782015426] [2022-12-13 20:09:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 20:09:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:24,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782015426] [2022-12-13 20:09:24,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782015426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:24,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:24,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:09:24,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680139286] [2022-12-13 20:09:24,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:24,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:09:24,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:24,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:09:24,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:09:24,306 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 20:09:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:24,366 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-12-13 20:09:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:09:24,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 56 [2022-12-13 20:09:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:24,367 INFO L225 Difference]: With dead ends: 108 [2022-12-13 20:09:24,367 INFO L226 Difference]: Without dead ends: 106 [2022-12-13 20:09:24,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:09:24,368 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 55 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:24,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 54 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:09:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-13 20:09:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-12-13 20:09:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-12-13 20:09:24,373 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 56 [2022-12-13 20:09:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:24,373 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-12-13 20:09:24,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 20:09:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-12-13 20:09:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 20:09:24,374 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:24,374 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:24,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:09:24,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:24,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1941048136, now seen corresponding path program 1 times [2022-12-13 20:09:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:24,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894748797] [2022-12-13 20:09:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-12-13 20:09:24,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:24,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894748797] [2022-12-13 20:09:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894748797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:24,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:24,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:09:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727547762] [2022-12-13 20:09:24,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:24,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:09:24,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:24,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:09:24,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:09:24,623 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 20:09:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:24,654 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-12-13 20:09:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:09:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 56 [2022-12-13 20:09:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:24,655 INFO L225 Difference]: With dead ends: 105 [2022-12-13 20:09:24,655 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 20:09:24,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:09:24,656 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:24,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:09:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 20:09:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-12-13 20:09:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 104 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-12-13 20:09:24,660 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 56 [2022-12-13 20:09:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:24,660 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-12-13 20:09:24,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 20:09:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-12-13 20:09:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 20:09:24,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:24,662 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:24,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:09:24,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1941048135, now seen corresponding path program 1 times [2022-12-13 20:09:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:24,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414964904] [2022-12-13 20:09:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 20:09:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:25,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414964904] [2022-12-13 20:09:25,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414964904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:25,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:25,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:09:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082936083] [2022-12-13 20:09:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:25,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:09:25,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:25,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:09:25,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:09:25,059 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 20:09:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:25,091 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-12-13 20:09:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:09:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 56 [2022-12-13 20:09:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:25,092 INFO L225 Difference]: With dead ends: 104 [2022-12-13 20:09:25,092 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 20:09:25,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:09:25,093 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:25,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:09:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 20:09:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-12-13 20:09:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 20:09:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-12-13 20:09:25,096 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 56 [2022-12-13 20:09:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:25,096 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-12-13 20:09:25,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 20:09:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-12-13 20:09:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 20:09:25,097 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:25,098 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:25,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:09:25,098 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash -42950069, now seen corresponding path program 1 times [2022-12-13 20:09:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:25,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502421294] [2022-12-13 20:09:25,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 172 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:25,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:25,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502421294] [2022-12-13 20:09:25,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502421294] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:09:25,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985150330] [2022-12-13 20:09:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:25,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:25,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:09:25,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:09:25,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:09:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:25,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 20:09:25,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:09:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 216 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:25,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:09:25,824 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 25 treesize of output 21 [2022-12-13 20:09:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 216 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:09:26,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985150330] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:09:26,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:09:26,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-12-13 20:09:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827559836] [2022-12-13 20:09:26,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:09:26,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 20:09:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 20:09:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 20:09:26,128 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 38 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 38 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 20:09:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:26,488 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-12-13 20:09:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 20:09:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 38 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) Word has length 57 [2022-12-13 20:09:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:26,489 INFO L225 Difference]: With dead ends: 102 [2022-12-13 20:09:26,489 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 20:09:26,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=659, Invalid=1693, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 20:09:26,491 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 408 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:26,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 138 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:09:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 20:09:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-12-13 20:09:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 101 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2022-12-13 20:09:26,494 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 57 [2022-12-13 20:09:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:26,494 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2022-12-13 20:09:26,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 38 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 20:09:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2022-12-13 20:09:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 20:09:26,495 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:26,496 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:26,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 20:09:26,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:09:26,696 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1331452165, now seen corresponding path program 1 times [2022-12-13 20:09:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:26,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101218658] [2022-12-13 20:09:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-12-13 20:09:27,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:27,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101218658] [2022-12-13 20:09:27,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101218658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:27,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:27,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:09:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902776363] [2022-12-13 20:09:27,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:27,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:09:27,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:27,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:09:27,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:09:27,052 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:27,084 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-12-13 20:09:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:09:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-13 20:09:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:27,085 INFO L225 Difference]: With dead ends: 100 [2022-12-13 20:09:27,085 INFO L226 Difference]: Without dead ends: 100 [2022-12-13 20:09:27,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:09:27,086 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:27,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 25 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:09:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-13 20:09:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-12-13 20:09:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 20:09:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-12-13 20:09:27,089 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 58 [2022-12-13 20:09:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:27,089 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-12-13 20:09:27,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-12-13 20:09:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 20:09:27,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:27,090 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:27,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:09:27,090 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1331452164, now seen corresponding path program 1 times [2022-12-13 20:09:27,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:27,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294890352] [2022-12-13 20:09:27,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:27,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 20:09:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:27,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294890352] [2022-12-13 20:09:27,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294890352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:27,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:27,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:09:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818175632] [2022-12-13 20:09:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:27,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:09:27,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:09:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:09:27,519 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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 20:09:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:27,554 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-12-13 20:09:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:09:27,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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 58 [2022-12-13 20:09:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:27,555 INFO L225 Difference]: With dead ends: 98 [2022-12-13 20:09:27,555 INFO L226 Difference]: Without dead ends: 98 [2022-12-13 20:09:27,555 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 20:09:27,556 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:27,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 25 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:09:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-13 20:09:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-12-13 20:09:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 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 20:09:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-12-13 20:09:27,557 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 58 [2022-12-13 20:09:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:27,558 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-12-13 20:09:27,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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 20:09:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-12-13 20:09:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 20:09:27,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:27,558 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:27,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:09:27,558 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:27,559 INFO L85 PathProgramCache]: Analyzing trace with hash 374723902, now seen corresponding path program 1 times [2022-12-13 20:09:27,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:27,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133198449] [2022-12-13 20:09:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-12-13 20:09:27,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:27,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133198449] [2022-12-13 20:09:27,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133198449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:27,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:27,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:09:27,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437632863] [2022-12-13 20:09:27,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:27,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:09:27,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:09:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:09:27,715 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:27,773 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-12-13 20:09:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:09:27,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-12-13 20:09:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:27,774 INFO L225 Difference]: With dead ends: 97 [2022-12-13 20:09:27,774 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 20:09:27,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:09:27,775 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:27,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 49 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:09:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 20:09:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-12-13 20:09:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.240506329113924) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-12-13 20:09:27,779 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 60 [2022-12-13 20:09:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:27,779 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-12-13 20:09:27,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-12-13 20:09:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 20:09:27,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:27,780 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:27,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 20:09:27,780 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash 374723903, now seen corresponding path program 1 times [2022-12-13 20:09:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:27,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073170857] [2022-12-13 20:09:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:09:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 20:09:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:09:28,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073170857] [2022-12-13 20:09:28,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073170857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:09:28,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:09:28,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:09:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543081646] [2022-12-13 20:09:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:09:28,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:09:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:09:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:09:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:09:28,132 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 20:09:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:09:28,226 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-12-13 20:09:28,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:09:28,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-12-13 20:09:28,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:09:28,227 INFO L225 Difference]: With dead ends: 96 [2022-12-13 20:09:28,228 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 20:09:28,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:09:28,228 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:09:28,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:09:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 20:09:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-12-13 20:09:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 95 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:09:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-12-13 20:09:28,230 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 60 [2022-12-13 20:09:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:09:28,230 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-12-13 20:09:28,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 20:09:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-12-13 20:09:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 20:09:28,230 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:09:28,230 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:28,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 20:09:28,231 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-12-13 20:09:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:09:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1268460912, now seen corresponding path program 1 times [2022-12-13 20:09:28,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:09:28,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997564072] [2022-12-13 20:09:28,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:09:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:09:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:09:28,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:09:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:09:28,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:09:28,390 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:09:28,390 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 38 remaining) [2022-12-13 20:09:28,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2022-12-13 20:09:28,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2022-12-13 20:09:28,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2022-12-13 20:09:28,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (1 of 38 remaining) [2022-12-13 20:09:28,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2022-12-13 20:09:28,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 20:09:28,398 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:09:28,401 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:09:28,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:09:28 BoogieIcfgContainer [2022-12-13 20:09:28,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:09:28,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:09:28,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:09:28,430 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:09:28,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:09:18" (3/4) ... [2022-12-13 20:09:28,432 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:09:28,484 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:09:28,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:09:28,484 INFO L158 Benchmark]: Toolchain (without parser) took 10680.39ms. Allocated memory was 127.9MB in the beginning and 270.5MB in the end (delta: 142.6MB). Free memory was 95.2MB in the beginning and 236.0MB in the end (delta: -140.8MB). Peak memory consumption was 159.1MB. Max. memory is 16.1GB. [2022-12-13 20:09:28,485 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:09:28,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.37ms. Allocated memory is still 127.9MB. Free memory was 94.9MB in the beginning and 84.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 20:09:28,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.96ms. Allocated memory is still 127.9MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:09:28,485 INFO L158 Benchmark]: Boogie Preprocessor took 25.13ms. Allocated memory is still 127.9MB. Free memory was 82.0MB in the beginning and 80.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:09:28,485 INFO L158 Benchmark]: RCFGBuilder took 366.09ms. Allocated memory is still 127.9MB. Free memory was 80.6MB in the beginning and 61.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 20:09:28,485 INFO L158 Benchmark]: TraceAbstraction took 10006.96ms. Allocated memory was 127.9MB in the beginning and 270.5MB in the end (delta: 142.6MB). Free memory was 60.8MB in the beginning and 85.3MB in the end (delta: -24.5MB). Peak memory consumption was 121.1MB. Max. memory is 16.1GB. [2022-12-13 20:09:28,486 INFO L158 Benchmark]: Witness Printer took 53.69ms. Allocated memory is still 270.5MB. Free memory was 85.3MB in the beginning and 236.0MB in the end (delta: -150.7MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-12-13 20:09:28,487 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.37ms. Allocated memory is still 127.9MB. Free memory was 94.9MB in the beginning and 84.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.96ms. Allocated memory is still 127.9MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.13ms. Allocated memory is still 127.9MB. Free memory was 82.0MB in the beginning and 80.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 366.09ms. Allocated memory is still 127.9MB. Free memory was 80.6MB in the beginning and 61.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10006.96ms. Allocated memory was 127.9MB in the beginning and 270.5MB in the end (delta: 142.6MB). Free memory was 60.8MB in the beginning and 85.3MB in the end (delta: -24.5MB). Peak memory consumption was 121.1MB. Max. memory is 16.1GB. * Witness Printer took 53.69ms. Allocated memory is still 270.5MB. Free memory was 85.3MB in the beginning and 236.0MB in the end (delta: -150.7MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L23] struct cont cont; [L24] struct dummy dummy; [L25] struct dummy *dummies[10]; [L26] int a[10]; [L27] int i, *pa; [L28] i = __VERIFIER_nondet_int() [L29] int j = 0; VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=0] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=0] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=0] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=1] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=1] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=1] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=2] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=2] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=2] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=3] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=3] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=3] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=4] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-5, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=4] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=4] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=5] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=5] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=5] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=6] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-7, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=6] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=6] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=7] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-8, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=7] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=7] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=8] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-9, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=8] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=8] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=9] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=10, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=9] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=9] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L29] COND FALSE !(j < 10) VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L36] COND TRUE i >= 0 && i < 9 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L37] a[i] = i VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L38] dummy.array = &a[i] VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L39] dummies[i + 1] = &dummy VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L40] cont.array = &dummies[0] VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L41] EXPR cont.array VAL [a={7:0}, cont={9:0}, cont.array={5:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L41] EXPR cont.array[i] VAL [a={7:0}, cont={9:0}, cont.array={5:0}, cont.array[i]={0:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L41] cont.array[i]->array - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1420 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1420 mSDsluCounter, 1728 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1066 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1918 IncrementalHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 662 mSDtfsCounter, 1918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=8, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 768 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 10577 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1124 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 2355/2642 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 20:09:28,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07a28f7b-aafd-4d6d-9c70-2e299318850e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)