./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/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_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4bb6c46a4de77c33ebd5db0d25fe513601ef52929336922ed8d1cb2e429dd77c --- 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 12:43:20,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:43:20,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:43:20,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:43:20,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:43:20,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:43:20,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:43:20,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:43:20,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:43:20,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:43:20,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:43:20,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:43:20,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:43:20,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:43:20,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:43:20,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:43:20,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:43:20,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:43:20,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:43:20,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:43:20,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:43:20,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:43:20,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:43:20,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:43:20,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:43:20,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:43:20,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:43:20,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:43:20,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:43:20,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:43:20,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:43:20,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:43:20,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:43:20,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:43:20,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:43:20,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:43:20,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:43:20,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:43:20,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:43:20,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:43:20,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:43:20,493 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-12-13 12:43:20,513 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:43:20,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:43:20,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:43:20,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:43:20,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:43:20,515 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:43:20,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:43:20,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:43:20,516 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:43:20,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:43:20,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:43:20,517 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:43:20,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:43:20,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:43:20,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:43:20,517 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:43:20,517 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:43:20,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:43:20,518 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:43:20,518 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:43:20,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:43:20,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:43:20,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:43:20,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:43:20,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:43:20,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:43:20,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:43:20,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:43:20,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:43:20,520 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:43:20,520 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:43:20,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:43:20,520 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:43:20,521 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_43829094-cca6-469d-8d50-95ac3cff5504/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_43829094-cca6-469d-8d50-95ac3cff5504/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-memcleanup) ) 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 -> 4bb6c46a4de77c33ebd5db0d25fe513601ef52929336922ed8d1cb2e429dd77c [2022-12-13 12:43:20,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:43:20,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:43:20,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:43:20,737 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:43:20,737 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:43:20,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2022-12-13 12:43:23,388 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:43:23,568 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:43:23,569 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2022-12-13 12:43:23,577 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/data/9d0704014/2cb85ff25a8740d39ed777b90d4e55f9/FLAG38ab31189 [2022-12-13 12:43:23,591 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/data/9d0704014/2cb85ff25a8740d39ed777b90d4e55f9 [2022-12-13 12:43:23,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:43:23,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:43:23,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:43:23,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:43:23,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:43:23,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e171509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23, skipping insertion in model container [2022-12-13 12:43:23,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:43:23,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:43:23,860 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_43829094-cca6-469d-8d50-95ac3cff5504/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i[22793,22806] [2022-12-13 12:43:23,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:43:23,876 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:43:23,909 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_43829094-cca6-469d-8d50-95ac3cff5504/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i[22793,22806] [2022-12-13 12:43:23,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:43:23,929 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:43:23,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23 WrapperNode [2022-12-13 12:43:23,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:43:23,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:43:23,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:43:23,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:43:23,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,965 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2022-12-13 12:43:23,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:43:23,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:43:23,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:43:23,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:43:23,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,991 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:23,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:43:23,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:43:23,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:43:23,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:43:23,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (1/1) ... [2022-12-13 12:43:24,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:43:24,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:43:24,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:43:24,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:43:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:43:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:43:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:43:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:43:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:43:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 12:43:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:43:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:43:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:43:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:43:24,144 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:43:24,145 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:43:24,461 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:43:24,466 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:43:24,466 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-13 12:43:24,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:43:24 BoogieIcfgContainer [2022-12-13 12:43:24,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:43:24,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:43:24,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:43:24,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:43:24,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:43:23" (1/3) ... [2022-12-13 12:43:24,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32503206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:43:24, skipping insertion in model container [2022-12-13 12:43:24,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:23" (2/3) ... [2022-12-13 12:43:24,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32503206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:43:24, skipping insertion in model container [2022-12-13 12:43:24,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:43:24" (3/3) ... [2022-12-13 12:43:24,475 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-1.i [2022-12-13 12:43:24,490 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:43:24,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-12-13 12:43:24,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:43:24,529 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;@38dda395, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:43:24,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-12-13 12:43:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 65 states have (on average 2.2) internal successors, (143), 126 states have internal predecessors, (143), 0 states have call successors, (0), 0 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 12:43:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 12:43:24,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:24,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 12:43:24,537 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:24,541 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-12-13 12:43:24,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:24,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216391058] [2022-12-13 12:43:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:24,708 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 12:43:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:24,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216391058] [2022-12-13 12:43:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216391058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:24,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:24,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:43:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070112034] [2022-12-13 12:43:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:24,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:43:24,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:43:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:43:24,748 INFO L87 Difference]: Start difference. First operand has 127 states, 65 states have (on average 2.2) internal successors, (143), 126 states have internal predecessors, (143), 0 states have call successors, (0), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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 12:43:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:24,892 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2022-12-13 12:43:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:43:24,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-12-13 12:43:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:24,904 INFO L225 Difference]: With dead ends: 154 [2022-12-13 12:43:24,904 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 12:43:24,905 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 12:43:24,909 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 113 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:24,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 122 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 12:43:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2022-12-13 12:43:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 63 states have (on average 2.0317460317460316) internal successors, (128), 120 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 12:43:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2022-12-13 12:43:24,941 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 3 [2022-12-13 12:43:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:24,941 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2022-12-13 12:43:24,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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 12:43:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2022-12-13 12:43:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 12:43:24,942 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:24,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 12:43:24,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:43:24,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-12-13 12:43:24,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:24,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429291121] [2022-12-13 12:43:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:24,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:24,999 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 12:43:24,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:25,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429291121] [2022-12-13 12:43:25,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429291121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:25,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:25,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:43:25,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071322743] [2022-12-13 12:43:25,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:25,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:43:25,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:25,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:43:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:43:25,002 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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 12:43:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:25,107 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-12-13 12:43:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:43:25,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-12-13 12:43:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:25,108 INFO L225 Difference]: With dead ends: 147 [2022-12-13 12:43:25,108 INFO L226 Difference]: Without dead ends: 147 [2022-12-13 12:43:25,109 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 12:43:25,110 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 108 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:25,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 118 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-13 12:43:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2022-12-13 12:43:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 117 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:43:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2022-12-13 12:43:25,118 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 3 [2022-12-13 12:43:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:25,118 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2022-12-13 12:43:25,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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 12:43:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2022-12-13 12:43:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 12:43:25,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:25,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:25,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:43:25,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-12-13 12:43:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:25,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260064948] [2022-12-13 12:43:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:25,279 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 12:43:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:25,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260064948] [2022-12-13 12:43:25,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260064948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:25,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:25,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:43:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656596921] [2022-12-13 12:43:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:25,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:43:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:43:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:43:25,282 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:25,422 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-12-13 12:43:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:43:25,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-13 12:43:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:25,423 INFO L225 Difference]: With dead ends: 118 [2022-12-13 12:43:25,423 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 12:43:25,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:43:25,425 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 169 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:25,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 49 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 12:43:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2022-12-13 12:43:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.732394366197183) internal successors, (123), 109 states have internal predecessors, (123), 0 states have call successors, (0), 0 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 12:43:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2022-12-13 12:43:25,429 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 9 [2022-12-13 12:43:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:25,429 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2022-12-13 12:43:25,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-12-13 12:43:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 12:43:25,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:25,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:25,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:43:25,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-12-13 12:43:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:25,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046919736] [2022-12-13 12:43:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:25,566 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 12:43:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:25,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046919736] [2022-12-13 12:43:25,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046919736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:25,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:25,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:43:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280143405] [2022-12-13 12:43:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:25,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:43:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:25,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:43:25,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:43:25,569 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:25,746 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-12-13 12:43:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:43:25,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-13 12:43:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:25,748 INFO L225 Difference]: With dead ends: 144 [2022-12-13 12:43:25,748 INFO L226 Difference]: Without dead ends: 144 [2022-12-13 12:43:25,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:43:25,749 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 196 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:25,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 64 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:43:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-13 12:43:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2022-12-13 12:43:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 90 states have (on average 1.5666666666666667) internal successors, (141), 125 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 12:43:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2022-12-13 12:43:25,753 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 9 [2022-12-13 12:43:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:25,753 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2022-12-13 12:43:25,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2022-12-13 12:43:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 12:43:25,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:25,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:25,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:43:25,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-12-13 12:43:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:25,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772287198] [2022-12-13 12:43:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:25,906 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 12:43:25,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:25,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772287198] [2022-12-13 12:43:25,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772287198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:25,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:25,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:43:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307447861] [2022-12-13 12:43:25,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:25,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:43:25,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:25,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:43:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:43:25,909 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 12:43:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:26,058 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-12-13 12:43:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:43:26,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-12-13 12:43:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:26,059 INFO L225 Difference]: With dead ends: 125 [2022-12-13 12:43:26,059 INFO L226 Difference]: Without dead ends: 125 [2022-12-13 12:43:26,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:43:26,061 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:26,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 224 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-13 12:43:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-12-13 12:43:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 124 states have internal predecessors, (139), 0 states have call successors, (0), 0 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 12:43:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2022-12-13 12:43:26,066 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 12 [2022-12-13 12:43:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:26,066 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2022-12-13 12:43:26,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 12:43:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2022-12-13 12:43:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 12:43:26,067 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:26,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:26,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:43:26,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-12-13 12:43:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:26,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790645277] [2022-12-13 12:43:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:26,138 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 12:43:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:26,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790645277] [2022-12-13 12:43:26,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790645277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:26,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:26,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:43:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446081307] [2022-12-13 12:43:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:26,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:43:26,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:26,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:43:26,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:43:26,140 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 12:43:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:26,269 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-12-13 12:43:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:43:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-12-13 12:43:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:26,270 INFO L225 Difference]: With dead ends: 124 [2022-12-13 12:43:26,270 INFO L226 Difference]: Without dead ends: 124 [2022-12-13 12:43:26,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:43:26,271 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 8 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:26,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 234 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-13 12:43:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-12-13 12:43:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 123 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 12:43:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2022-12-13 12:43:26,275 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 12 [2022-12-13 12:43:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:26,275 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2022-12-13 12:43:26,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 12:43:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2022-12-13 12:43:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 12:43:26,276 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:26,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:26,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:43:26,276 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1478309260, now seen corresponding path program 1 times [2022-12-13 12:43:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:26,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976524449] [2022-12-13 12:43:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:43:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:26,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976524449] [2022-12-13 12:43:26,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976524449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:26,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:26,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:43:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362371448] [2022-12-13 12:43:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:26,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:43:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:26,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:43:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:43:26,416 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:26,552 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2022-12-13 12:43:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:43:26,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 12:43:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:26,554 INFO L225 Difference]: With dead ends: 132 [2022-12-13 12:43:26,554 INFO L226 Difference]: Without dead ends: 132 [2022-12-13 12:43:26,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 12:43:26,555 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 20 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:26,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 277 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:26,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-13 12:43:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-12-13 12:43:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 127 states have internal predecessors, (142), 0 states have call successors, (0), 0 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 12:43:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2022-12-13 12:43:26,559 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 16 [2022-12-13 12:43:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:26,559 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2022-12-13 12:43:26,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2022-12-13 12:43:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 12:43:26,559 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:26,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:26,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:43:26,560 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:26,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-12-13 12:43:26,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:26,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912497177] [2022-12-13 12:43:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:26,709 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 12:43:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:26,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912497177] [2022-12-13 12:43:26,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912497177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:26,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:26,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:43:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868907805] [2022-12-13 12:43:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:26,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:43:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:26,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:43:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:43:26,712 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:27,034 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-12-13 12:43:27,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:43:27,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 12:43:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:27,036 INFO L225 Difference]: With dead ends: 132 [2022-12-13 12:43:27,036 INFO L226 Difference]: Without dead ends: 132 [2022-12-13 12:43:27,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:43:27,037 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 162 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:27,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 171 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:43:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-13 12:43:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-12-13 12:43:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.5) internal successors, (141), 126 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 12:43:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2022-12-13 12:43:27,041 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 16 [2022-12-13 12:43:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:27,041 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2022-12-13 12:43:27,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2022-12-13 12:43:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 12:43:27,042 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:27,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:27,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:43:27,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-12-13 12:43:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:27,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022707632] [2022-12-13 12:43:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:27,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:27,243 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 12:43:27,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:27,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022707632] [2022-12-13 12:43:27,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022707632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:27,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:27,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:43:27,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627306289] [2022-12-13 12:43:27,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:27,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:43:27,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:43:27,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:43:27,246 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:27,695 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-12-13 12:43:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 12:43:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 12:43:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:27,696 INFO L225 Difference]: With dead ends: 128 [2022-12-13 12:43:27,696 INFO L226 Difference]: Without dead ends: 128 [2022-12-13 12:43:27,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-12-13 12:43:27,697 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 162 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:27,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 185 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:43:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-13 12:43:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2022-12-13 12:43:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 115 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 12:43:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2022-12-13 12:43:27,700 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 16 [2022-12-13 12:43:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:27,700 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2022-12-13 12:43:27,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-12-13 12:43:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 12:43:27,701 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:27,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:27,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:43:27,701 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash -102521317, now seen corresponding path program 1 times [2022-12-13 12:43:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:27,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041662871] [2022-12-13 12:43:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:27,762 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 12:43:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:27,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041662871] [2022-12-13 12:43:27,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041662871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:27,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:27,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:43:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339755000] [2022-12-13 12:43:27,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:27,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:43:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:43:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:43:27,764 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 12:43:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:27,925 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2022-12-13 12:43:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:43:27,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 19 [2022-12-13 12:43:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:27,926 INFO L225 Difference]: With dead ends: 116 [2022-12-13 12:43:27,926 INFO L226 Difference]: Without dead ends: 116 [2022-12-13 12:43:27,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:43:27,927 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 56 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:27,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-13 12:43:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-12-13 12:43:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 114 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 12:43:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-12-13 12:43:27,929 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 19 [2022-12-13 12:43:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:27,930 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-12-13 12:43:27,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 12:43:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-12-13 12:43:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 12:43:27,931 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:27,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:27,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:43:27,931 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -102521316, now seen corresponding path program 1 times [2022-12-13 12:43:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:27,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640069159] [2022-12-13 12:43:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:28,062 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 12:43:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:28,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640069159] [2022-12-13 12:43:28,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640069159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:28,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:28,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:43:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967812420] [2022-12-13 12:43:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:28,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:43:28,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:43:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:43:28,064 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 12:43:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:28,201 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-12-13 12:43:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:43:28,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 19 [2022-12-13 12:43:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:28,202 INFO L225 Difference]: With dead ends: 112 [2022-12-13 12:43:28,202 INFO L226 Difference]: Without dead ends: 112 [2022-12-13 12:43:28,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:43:28,203 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 20 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:28,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 219 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-13 12:43:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-12-13 12:43:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-12-13 12:43:28,206 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 19 [2022-12-13 12:43:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:28,207 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-12-13 12:43:28,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 12:43:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-12-13 12:43:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 12:43:28,208 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:28,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:28,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:43:28,208 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:28,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1813630322, now seen corresponding path program 1 times [2022-12-13 12:43:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:28,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803734602] [2022-12-13 12:43:28,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:43:28,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:28,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803734602] [2022-12-13 12:43:28,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803734602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:43:28,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59125546] [2022-12-13 12:43:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:28,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:43:28,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:43:28,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:43:28,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:43:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:28,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 12:43:28,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:43:28,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:43:28,624 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:43:28,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 12:43:28,645 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:43:28,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:43:28,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 12:43:28,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 12:43:28,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:43:28,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-12-13 12:43:28,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:43:28,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 12:43:28,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 12:43:28,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:43:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:43:28,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:43:33,128 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 50 treesize of output 46 [2022-12-13 12:43:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:43:33,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59125546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:43:33,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:43:33,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2022-12-13 12:43:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768366429] [2022-12-13 12:43:33,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:43:33,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 12:43:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 12:43:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-12-13 12:43:33,191 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 12:43:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:33,865 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2022-12-13 12:43:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 12:43:33,865 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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 20 [2022-12-13 12:43:33,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:33,867 INFO L225 Difference]: With dead ends: 180 [2022-12-13 12:43:33,867 INFO L226 Difference]: Without dead ends: 180 [2022-12-13 12:43:33,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=222, Invalid=834, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 12:43:33,868 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 762 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:33,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 258 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 12:43:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-13 12:43:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 118. [2022-12-13 12:43:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.425531914893617) internal successors, (134), 117 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2022-12-13 12:43:33,873 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 20 [2022-12-13 12:43:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:33,873 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2022-12-13 12:43:33,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 12:43:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-12-13 12:43:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 12:43:33,874 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:33,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:33,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:43:34,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 12:43:34,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1813630321, now seen corresponding path program 1 times [2022-12-13 12:43:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:34,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075004614] [2022-12-13 12:43:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:34,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:43:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075004614] [2022-12-13 12:43:34,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075004614] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:43:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661058266] [2022-12-13 12:43:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:34,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:43:34,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:43:34,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:43:34,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:43:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:34,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 12:43:34,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:43:34,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:43:34,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 12:43:34,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 12:43:34,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:43:34,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2022-12-13 12:43:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:43:34,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:43:34,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661058266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:34,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:43:34,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2022-12-13 12:43:34,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196943590] [2022-12-13 12:43:34,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:34,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:43:34,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:34,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:43:34,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:43:34,534 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 12:43:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:34,764 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2022-12-13 12:43:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:43:34,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-12-13 12:43:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:34,765 INFO L225 Difference]: With dead ends: 143 [2022-12-13 12:43:34,765 INFO L226 Difference]: Without dead ends: 142 [2022-12-13 12:43:34,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-12-13 12:43:34,766 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:34,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 216 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-12-13 12:43:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2022-12-13 12:43:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 114 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 12:43:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-12-13 12:43:34,769 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 20 [2022-12-13 12:43:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:34,769 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-12-13 12:43:34,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 12:43:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-12-13 12:43:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 12:43:34,770 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:34,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:34,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 12:43:34,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 12:43:34,972 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:34,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash 386334286, now seen corresponding path program 1 times [2022-12-13 12:43:34,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:34,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408146161] [2022-12-13 12:43:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:34,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:35,266 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 12:43:35,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:35,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408146161] [2022-12-13 12:43:35,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408146161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:35,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:35,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:43:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150712065] [2022-12-13 12:43:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:35,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:43:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:43:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:43:35,268 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 12:43:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:35,506 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2022-12-13 12:43:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:43:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-13 12:43:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:35,507 INFO L225 Difference]: With dead ends: 144 [2022-12-13 12:43:35,507 INFO L226 Difference]: Without dead ends: 144 [2022-12-13 12:43:35,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:43:35,508 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 216 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:35,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 125 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:43:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-13 12:43:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2022-12-13 12:43:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 115 states have internal predecessors, (131), 0 states have call successors, (0), 0 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 12:43:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2022-12-13 12:43:35,511 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 21 [2022-12-13 12:43:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:35,512 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2022-12-13 12:43:35,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 12:43:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2022-12-13 12:43:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 12:43:35,512 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:35,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:35,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:43:35,513 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash 386334287, now seen corresponding path program 1 times [2022-12-13 12:43:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598356854] [2022-12-13 12:43:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:43:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:35,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598356854] [2022-12-13 12:43:35,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598356854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:35,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:35,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:43:35,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798853164] [2022-12-13 12:43:35,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:35,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:43:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:35,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:43:35,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:43:35,733 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 12:43:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:36,092 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2022-12-13 12:43:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:43:36,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-13 12:43:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:36,093 INFO L225 Difference]: With dead ends: 168 [2022-12-13 12:43:36,093 INFO L226 Difference]: Without dead ends: 168 [2022-12-13 12:43:36,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-12-13 12:43:36,093 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 334 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:36,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 194 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:43:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-12-13 12:43:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 118. [2022-12-13 12:43:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.4) internal successors, (133), 117 states have internal predecessors, (133), 0 states have call successors, (0), 0 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 12:43:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2022-12-13 12:43:36,095 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 21 [2022-12-13 12:43:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:36,096 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2022-12-13 12:43:36,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 12:43:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2022-12-13 12:43:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 12:43:36,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:36,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:36,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:43:36,096 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -490735634, now seen corresponding path program 1 times [2022-12-13 12:43:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:36,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295442433] [2022-12-13 12:43:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:36,163 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 12:43:36,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:36,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295442433] [2022-12-13 12:43:36,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295442433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:36,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:36,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:43:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473331197] [2022-12-13 12:43:36,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:36,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:43:36,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:36,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:43:36,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:43:36,164 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 12:43:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:36,318 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2022-12-13 12:43:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:43:36,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-12-13 12:43:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:36,319 INFO L225 Difference]: With dead ends: 180 [2022-12-13 12:43:36,319 INFO L226 Difference]: Without dead ends: 180 [2022-12-13 12:43:36,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:43:36,320 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 50 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:36,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 407 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:43:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-13 12:43:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 132. [2022-12-13 12:43:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 131 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2022-12-13 12:43:36,323 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 22 [2022-12-13 12:43:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:36,324 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2022-12-13 12:43:36,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 12:43:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2022-12-13 12:43:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 12:43:36,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:36,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:36,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:43:36,325 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-12-13 12:43:36,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1900065523, now seen corresponding path program 1 times [2022-12-13 12:43:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:36,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467355591] [2022-12-13 12:43:36,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:36,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:43:36,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:43:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:43:36,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:43:36,366 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:43:36,367 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-12-13 12:43:36,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-12-13 12:43:36,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-12-13 12:43:36,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-12-13 12:43:36,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-12-13 12:43:36,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-12-13 12:43:36,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-12-13 12:43:36,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-12-13 12:43:36,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-12-13 12:43:36,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-12-13 12:43:36,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-12-13 12:43:36,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-12-13 12:43:36,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-12-13 12:43:36,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-12-13 12:43:36,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-12-13 12:43:36,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-12-13 12:43:36,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-12-13 12:43:36,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-12-13 12:43:36,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-12-13 12:43:36,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-12-13 12:43:36,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-12-13 12:43:36,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-12-13 12:43:36,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-12-13 12:43:36,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-12-13 12:43:36,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-12-13 12:43:36,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-12-13 12:43:36,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-12-13 12:43:36,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2022-12-13 12:43:36,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2022-12-13 12:43:36,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2022-12-13 12:43:36,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2022-12-13 12:43:36,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-12-13 12:43:36,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-12-13 12:43:36,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-12-13 12:43:36,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-12-13 12:43:36,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-12-13 12:43:36,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-12-13 12:43:36,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-12-13 12:43:36,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-12-13 12:43:36,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-12-13 12:43:36,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-12-13 12:43:36,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-12-13 12:43:36,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-12-13 12:43:36,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-12-13 12:43:36,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-12-13 12:43:36,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-12-13 12:43:36,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-12-13 12:43:36,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-12-13 12:43:36,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-12-13 12:43:36,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2022-12-13 12:43:36,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2022-12-13 12:43:36,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2022-12-13 12:43:36,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK (0 of 61 remaining) [2022-12-13 12:43:36,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:43:36,385 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:36,389 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:43:36,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:43:36 BoogieIcfgContainer [2022-12-13 12:43:36,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:43:36,409 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:43:36,409 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:43:36,409 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:43:36,410 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:43:24" (3/4) ... [2022-12-13 12:43:36,411 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 12:43:36,443 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:43:36,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:43:36,444 INFO L158 Benchmark]: Toolchain (without parser) took 12848.89ms. Allocated memory was 117.4MB in the beginning and 161.5MB in the end (delta: 44.0MB). Free memory was 81.5MB in the beginning and 124.2MB in the end (delta: -42.8MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2022-12-13 12:43:36,444 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:43:36,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.13ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 63.8MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 12:43:36,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.47ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 61.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:43:36,445 INFO L158 Benchmark]: Boogie Preprocessor took 28.60ms. Allocated memory is still 117.4MB. Free memory was 61.7MB in the beginning and 59.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:43:36,445 INFO L158 Benchmark]: RCFGBuilder took 473.03ms. Allocated memory was 117.4MB in the beginning and 161.5MB in the end (delta: 44.0MB). Free memory was 59.7MB in the beginning and 120.2MB in the end (delta: -60.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 12:43:36,445 INFO L158 Benchmark]: TraceAbstraction took 11938.33ms. Allocated memory is still 161.5MB. Free memory was 119.2MB in the beginning and 126.3MB in the end (delta: -7.2MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2022-12-13 12:43:36,446 INFO L158 Benchmark]: Witness Printer took 34.61ms. Allocated memory is still 161.5MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:43:36,447 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.12ms. Allocated memory is still 117.4MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.13ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 63.8MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.47ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 61.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.60ms. Allocated memory is still 117.4MB. Free memory was 61.7MB in the beginning and 59.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 473.03ms. Allocated memory was 117.4MB in the beginning and 161.5MB in the end (delta: 44.0MB). Free memory was 59.7MB in the beginning and 120.2MB in the end (delta: -60.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11938.33ms. Allocated memory is still 161.5MB. Free memory was 119.2MB in the beginning and 126.3MB in the end (delta: -7.2MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Witness Printer took 34.61ms. Allocated memory is still 161.5MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 1063]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1000] SLL* head = malloc(sizeof(SLL)); [L1001] head->next = ((void*)0) VAL [head={-1:0}] [L1002] head->prev = ((void*)0) VAL [head={-1:0}] [L1003] head->data = 0 VAL [head={-1:0}] [L1005] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1019] COND TRUE __VERIFIER_nondet_int() [L1020] x = malloc(sizeof(SLL)) [L1021] x->data = 1 VAL [head={-1:0}, x={-2:0}] [L1022] x->next = head VAL [head={-1:0}, x={-2:0}] [L1023] x->prev = ((void*)0) VAL [head={-1:0}, x={-2:0}] [L1024] head = x VAL [head={-2:0}, x={-2:0}] [L1050] x = head VAL [head={-2:0}, x={-2:0}] [L1053] EXPR x->data VAL [head={-2:0}, x={-2:0}, x->data=1] [L1053] COND FALSE !(x->data != 1) [L1059] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={-1:0}] [L1059] x = x->next [L1060] COND TRUE \read(*x) VAL [head={-2:0}, x={-1:0}] [L1062] EXPR x->data VAL [head={-2:0}, x={-1:0}, x->data=0] [L1062] COND TRUE x->data != 1 [L1063] reach_error() VAL [head={-2:0}, x={-1:0}] - 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: -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: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1073]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: 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, 127 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2432 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2432 mSDsluCounter, 3058 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1951 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4183 IncrementalHoareTripleChecker+Invalid, 4474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1107 mSDtfsCounter, 4183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=16, InterpolantAutomatonStates: 133, 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, 16 MinimizatonAttempts, 321 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 279 ConstructedInterpolants, 10 QuantifiedInterpolants, 2517 SizeOfPredicates, 18 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 2/6 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 12:43:36,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43829094-cca6-469d-8d50-95ac3cff5504/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-memcleanup)