./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b 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_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- 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-6b4ec56 [2022-11-20 12:15:56,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:15:56,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:15:56,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:15:56,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:15:56,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:15:56,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:15:56,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:15:56,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:15:56,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:15:56,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:15:56,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:15:56,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:15:56,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:15:56,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:15:56,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:15:56,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:15:56,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:15:56,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:15:56,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:15:56,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:15:56,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:15:56,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:15:56,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:15:56,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:15:56,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:15:56,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:15:56,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:15:56,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:15:56,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:15:56,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:15:56,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:15:56,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:15:56,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:15:56,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:15:56,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:15:56,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:15:56,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:15:56,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:15:56,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:15:56,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:15:56,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 12:15:56,984 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:15:56,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:15:56,985 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:15:56,985 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:15:56,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:15:56,986 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:15:56,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:15:56,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:15:56,988 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:15:56,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:15:56,989 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:15:56,989 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:15:56,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:15:56,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:15:56,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:15:56,990 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 12:15:56,991 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 12:15:56,991 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 12:15:56,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:15:56,991 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:15:56,992 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:15:56,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:15:56,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:15:56,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:15:56,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:15:56,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:15:56,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:15:56,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:15:56,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:15:56,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:15:56,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/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_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2022-11-20 12:15:57,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:15:57,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:15:57,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:15:57,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:15:57,307 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:15:57,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2022-11-20 12:16:00,323 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:16:00,624 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:16:00,625 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2022-11-20 12:16:00,651 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/data/78eb6ebe5/0106845d7cb3424bb486137986685aa6/FLAG7eeb4bceb [2022-11-20 12:16:00,667 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/data/78eb6ebe5/0106845d7cb3424bb486137986685aa6 [2022-11-20 12:16:00,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:16:00,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:16:00,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:16:00,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:16:00,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:16:00,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:16:00" (1/1) ... [2022-11-20 12:16:00,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2695aa06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:00, skipping insertion in model container [2022-11-20 12:16:00,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:16:00" (1/1) ... [2022-11-20 12:16:00,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:16:00,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:16:00,911 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 12:16:01,076 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_cc9beefd-d171-4a2f-9dad-f401c37fc097/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i[30633,30646] [2022-11-20 12:16:01,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:16:01,097 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:16:01,114 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 12:16:01,139 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_cc9beefd-d171-4a2f-9dad-f401c37fc097/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i[30633,30646] [2022-11-20 12:16:01,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:16:01,178 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:16:01,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01 WrapperNode [2022-11-20 12:16:01,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:16:01,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:16:01,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:16:01,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:16:01,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,219 INFO L138 Inliner]: procedures = 171, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-11-20 12:16:01,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:16:01,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:16:01,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:16:01,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:16:01,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,248 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:16:01,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:16:01,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:16:01,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:16:01,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (1/1) ... [2022-11-20 12:16:01,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:16:01,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:16:01,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:16:01,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc9beefd-d171-4a2f-9dad-f401c37fc097/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:16:01,347 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-20 12:16:01,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-20 12:16:01,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:16:01,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:16:01,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:16:01,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:16:01,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:16:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:16:01,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:16:01,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:16:01,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:16:01,354 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:16:01,560 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:16:01,576 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:16:01,727 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:16:01,750 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:16:01,750 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:16:01,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:16:01 BoogieIcfgContainer [2022-11-20 12:16:01,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:16:01,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:16:01,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:16:01,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:16:01,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:16:00" (1/3) ... [2022-11-20 12:16:01,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474cabbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:16:01, skipping insertion in model container [2022-11-20 12:16:01,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:16:01" (2/3) ... [2022-11-20 12:16:01,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474cabbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:16:01, skipping insertion in model container [2022-11-20 12:16:01,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:16:01" (3/3) ... [2022-11-20 12:16:01,761 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2022-11-20 12:16:01,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:16:01,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-20 12:16:01,786 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:16:01,826 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:16:01,863 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:16:01,880 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 48 transitions, 101 flow [2022-11-20 12:16:01,884 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 48 transitions, 101 flow [2022-11-20 12:16:01,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 101 flow [2022-11-20 12:16:01,926 INFO L130 PetriNetUnfolder]: 2/64 cut-off events. [2022-11-20 12:16:01,927 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:16:01,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 2/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2022-11-20 12:16:01,933 INFO L119 LiptonReduction]: Number of co-enabled transitions 380 [2022-11-20 12:16:03,591 INFO L134 LiptonReduction]: Checked pairs total: 342 [2022-11-20 12:16:03,591 INFO L136 LiptonReduction]: Total number of compositions: 47 [2022-11-20 12:16:03,608 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 14 places, 11 transitions, 27 flow [2022-11-20 12:16:03,622 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 29 states, 17 states have (on average 2.411764705882353) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:03,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:16:03,647 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=FINITE_AUTOMATA, 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;@6c4833d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:16:03,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 12:16:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 2.411764705882353) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:03,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:03,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:03,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-20 12:16:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash 6546, now seen corresponding path program 1 times [2022-11-20 12:16:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:03,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38707942] [2022-11-20 12:16:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:03,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:03,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38707942] [2022-11-20 12:16:03,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38707942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:03,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:03,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157462764] [2022-11-20 12:16:03,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:03,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:03,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:04,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:04,017 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 2.411764705882353) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:04,056 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-11-20 12:16:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:04,068 INFO L225 Difference]: With dead ends: 14 [2022-11-20 12:16:04,068 INFO L226 Difference]: Without dead ends: 14 [2022-11-20 12:16:04,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:04,073 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:04,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-20 12:16:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-20 12:16:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-11-20 12:16:04,110 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 2 [2022-11-20 12:16:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:04,110 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-11-20 12:16:04,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-11-20 12:16:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:04,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:04,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:04,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:16:04,112 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-20 12:16:04,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash 6545, now seen corresponding path program 1 times [2022-11-20 12:16:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:04,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271031337] [2022-11-20 12:16:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:04,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271031337] [2022-11-20 12:16:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271031337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:04,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:04,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087474664] [2022-11-20 12:16:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:04,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:04,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:04,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:04,270 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:04,286 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-11-20 12:16:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:04,288 INFO L225 Difference]: With dead ends: 11 [2022-11-20 12:16:04,288 INFO L226 Difference]: Without dead ends: 11 [2022-11-20 12:16:04,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:04,292 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:04,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-20 12:16:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-20 12:16:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-11-20 12:16:04,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 2 [2022-11-20 12:16:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:04,307 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-11-20 12:16:04,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-11-20 12:16:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 12:16:04,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:04,310 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-20 12:16:04,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:16:04,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-20 12:16:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1755287207, now seen corresponding path program 1 times [2022-11-20 12:16:04,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:04,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093320412] [2022-11-20 12:16:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:04,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:04,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:16:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:04,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:16:04,421 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:16:04,423 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-20 12:16:04,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2022-11-20 12:16:04,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2022-11-20 12:16:04,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2022-11-20 12:16:04,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2022-11-20 12:16:04,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2022-11-20 12:16:04,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:16:04,434 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-20 12:16:04,436 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 12:16:04,436 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-20 12:16:04,470 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:16:04,481 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:16:04,481 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 130 flow [2022-11-20 12:16:04,483 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 59 transitions, 130 flow [2022-11-20 12:16:04,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 130 flow [2022-11-20 12:16:04,523 INFO L130 PetriNetUnfolder]: 3/93 cut-off events. [2022-11-20 12:16:04,523 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:16:04,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 3/93 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 65. Up to 6 conditions per place. [2022-11-20 12:16:04,527 INFO L119 LiptonReduction]: Number of co-enabled transitions 980 [2022-11-20 12:16:06,026 INFO L134 LiptonReduction]: Checked pairs total: 1316 [2022-11-20 12:16:06,026 INFO L136 LiptonReduction]: Total number of compositions: 49 [2022-11-20 12:16:06,027 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 17 transitions, 46 flow [2022-11-20 12:16:06,053 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 180 states, 151 states have (on average 2.6556291390728477) internal successors, (401), 179 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:16:06,055 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=FINITE_AUTOMATA, 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;@6c4833d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:16:06,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-20 12:16:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 151 states have (on average 2.6556291390728477) internal successors, (401), 179 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:06,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:06,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:06,057 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-20 12:16:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash 10356, now seen corresponding path program 1 times [2022-11-20 12:16:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:06,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012664421] [2022-11-20 12:16:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012664421] [2022-11-20 12:16:06,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012664421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:06,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:06,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311609122] [2022-11-20 12:16:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:06,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:06,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:06,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:06,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:06,166 INFO L87 Difference]: Start difference. First operand has 180 states, 151 states have (on average 2.6556291390728477) internal successors, (401), 179 states have internal predecessors, (401), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:06,206 INFO L93 Difference]: Finished difference Result 120 states and 263 transitions. [2022-11-20 12:16:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:06,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:06,210 INFO L225 Difference]: With dead ends: 120 [2022-11-20 12:16:06,211 INFO L226 Difference]: Without dead ends: 120 [2022-11-20 12:16:06,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:06,212 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:06,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-20 12:16:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-20 12:16:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 109 states have (on average 2.4128440366972477) internal successors, (263), 119 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 263 transitions. [2022-11-20 12:16:06,231 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 263 transitions. Word has length 2 [2022-11-20 12:16:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:06,231 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 263 transitions. [2022-11-20 12:16:06,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 263 transitions. [2022-11-20 12:16:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:06,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:06,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:06,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:16:06,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-20 12:16:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash 10357, now seen corresponding path program 1 times [2022-11-20 12:16:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:06,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574346687] [2022-11-20 12:16:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:06,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:06,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574346687] [2022-11-20 12:16:06,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574346687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:06,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:06,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263197273] [2022-11-20 12:16:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:06,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:06,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:06,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:06,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:06,295 INFO L87 Difference]: Start difference. First operand 120 states and 263 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:06,313 INFO L93 Difference]: Finished difference Result 99 states and 215 transitions. [2022-11-20 12:16:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:06,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:06,315 INFO L225 Difference]: With dead ends: 99 [2022-11-20 12:16:06,315 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 12:16:06,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:06,316 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:06,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 12:16:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-20 12:16:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 2.263157894736842) internal successors, (215), 98 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 215 transitions. [2022-11-20 12:16:06,331 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 215 transitions. Word has length 2 [2022-11-20 12:16:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:06,331 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 215 transitions. [2022-11-20 12:16:06,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 215 transitions. [2022-11-20 12:16:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 12:16:06,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:06,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 12:16:06,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:16:06,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-20 12:16:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 308818922, now seen corresponding path program 1 times [2022-11-20 12:16:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:06,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129789834] [2022-11-20 12:16:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:06,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129789834] [2022-11-20 12:16:06,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129789834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:06,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:06,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657933358] [2022-11-20 12:16:06,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:06,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:06,395 INFO L87 Difference]: Start difference. First operand 99 states and 215 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:06,423 INFO L93 Difference]: Finished difference Result 120 states and 252 transitions. [2022-11-20 12:16:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:06,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 12:16:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:06,425 INFO L225 Difference]: With dead ends: 120 [2022-11-20 12:16:06,426 INFO L226 Difference]: Without dead ends: 120 [2022-11-20 12:16:06,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:06,427 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:06,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-20 12:16:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2022-11-20 12:16:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 2.277227722772277) internal successors, (230), 104 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 230 transitions. [2022-11-20 12:16:06,451 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 230 transitions. Word has length 5 [2022-11-20 12:16:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:06,452 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 230 transitions. [2022-11-20 12:16:06,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 230 transitions. [2022-11-20 12:16:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 12:16:06,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:06,453 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:06,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:16:06,453 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-20 12:16:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash -33097421, now seen corresponding path program 1 times [2022-11-20 12:16:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:06,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966298716] [2022-11-20 12:16:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:06,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:06,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966298716] [2022-11-20 12:16:06,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966298716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:06,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:06,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657772077] [2022-11-20 12:16:06,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:06,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:06,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:06,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:06,481 INFO L87 Difference]: Start difference. First operand 105 states and 230 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:06,514 INFO L93 Difference]: Finished difference Result 105 states and 210 transitions. [2022-11-20 12:16:06,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:06,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-20 12:16:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:06,516 INFO L225 Difference]: With dead ends: 105 [2022-11-20 12:16:06,518 INFO L226 Difference]: Without dead ends: 105 [2022-11-20 12:16:06,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:06,519 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:06,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-20 12:16:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2022-11-20 12:16:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 92 states have (on average 2.141304347826087) internal successors, (197), 94 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 197 transitions. [2022-11-20 12:16:06,540 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 197 transitions. Word has length 9 [2022-11-20 12:16:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:06,541 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 197 transitions. [2022-11-20 12:16:06,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 197 transitions. [2022-11-20 12:16:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:06,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:06,542 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:06,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:16:06,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-20 12:16:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1358927260, now seen corresponding path program 1 times [2022-11-20 12:16:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:06,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679823240] [2022-11-20 12:16:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:06,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:06,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679823240] [2022-11-20 12:16:06,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679823240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:06,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:06,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:06,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555601864] [2022-11-20 12:16:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:06,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:06,708 INFO L87 Difference]: Start difference. First operand 95 states and 197 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:06,743 INFO L93 Difference]: Finished difference Result 85 states and 174 transitions. [2022-11-20 12:16:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:06,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 12:16:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:06,748 INFO L225 Difference]: With dead ends: 85 [2022-11-20 12:16:06,748 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 12:16:06,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:06,749 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:06,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 12:16:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-11-20 12:16:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 2.1153846153846154) internal successors, (165), 79 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 165 transitions. [2022-11-20 12:16:06,762 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 165 transitions. Word has length 10 [2022-11-20 12:16:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:06,763 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 165 transitions. [2022-11-20 12:16:06,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 165 transitions. [2022-11-20 12:16:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:06,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:06,764 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:06,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:16:06,764 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-20 12:16:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1026017900, now seen corresponding path program 1 times [2022-11-20 12:16:06,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:06,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617944046] [2022-11-20 12:16:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:06,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:06,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617944046] [2022-11-20 12:16:06,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617944046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:06,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:06,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595637787] [2022-11-20 12:16:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:06,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:06,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:06,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:06,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:06,833 INFO L87 Difference]: Start difference. First operand 80 states and 165 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-11-20 12:16:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:06,872 INFO L93 Difference]: Finished difference Result 70 states and 142 transitions. [2022-11-20 12:16:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:06,872 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 10 [2022-11-20 12:16:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:06,874 INFO L225 Difference]: With dead ends: 70 [2022-11-20 12:16:06,874 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 12:16:06,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:06,876 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:06,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 12:16:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2022-11-20 12:16:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.016949152542373) internal successors, (119), 59 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 119 transitions. [2022-11-20 12:16:06,881 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 119 transitions. Word has length 10 [2022-11-20 12:16:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:06,881 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 119 transitions. [2022-11-20 12:16:06,881 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-11-20 12:16:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 119 transitions. [2022-11-20 12:16:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:16:06,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:06,882 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-20 12:16:06,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:16:06,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-20 12:16:06,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:06,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1743945122, now seen corresponding path program 1 times [2022-11-20 12:16:06,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:06,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058076231] [2022-11-20 12:16:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:06,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:16:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:06,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:16:06,924 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:16:06,925 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-20 12:16:06,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2022-11-20 12:16:06,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2022-11-20 12:16:06,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2022-11-20 12:16:06,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2022-11-20 12:16:06,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2022-11-20 12:16:06,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2022-11-20 12:16:06,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:16:06,927 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:06,927 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 12:16:06,927 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-20 12:16:06,942 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:16:06,943 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:16:06,944 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 70 transitions, 161 flow [2022-11-20 12:16:06,944 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 70 transitions, 161 flow [2022-11-20 12:16:06,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 70 transitions, 161 flow [2022-11-20 12:16:06,965 INFO L130 PetriNetUnfolder]: 4/122 cut-off events. [2022-11-20 12:16:06,965 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-20 12:16:06,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 122 events. 4/122 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 264 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 97. Up to 8 conditions per place. [2022-11-20 12:16:06,969 INFO L119 LiptonReduction]: Number of co-enabled transitions 1800 [2022-11-20 12:16:08,589 INFO L134 LiptonReduction]: Checked pairs total: 2980 [2022-11-20 12:16:08,589 INFO L136 LiptonReduction]: Total number of compositions: 56 [2022-11-20 12:16:08,590 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions, 63 flow [2022-11-20 12:16:08,636 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 739 states, 675 states have (on average 3.2311111111111113) internal successors, (2181), 738 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,637 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:16:08,638 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=FINITE_AUTOMATA, 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;@6c4833d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:16:08,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-20 12:16:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 739 states, 675 states have (on average 3.2311111111111113) internal successors, (2181), 738 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:08,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:08,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:08,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash 14742, now seen corresponding path program 1 times [2022-11-20 12:16:08,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:08,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997499354] [2022-11-20 12:16:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:08,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:08,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:08,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997499354] [2022-11-20 12:16:08,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997499354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:08,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:08,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:08,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834658632] [2022-11-20 12:16:08,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:08,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:08,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:08,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:08,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:08,682 INFO L87 Difference]: Start difference. First operand has 739 states, 675 states have (on average 3.2311111111111113) internal successors, (2181), 738 states have internal predecessors, (2181), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:08,709 INFO L93 Difference]: Finished difference Result 488 states and 1423 transitions. [2022-11-20 12:16:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:08,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:08,715 INFO L225 Difference]: With dead ends: 488 [2022-11-20 12:16:08,715 INFO L226 Difference]: Without dead ends: 488 [2022-11-20 12:16:08,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:08,719 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:08,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-20 12:16:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-11-20 12:16:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 3.0602150537634407) internal successors, (1423), 487 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1423 transitions. [2022-11-20 12:16:08,757 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1423 transitions. Word has length 2 [2022-11-20 12:16:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:08,757 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 1423 transitions. [2022-11-20 12:16:08,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1423 transitions. [2022-11-20 12:16:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:08,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:08,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:08,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:16:08,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 14743, now seen corresponding path program 1 times [2022-11-20 12:16:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:08,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217633345] [2022-11-20 12:16:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217633345] [2022-11-20 12:16:08,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217633345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:08,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:08,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656678005] [2022-11-20 12:16:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:08,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:08,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:08,794 INFO L87 Difference]: Start difference. First operand 488 states and 1423 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:08,815 INFO L93 Difference]: Finished difference Result 403 states and 1167 transitions. [2022-11-20 12:16:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:08,819 INFO L225 Difference]: With dead ends: 403 [2022-11-20 12:16:08,820 INFO L226 Difference]: Without dead ends: 403 [2022-11-20 12:16:08,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:08,821 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:08,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-20 12:16:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2022-11-20 12:16:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 395 states have (on average 2.9544303797468356) internal successors, (1167), 402 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1167 transitions. [2022-11-20 12:16:08,838 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1167 transitions. Word has length 2 [2022-11-20 12:16:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:08,839 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 1167 transitions. [2022-11-20 12:16:08,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1167 transitions. [2022-11-20 12:16:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 12:16:08,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:08,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 12:16:08,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:16:08,840 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash 439521117, now seen corresponding path program 1 times [2022-11-20 12:16:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:08,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919645329] [2022-11-20 12:16:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:08,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:08,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919645329] [2022-11-20 12:16:08,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919645329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:08,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:08,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993412415] [2022-11-20 12:16:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:08,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:08,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:08,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:08,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:08,861 INFO L87 Difference]: Start difference. First operand 403 states and 1167 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:08,899 INFO L93 Difference]: Finished difference Result 564 states and 1595 transitions. [2022-11-20 12:16:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:08,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 12:16:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:08,903 INFO L225 Difference]: With dead ends: 564 [2022-11-20 12:16:08,903 INFO L226 Difference]: Without dead ends: 564 [2022-11-20 12:16:08,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:08,904 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:08,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-20 12:16:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 477. [2022-11-20 12:16:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 469 states have (on average 2.9957356076759063) internal successors, (1405), 476 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1405 transitions. [2022-11-20 12:16:08,925 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1405 transitions. Word has length 5 [2022-11-20 12:16:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:08,925 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 1405 transitions. [2022-11-20 12:16:08,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1405 transitions. [2022-11-20 12:16:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 12:16:08,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:08,926 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:08,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:16:08,926 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2587118, now seen corresponding path program 1 times [2022-11-20 12:16:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:08,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958687490] [2022-11-20 12:16:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:08,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958687490] [2022-11-20 12:16:08,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958687490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:08,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:08,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:08,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194178026] [2022-11-20 12:16:08,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:08,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:08,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:08,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:08,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:08,951 INFO L87 Difference]: Start difference. First operand 477 states and 1405 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:08,989 INFO L93 Difference]: Finished difference Result 612 states and 1732 transitions. [2022-11-20 12:16:08,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:08,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-20 12:16:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:08,993 INFO L225 Difference]: With dead ends: 612 [2022-11-20 12:16:08,993 INFO L226 Difference]: Without dead ends: 612 [2022-11-20 12:16:08,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:08,994 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:08,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-11-20 12:16:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 519. [2022-11-20 12:16:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 511 states have (on average 2.98825831702544) internal successors, (1527), 518 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1527 transitions. [2022-11-20 12:16:09,015 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1527 transitions. Word has length 9 [2022-11-20 12:16:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:09,015 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1527 transitions. [2022-11-20 12:16:09,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1527 transitions. [2022-11-20 12:16:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:09,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:09,016 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:09,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:16:09,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 80199993, now seen corresponding path program 1 times [2022-11-20 12:16:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:09,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689027064] [2022-11-20 12:16:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:09,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689027064] [2022-11-20 12:16:09,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689027064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:09,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:09,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155484794] [2022-11-20 12:16:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:09,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:09,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:09,080 INFO L87 Difference]: Start difference. First operand 519 states and 1527 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-11-20 12:16:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:09,139 INFO L93 Difference]: Finished difference Result 426 states and 1229 transitions. [2022-11-20 12:16:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:09,139 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 10 [2022-11-20 12:16:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:09,142 INFO L225 Difference]: With dead ends: 426 [2022-11-20 12:16:09,142 INFO L226 Difference]: Without dead ends: 426 [2022-11-20 12:16:09,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:09,143 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:09,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-20 12:16:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 357. [2022-11-20 12:16:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 353 states have (on average 2.8725212464589234) internal successors, (1014), 356 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1014 transitions. [2022-11-20 12:16:09,181 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1014 transitions. Word has length 10 [2022-11-20 12:16:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:09,181 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 1014 transitions. [2022-11-20 12:16:09,181 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-11-20 12:16:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1014 transitions. [2022-11-20 12:16:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:09,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:09,182 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:09,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:16:09,183 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash 80202793, now seen corresponding path program 1 times [2022-11-20 12:16:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:09,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496163937] [2022-11-20 12:16:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496163937] [2022-11-20 12:16:09,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496163937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:09,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:09,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837960342] [2022-11-20 12:16:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:09,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:09,222 INFO L87 Difference]: Start difference. First operand 357 states and 1014 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-11-20 12:16:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:09,269 INFO L93 Difference]: Finished difference Result 294 states and 820 transitions. [2022-11-20 12:16:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:09,269 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 10 [2022-11-20 12:16:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:09,271 INFO L225 Difference]: With dead ends: 294 [2022-11-20 12:16:09,272 INFO L226 Difference]: Without dead ends: 294 [2022-11-20 12:16:09,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:09,273 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:09,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 12 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-20 12:16:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 231. [2022-11-20 12:16:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 229 states have (on average 2.7336244541484715) internal successors, (626), 230 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 626 transitions. [2022-11-20 12:16:09,283 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 626 transitions. Word has length 10 [2022-11-20 12:16:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:09,284 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 626 transitions. [2022-11-20 12:16:09,284 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-11-20 12:16:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 626 transitions. [2022-11-20 12:16:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:16:09,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:09,285 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:09,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:16:09,286 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:09,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:09,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1343798742, now seen corresponding path program 1 times [2022-11-20 12:16:09,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:09,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515079937] [2022-11-20 12:16:09,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:09,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:16:09,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:09,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515079937] [2022-11-20 12:16:09,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515079937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:09,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:09,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046397924] [2022-11-20 12:16:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:09,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:09,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:09,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:09,315 INFO L87 Difference]: Start difference. First operand 231 states and 626 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-20 12:16:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:09,345 INFO L93 Difference]: Finished difference Result 306 states and 811 transitions. [2022-11-20 12:16:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 13 [2022-11-20 12:16:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:09,347 INFO L225 Difference]: With dead ends: 306 [2022-11-20 12:16:09,348 INFO L226 Difference]: Without dead ends: 306 [2022-11-20 12:16:09,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:09,349 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:09,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-20 12:16:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 266. [2022-11-20 12:16:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 264 states have (on average 2.7613636363636362) internal successors, (729), 265 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 729 transitions. [2022-11-20 12:16:09,360 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 729 transitions. Word has length 13 [2022-11-20 12:16:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:09,361 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 729 transitions. [2022-11-20 12:16:09,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-20 12:16:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 729 transitions. [2022-11-20 12:16:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:16:09,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:09,363 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:09,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:16:09,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1291914693, now seen corresponding path program 1 times [2022-11-20 12:16:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:09,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580646073] [2022-11-20 12:16:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:16:09,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:09,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580646073] [2022-11-20 12:16:09,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580646073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:09,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:09,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:09,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280490894] [2022-11-20 12:16:09,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:09,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:09,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:09,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:09,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:09,407 INFO L87 Difference]: Start difference. First operand 266 states and 729 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:09,451 INFO L93 Difference]: Finished difference Result 226 states and 607 transitions. [2022-11-20 12:16:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:16:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:09,453 INFO L225 Difference]: With dead ends: 226 [2022-11-20 12:16:09,453 INFO L226 Difference]: Without dead ends: 226 [2022-11-20 12:16:09,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:09,454 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:09,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 12 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-20 12:16:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 186. [2022-11-20 12:16:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.6216216216216215) internal successors, (485), 185 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 485 transitions. [2022-11-20 12:16:09,462 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 485 transitions. Word has length 14 [2022-11-20 12:16:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:09,463 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 485 transitions. [2022-11-20 12:16:09,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 485 transitions. [2022-11-20 12:16:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:16:09,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:09,464 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-20 12:16:09,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:16:09,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-20 12:16:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1392027901, now seen corresponding path program 1 times [2022-11-20 12:16:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:09,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802491721] [2022-11-20 12:16:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:09,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:16:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:09,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:16:09,488 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:16:09,489 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-20 12:16:09,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2022-11-20 12:16:09,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2022-11-20 12:16:09,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2022-11-20 12:16:09,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2022-11-20 12:16:09,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2022-11-20 12:16:09,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2022-11-20 12:16:09,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-11-20 12:16:09,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:16:09,491 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:09,491 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 12:16:09,491 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-20 12:16:09,508 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:16:09,509 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:16:09,510 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 81 transitions, 194 flow [2022-11-20 12:16:09,510 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 81 transitions, 194 flow [2022-11-20 12:16:09,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 81 transitions, 194 flow [2022-11-20 12:16:09,535 INFO L130 PetriNetUnfolder]: 5/151 cut-off events. [2022-11-20 12:16:09,535 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-20 12:16:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 151 events. 5/151 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 346 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 130. Up to 10 conditions per place. [2022-11-20 12:16:09,539 INFO L119 LiptonReduction]: Number of co-enabled transitions 2840 [2022-11-20 12:16:11,327 INFO L134 LiptonReduction]: Checked pairs total: 4291 [2022-11-20 12:16:11,327 INFO L136 LiptonReduction]: Total number of compositions: 63 [2022-11-20 12:16:11,328 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 82 flow [2022-11-20 12:16:11,441 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2978 states, 2843 states have (on average 3.8663383749560323) internal successors, (10992), 2977 states have internal predecessors, (10992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:16:11,443 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=FINITE_AUTOMATA, 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;@6c4833d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:16:11,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-20 12:16:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 2978 states, 2843 states have (on average 3.8663383749560323) internal successors, (10992), 2977 states have internal predecessors, (10992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:11,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:11,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:11,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 19698, now seen corresponding path program 1 times [2022-11-20 12:16:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:11,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064503167] [2022-11-20 12:16:11,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:11,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:11,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064503167] [2022-11-20 12:16:11,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064503167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:11,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:11,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:11,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099793994] [2022-11-20 12:16:11,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:11,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:11,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:11,487 INFO L87 Difference]: Start difference. First operand has 2978 states, 2843 states have (on average 3.8663383749560323) internal successors, (10992), 2977 states have internal predecessors, (10992), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:11,550 INFO L93 Difference]: Finished difference Result 1960 states and 7167 transitions. [2022-11-20 12:16:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:11,565 INFO L225 Difference]: With dead ends: 1960 [2022-11-20 12:16:11,566 INFO L226 Difference]: Without dead ends: 1960 [2022-11-20 12:16:11,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:11,566 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:11,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2022-11-20 12:16:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1960. [2022-11-20 12:16:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1913 states have (on average 3.7464715107161526) internal successors, (7167), 1959 states have internal predecessors, (7167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 7167 transitions. [2022-11-20 12:16:11,651 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 7167 transitions. Word has length 2 [2022-11-20 12:16:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:11,651 INFO L495 AbstractCegarLoop]: Abstraction has 1960 states and 7167 transitions. [2022-11-20 12:16:11,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 7167 transitions. [2022-11-20 12:16:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:11,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:11,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:11,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:16:11,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:11,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash 19699, now seen corresponding path program 1 times [2022-11-20 12:16:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:11,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771257122] [2022-11-20 12:16:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:11,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771257122] [2022-11-20 12:16:11,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771257122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:11,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:11,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389851206] [2022-11-20 12:16:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:11,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:11,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:11,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:11,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:11,700 INFO L87 Difference]: Start difference. First operand 1960 states and 7167 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:11,743 INFO L93 Difference]: Finished difference Result 1619 states and 5887 transitions. [2022-11-20 12:16:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:11,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:11,792 INFO L225 Difference]: With dead ends: 1619 [2022-11-20 12:16:11,792 INFO L226 Difference]: Without dead ends: 1619 [2022-11-20 12:16:11,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:11,793 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:11,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-11-20 12:16:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2022-11-20 12:16:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1603 states have (on average 3.6724890829694323) internal successors, (5887), 1618 states have internal predecessors, (5887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 5887 transitions. [2022-11-20 12:16:11,859 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 5887 transitions. Word has length 2 [2022-11-20 12:16:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:11,860 INFO L495 AbstractCegarLoop]: Abstraction has 1619 states and 5887 transitions. [2022-11-20 12:16:11,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 5887 transitions. [2022-11-20 12:16:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 12:16:11,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:11,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 12:16:11,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:16:11,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash 587311532, now seen corresponding path program 1 times [2022-11-20 12:16:11,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:11,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583134167] [2022-11-20 12:16:11,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:11,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583134167] [2022-11-20 12:16:11,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583134167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:11,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:11,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:11,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875198878] [2022-11-20 12:16:11,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:11,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:11,883 INFO L87 Difference]: Start difference. First operand 1619 states and 5887 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:11,952 INFO L93 Difference]: Finished difference Result 2376 states and 8464 transitions. [2022-11-20 12:16:11,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:11,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 12:16:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:11,971 INFO L225 Difference]: With dead ends: 2376 [2022-11-20 12:16:11,971 INFO L226 Difference]: Without dead ends: 2376 [2022-11-20 12:16:11,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:11,973 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:11,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2022-11-20 12:16:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1989. [2022-11-20 12:16:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1973 states have (on average 3.7197161682716677) internal successors, (7339), 1988 states have internal predecessors, (7339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 7339 transitions. [2022-11-20 12:16:12,060 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 7339 transitions. Word has length 5 [2022-11-20 12:16:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:12,060 INFO L495 AbstractCegarLoop]: Abstraction has 1989 states and 7339 transitions. [2022-11-20 12:16:12,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 7339 transitions. [2022-11-20 12:16:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 12:16:12,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:12,061 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:12,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 12:16:12,062 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1563790715, now seen corresponding path program 1 times [2022-11-20 12:16:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:12,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24776270] [2022-11-20 12:16:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:12,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24776270] [2022-11-20 12:16:12,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24776270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:12,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899755412] [2022-11-20 12:16:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:12,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:12,088 INFO L87 Difference]: Start difference. First operand 1989 states and 7339 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:12,164 INFO L93 Difference]: Finished difference Result 2772 states and 9954 transitions. [2022-11-20 12:16:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:12,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-20 12:16:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:12,195 INFO L225 Difference]: With dead ends: 2772 [2022-11-20 12:16:12,196 INFO L226 Difference]: Without dead ends: 2772 [2022-11-20 12:16:12,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:12,197 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:12,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2022-11-20 12:16:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2311. [2022-11-20 12:16:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 2295 states have (on average 3.7433551198257082) internal successors, (8591), 2310 states have internal predecessors, (8591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 8591 transitions. [2022-11-20 12:16:12,348 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 8591 transitions. Word has length 9 [2022-11-20 12:16:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:12,348 INFO L495 AbstractCegarLoop]: Abstraction has 2311 states and 8591 transitions. [2022-11-20 12:16:12,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 8591 transitions. [2022-11-20 12:16:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:12,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:12,349 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:12,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 12:16:12,350 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash 94498727, now seen corresponding path program 1 times [2022-11-20 12:16:12,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:12,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062164405] [2022-11-20 12:16:12,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:12,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:12,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062164405] [2022-11-20 12:16:12,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062164405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:12,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:12,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564096809] [2022-11-20 12:16:12,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:12,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:12,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:12,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:12,416 INFO L87 Difference]: Start difference. First operand 2311 states and 8591 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:12,477 INFO L93 Difference]: Finished difference Result 1850 states and 6767 transitions. [2022-11-20 12:16:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:12,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 12:16:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:12,495 INFO L225 Difference]: With dead ends: 1850 [2022-11-20 12:16:12,495 INFO L226 Difference]: Without dead ends: 1850 [2022-11-20 12:16:12,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:12,496 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:12,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 12 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2022-11-20 12:16:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1489. [2022-11-20 12:16:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1481 states have (on average 3.6185010128291695) internal successors, (5359), 1488 states have internal predecessors, (5359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5359 transitions. [2022-11-20 12:16:12,555 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5359 transitions. Word has length 10 [2022-11-20 12:16:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:12,555 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 5359 transitions. [2022-11-20 12:16:12,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5359 transitions. [2022-11-20 12:16:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:12,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:12,556 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:12,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 12:16:12,557 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1232874439, now seen corresponding path program 1 times [2022-11-20 12:16:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:12,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844215771] [2022-11-20 12:16:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844215771] [2022-11-20 12:16:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844215771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:12,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:12,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747955788] [2022-11-20 12:16:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:12,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:12,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:12,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:12,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:12,605 INFO L87 Difference]: Start difference. First operand 1489 states and 5359 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-11-20 12:16:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:12,659 INFO L93 Difference]: Finished difference Result 1202 states and 4263 transitions. [2022-11-20 12:16:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:12,659 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 10 [2022-11-20 12:16:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:12,665 INFO L225 Difference]: With dead ends: 1202 [2022-11-20 12:16:12,665 INFO L226 Difference]: Without dead ends: 1202 [2022-11-20 12:16:12,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:12,666 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:12,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 12 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-11-20 12:16:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 915. [2022-11-20 12:16:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 911 states have (on average 3.4763995609220637) internal successors, (3167), 914 states have internal predecessors, (3167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 3167 transitions. [2022-11-20 12:16:12,700 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 3167 transitions. Word has length 10 [2022-11-20 12:16:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:12,701 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 3167 transitions. [2022-11-20 12:16:12,701 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-11-20 12:16:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 3167 transitions. [2022-11-20 12:16:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:16:12,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:12,702 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:12,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 12:16:12,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash -840748666, now seen corresponding path program 1 times [2022-11-20 12:16:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:12,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112952668] [2022-11-20 12:16:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:16:12,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:12,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112952668] [2022-11-20 12:16:12,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112952668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:12,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:12,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645536890] [2022-11-20 12:16:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:12,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:12,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:12,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:12,730 INFO L87 Difference]: Start difference. First operand 915 states and 3167 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-20 12:16:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:12,789 INFO L93 Difference]: Finished difference Result 1320 states and 4478 transitions. [2022-11-20 12:16:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:12,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 13 [2022-11-20 12:16:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:12,795 INFO L225 Difference]: With dead ends: 1320 [2022-11-20 12:16:12,796 INFO L226 Difference]: Without dead ends: 1320 [2022-11-20 12:16:12,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:12,796 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:12,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-11-20 12:16:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1113. [2022-11-20 12:16:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1109 states have (on average 3.522091974752029) internal successors, (3906), 1112 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 3906 transitions. [2022-11-20 12:16:12,835 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 3906 transitions. Word has length 13 [2022-11-20 12:16:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:12,835 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 3906 transitions. [2022-11-20 12:16:12,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-20 12:16:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 3906 transitions. [2022-11-20 12:16:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:16:12,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:12,836 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:12,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 12:16:12,837 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash -293401440, now seen corresponding path program 1 times [2022-11-20 12:16:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:12,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221480963] [2022-11-20 12:16:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:16:12,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:12,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221480963] [2022-11-20 12:16:12,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221480963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:12,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:12,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204866093] [2022-11-20 12:16:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:12,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:12,930 INFO L87 Difference]: Start difference. First operand 1113 states and 3906 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:12,975 INFO L93 Difference]: Finished difference Result 906 states and 3127 transitions. [2022-11-20 12:16:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:12,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:16:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:12,980 INFO L225 Difference]: With dead ends: 906 [2022-11-20 12:16:12,980 INFO L226 Difference]: Without dead ends: 906 [2022-11-20 12:16:12,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:12,981 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:12,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-20 12:16:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 699. [2022-11-20 12:16:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 697 states have (on average 3.3687230989956958) internal successors, (2348), 698 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 2348 transitions. [2022-11-20 12:16:13,005 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 2348 transitions. Word has length 14 [2022-11-20 12:16:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:13,006 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 2348 transitions. [2022-11-20 12:16:13,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 2348 transitions. [2022-11-20 12:16:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:16:13,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:13,007 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:13,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 12:16:13,008 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 751455893, now seen corresponding path program 1 times [2022-11-20 12:16:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:13,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691680367] [2022-11-20 12:16:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:16:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691680367] [2022-11-20 12:16:13,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691680367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:13,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:13,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:13,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43081969] [2022-11-20 12:16:13,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:13,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:13,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:13,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:13,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:13,053 INFO L87 Difference]: Start difference. First operand 699 states and 2348 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:13,092 INFO L93 Difference]: Finished difference Result 954 states and 3172 transitions. [2022-11-20 12:16:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:16:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:13,097 INFO L225 Difference]: With dead ends: 954 [2022-11-20 12:16:13,097 INFO L226 Difference]: Without dead ends: 954 [2022-11-20 12:16:13,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:13,098 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:13,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-11-20 12:16:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 824. [2022-11-20 12:16:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 3.4221411192214113) internal successors, (2813), 823 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2813 transitions. [2022-11-20 12:16:13,125 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2813 transitions. Word has length 17 [2022-11-20 12:16:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:13,125 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 2813 transitions. [2022-11-20 12:16:13,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2813 transitions. [2022-11-20 12:16:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:16:13,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:13,127 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:13,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 12:16:13,127 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1820299302, now seen corresponding path program 1 times [2022-11-20 12:16:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:13,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072491609] [2022-11-20 12:16:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:16:13,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:13,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072491609] [2022-11-20 12:16:13,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072491609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:13,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:13,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94891620] [2022-11-20 12:16:13,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:13,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:13,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:13,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:13,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:13,241 INFO L87 Difference]: Start difference. First operand 824 states and 2813 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:13,294 INFO L93 Difference]: Finished difference Result 694 states and 2324 transitions. [2022-11-20 12:16:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 12:16:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:13,297 INFO L225 Difference]: With dead ends: 694 [2022-11-20 12:16:13,298 INFO L226 Difference]: Without dead ends: 694 [2022-11-20 12:16:13,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:13,300 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:13,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-11-20 12:16:13,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 564. [2022-11-20 12:16:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 3.2593250444049735) internal successors, (1835), 563 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1835 transitions. [2022-11-20 12:16:13,321 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1835 transitions. Word has length 18 [2022-11-20 12:16:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:13,322 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 1835 transitions. [2022-11-20 12:16:13,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1835 transitions. [2022-11-20 12:16:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 12:16:13,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:13,325 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:13,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 12:16:13,326 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 12:16:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash 591410128, now seen corresponding path program 1 times [2022-11-20 12:16:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:13,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787418790] [2022-11-20 12:16:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:13,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:16:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:13,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:16:13,361 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:16:13,361 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2022-11-20 12:16:13,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2022-11-20 12:16:13,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2022-11-20 12:16:13,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2022-11-20 12:16:13,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2022-11-20 12:16:13,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2022-11-20 12:16:13,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2022-11-20 12:16:13,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2022-11-20 12:16:13,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2022-11-20 12:16:13,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-20 12:16:13,363 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:13,364 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 12:16:13,364 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-11-20 12:16:13,391 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:16:13,394 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:16:13,394 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 92 transitions, 229 flow [2022-11-20 12:16:13,394 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 92 transitions, 229 flow [2022-11-20 12:16:13,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions, 229 flow [2022-11-20 12:16:13,453 INFO L130 PetriNetUnfolder]: 6/180 cut-off events. [2022-11-20 12:16:13,457 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-20 12:16:13,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 180 events. 6/180 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 422 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 164. Up to 12 conditions per place. [2022-11-20 12:16:13,464 INFO L119 LiptonReduction]: Number of co-enabled transitions 4100 [2022-11-20 12:16:15,341 INFO L134 LiptonReduction]: Checked pairs total: 6772 [2022-11-20 12:16:15,341 INFO L136 LiptonReduction]: Total number of compositions: 70 [2022-11-20 12:16:15,342 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 29 transitions, 103 flow [2022-11-20 12:16:15,807 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 11937 states, 11659 states have (on average 4.543271292563685) internal successors, (52970), 11936 states have internal predecessors, (52970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:15,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:16:15,808 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=FINITE_AUTOMATA, 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;@6c4833d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:16:15,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-20 12:16:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 11937 states, 11659 states have (on average 4.543271292563685) internal successors, (52970), 11936 states have internal predecessors, (52970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:15,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:15,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:15,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash 25231, now seen corresponding path program 1 times [2022-11-20 12:16:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:15,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568962184] [2022-11-20 12:16:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:15,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568962184] [2022-11-20 12:16:15,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568962184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:15,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:15,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951272277] [2022-11-20 12:16:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:15,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:15,906 INFO L87 Difference]: Start difference. First operand has 11937 states, 11659 states have (on average 4.543271292563685) internal successors, (52970), 11936 states have internal predecessors, (52970), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:16,125 INFO L93 Difference]: Finished difference Result 7848 states and 34559 transitions. [2022-11-20 12:16:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:16,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:16,205 INFO L225 Difference]: With dead ends: 7848 [2022-11-20 12:16:16,205 INFO L226 Difference]: Without dead ends: 7848 [2022-11-20 12:16:16,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:16,206 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:16,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2022-11-20 12:16:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 7848. [2022-11-20 12:16:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7848 states, 7753 states have (on average 4.457500322455823) internal successors, (34559), 7847 states have internal predecessors, (34559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7848 states to 7848 states and 34559 transitions. [2022-11-20 12:16:16,707 INFO L78 Accepts]: Start accepts. Automaton has 7848 states and 34559 transitions. Word has length 2 [2022-11-20 12:16:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:16,707 INFO L495 AbstractCegarLoop]: Abstraction has 7848 states and 34559 transitions. [2022-11-20 12:16:16,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 7848 states and 34559 transitions. [2022-11-20 12:16:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:16,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:16,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:16,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 12:16:16,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 25233, now seen corresponding path program 1 times [2022-11-20 12:16:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:16,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60400659] [2022-11-20 12:16:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:16,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:16,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60400659] [2022-11-20 12:16:16,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60400659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:16,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:16,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:16,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789516313] [2022-11-20 12:16:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:16,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:16,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:16,730 INFO L87 Difference]: Start difference. First operand 7848 states and 34559 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:16,936 INFO L93 Difference]: Finished difference Result 6483 states and 28415 transitions. [2022-11-20 12:16:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:16,993 INFO L225 Difference]: With dead ends: 6483 [2022-11-20 12:16:16,993 INFO L226 Difference]: Without dead ends: 6483 [2022-11-20 12:16:16,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:16,994 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:16,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6483 states. [2022-11-20 12:16:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6483 to 6483. [2022-11-20 12:16:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6483 states, 6451 states have (on average 4.40474345062781) internal successors, (28415), 6482 states have internal predecessors, (28415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6483 states to 6483 states and 28415 transitions. [2022-11-20 12:16:17,415 INFO L78 Accepts]: Start accepts. Automaton has 6483 states and 28415 transitions. Word has length 2 [2022-11-20 12:16:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:17,415 INFO L495 AbstractCegarLoop]: Abstraction has 6483 states and 28415 transitions. [2022-11-20 12:16:17,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6483 states and 28415 transitions. [2022-11-20 12:16:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 12:16:17,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:17,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 12:16:17,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 12:16:17,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash 752368821, now seen corresponding path program 1 times [2022-11-20 12:16:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:17,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536586776] [2022-11-20 12:16:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:17,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:17,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536586776] [2022-11-20 12:16:17,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536586776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:17,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:17,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844083030] [2022-11-20 12:16:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:17,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:17,437 INFO L87 Difference]: Start difference. First operand 6483 states and 28415 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:17,595 INFO L93 Difference]: Finished difference Result 9660 states and 41577 transitions. [2022-11-20 12:16:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:17,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 12:16:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:17,811 INFO L225 Difference]: With dead ends: 9660 [2022-11-20 12:16:17,811 INFO L226 Difference]: Without dead ends: 9660 [2022-11-20 12:16:17,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:17,812 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:17,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9660 states. [2022-11-20 12:16:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9660 to 8061. [2022-11-20 12:16:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8061 states, 8029 states have (on average 4.452982936853904) internal successors, (35753), 8060 states have internal predecessors, (35753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8061 states to 8061 states and 35753 transitions. [2022-11-20 12:16:18,209 INFO L78 Accepts]: Start accepts. Automaton has 8061 states and 35753 transitions. Word has length 5 [2022-11-20 12:16:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:18,209 INFO L495 AbstractCegarLoop]: Abstraction has 8061 states and 35753 transitions. [2022-11-20 12:16:18,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 8061 states and 35753 transitions. [2022-11-20 12:16:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 12:16:18,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:18,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:18,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-20 12:16:18,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2072314995, now seen corresponding path program 1 times [2022-11-20 12:16:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:18,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017348371] [2022-11-20 12:16:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:18,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017348371] [2022-11-20 12:16:18,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017348371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:18,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:18,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814227488] [2022-11-20 12:16:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:18,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:18,234 INFO L87 Difference]: Start difference. First operand 8061 states and 35753 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:18,574 INFO L93 Difference]: Finished difference Result 11544 states and 50067 transitions. [2022-11-20 12:16:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:18,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-20 12:16:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:18,677 INFO L225 Difference]: With dead ends: 11544 [2022-11-20 12:16:18,677 INFO L226 Difference]: Without dead ends: 11544 [2022-11-20 12:16:18,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:18,678 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:18,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11544 states. [2022-11-20 12:16:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11544 to 9575. [2022-11-20 12:16:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9575 states, 9543 states have (on average 4.484019700303888) internal successors, (42791), 9574 states have internal predecessors, (42791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9575 states to 9575 states and 42791 transitions. [2022-11-20 12:16:19,375 INFO L78 Accepts]: Start accepts. Automaton has 9575 states and 42791 transitions. Word has length 9 [2022-11-20 12:16:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:19,376 INFO L495 AbstractCegarLoop]: Abstraction has 9575 states and 42791 transitions. [2022-11-20 12:16:19,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9575 states and 42791 transitions. [2022-11-20 12:16:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:19,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:19,377 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:19,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-20 12:16:19,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:19,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1288422417, now seen corresponding path program 1 times [2022-11-20 12:16:19,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:19,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911209848] [2022-11-20 12:16:19,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:19,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:19,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911209848] [2022-11-20 12:16:19,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911209848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:19,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:19,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64322663] [2022-11-20 12:16:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:19,439 INFO L87 Difference]: Start difference. First operand 9575 states and 42791 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:19,564 INFO L93 Difference]: Finished difference Result 7606 states and 33546 transitions. [2022-11-20 12:16:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:19,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 12:16:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:19,613 INFO L225 Difference]: With dead ends: 7606 [2022-11-20 12:16:19,613 INFO L226 Difference]: Without dead ends: 7606 [2022-11-20 12:16:19,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:19,615 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:19,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2022-11-20 12:16:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 6041. [2022-11-20 12:16:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6041 states, 6025 states have (on average 4.3613278008298755) internal successors, (26277), 6040 states have internal predecessors, (26277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6041 states to 6041 states and 26277 transitions. [2022-11-20 12:16:20,119 INFO L78 Accepts]: Start accepts. Automaton has 6041 states and 26277 transitions. Word has length 10 [2022-11-20 12:16:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:20,119 INFO L495 AbstractCegarLoop]: Abstraction has 6041 states and 26277 transitions. [2022-11-20 12:16:20,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6041 states and 26277 transitions. [2022-11-20 12:16:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:20,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:20,120 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:20,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-20 12:16:20,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 182748769, now seen corresponding path program 1 times [2022-11-20 12:16:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:20,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63064050] [2022-11-20 12:16:20,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:20,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:20,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63064050] [2022-11-20 12:16:20,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63064050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:20,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:20,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:20,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082707999] [2022-11-20 12:16:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:20,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:20,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:20,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:20,161 INFO L87 Difference]: Start difference. First operand 6041 states and 26277 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-11-20 12:16:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:20,261 INFO L93 Difference]: Finished difference Result 4846 states and 20830 transitions. [2022-11-20 12:16:20,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:20,262 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 10 [2022-11-20 12:16:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:20,285 INFO L225 Difference]: With dead ends: 4846 [2022-11-20 12:16:20,285 INFO L226 Difference]: Without dead ends: 4846 [2022-11-20 12:16:20,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:20,287 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:20,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4846 states. [2022-11-20 12:16:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4846 to 3651. [2022-11-20 12:16:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3643 states have (on average 4.222618720834477) internal successors, (15383), 3650 states have internal predecessors, (15383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 15383 transitions. [2022-11-20 12:16:20,554 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 15383 transitions. Word has length 10 [2022-11-20 12:16:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:20,554 INFO L495 AbstractCegarLoop]: Abstraction has 3651 states and 15383 transitions. [2022-11-20 12:16:20,554 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-11-20 12:16:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 15383 transitions. [2022-11-20 12:16:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:16:20,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:20,555 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:20,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-20 12:16:20,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1038219332, now seen corresponding path program 1 times [2022-11-20 12:16:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:20,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204482623] [2022-11-20 12:16:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:16:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:20,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204482623] [2022-11-20 12:16:20,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204482623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:20,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:20,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252847075] [2022-11-20 12:16:20,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:20,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:20,610 INFO L87 Difference]: Start difference. First operand 3651 states and 15383 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-20 12:16:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:20,710 INFO L93 Difference]: Finished difference Result 5412 states and 22389 transitions. [2022-11-20 12:16:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:20,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 13 [2022-11-20 12:16:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:20,741 INFO L225 Difference]: With dead ends: 5412 [2022-11-20 12:16:20,741 INFO L226 Difference]: Without dead ends: 5412 [2022-11-20 12:16:20,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:20,742 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:20,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2022-11-20 12:16:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 4525. [2022-11-20 12:16:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4525 states, 4517 states have (on average 4.272083241089218) internal successors, (19297), 4524 states have internal predecessors, (19297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 19297 transitions. [2022-11-20 12:16:20,958 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 19297 transitions. Word has length 13 [2022-11-20 12:16:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:20,958 INFO L495 AbstractCegarLoop]: Abstraction has 4525 states and 19297 transitions. [2022-11-20 12:16:20,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-20 12:16:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 19297 transitions. [2022-11-20 12:16:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:16:20,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:20,961 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:20,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-20 12:16:20,961 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:20,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2120024646, now seen corresponding path program 1 times [2022-11-20 12:16:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:20,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087515718] [2022-11-20 12:16:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:16:21,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087515718] [2022-11-20 12:16:21,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087515718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:21,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:21,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519827339] [2022-11-20 12:16:21,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:21,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:21,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:21,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:21,024 INFO L87 Difference]: Start difference. First operand 4525 states and 19297 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:21,236 INFO L93 Difference]: Finished difference Result 3638 states and 15318 transitions. [2022-11-20 12:16:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:16:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:21,252 INFO L225 Difference]: With dead ends: 3638 [2022-11-20 12:16:21,253 INFO L226 Difference]: Without dead ends: 3638 [2022-11-20 12:16:21,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:21,253 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:21,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:16:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2022-11-20 12:16:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 2751. [2022-11-20 12:16:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2747 states have (on average 4.127775755369494) internal successors, (11339), 2750 states have internal predecessors, (11339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 11339 transitions. [2022-11-20 12:16:21,330 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 11339 transitions. Word has length 14 [2022-11-20 12:16:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:21,331 INFO L495 AbstractCegarLoop]: Abstraction has 2751 states and 11339 transitions. [2022-11-20 12:16:21,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 11339 transitions. [2022-11-20 12:16:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:16:21,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:21,332 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:21,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-20 12:16:21,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash 407852683, now seen corresponding path program 1 times [2022-11-20 12:16:21,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:21,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928601323] [2022-11-20 12:16:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:16:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:21,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928601323] [2022-11-20 12:16:21,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928601323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:21,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:21,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193086672] [2022-11-20 12:16:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:21,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:21,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:21,368 INFO L87 Difference]: Start difference. First operand 2751 states and 11339 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:21,437 INFO L93 Difference]: Finished difference Result 4020 states and 16331 transitions. [2022-11-20 12:16:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:21,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:16:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:21,454 INFO L225 Difference]: With dead ends: 4020 [2022-11-20 12:16:21,454 INFO L226 Difference]: Without dead ends: 4020 [2022-11-20 12:16:21,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:21,455 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:21,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2022-11-20 12:16:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3381. [2022-11-20 12:16:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3377 states have (on average 4.184187148356529) internal successors, (14130), 3380 states have internal predecessors, (14130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 14130 transitions. [2022-11-20 12:16:21,678 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 14130 transitions. Word has length 17 [2022-11-20 12:16:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:21,679 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 14130 transitions. [2022-11-20 12:16:21,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 14130 transitions. [2022-11-20 12:16:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:16:21,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:21,680 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:21,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-20 12:16:21,680 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:21,681 INFO L85 PathProgramCache]: Analyzing trace with hash -241465441, now seen corresponding path program 1 times [2022-11-20 12:16:21,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:21,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815919918] [2022-11-20 12:16:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:16:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815919918] [2022-11-20 12:16:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815919918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:21,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:21,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002407450] [2022-11-20 12:16:21,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:21,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:21,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:21,723 INFO L87 Difference]: Start difference. First operand 3381 states and 14130 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:21,793 INFO L93 Difference]: Finished difference Result 2742 states and 11290 transitions. [2022-11-20 12:16:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 12:16:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:21,805 INFO L225 Difference]: With dead ends: 2742 [2022-11-20 12:16:21,805 INFO L226 Difference]: Without dead ends: 2742 [2022-11-20 12:16:21,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:21,806 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:21,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2022-11-20 12:16:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2103. [2022-11-20 12:16:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2101 states have (on average 4.021894336030462) internal successors, (8450), 2102 states have internal predecessors, (8450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 8450 transitions. [2022-11-20 12:16:21,874 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 8450 transitions. Word has length 18 [2022-11-20 12:16:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:21,874 INFO L495 AbstractCegarLoop]: Abstraction has 2103 states and 8450 transitions. [2022-11-20 12:16:21,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 8450 transitions. [2022-11-20 12:16:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 12:16:21,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:21,877 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:21,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-20 12:16:21,877 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1255481654, now seen corresponding path program 1 times [2022-11-20 12:16:21,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:21,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528073171] [2022-11-20 12:16:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:21,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-20 12:16:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:21,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528073171] [2022-11-20 12:16:21,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528073171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:21,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:21,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:21,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708119585] [2022-11-20 12:16:21,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:21,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:21,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:21,906 INFO L87 Difference]: Start difference. First operand 2103 states and 8450 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:21,966 INFO L93 Difference]: Finished difference Result 2898 states and 11581 transitions. [2022-11-20 12:16:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:21,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 12:16:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:21,978 INFO L225 Difference]: With dead ends: 2898 [2022-11-20 12:16:21,979 INFO L226 Difference]: Without dead ends: 2898 [2022-11-20 12:16:21,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:21,980 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:21,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-11-20 12:16:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2498. [2022-11-20 12:16:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2496 states have (on average 4.086939102564102) internal successors, (10201), 2497 states have internal predecessors, (10201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 10201 transitions. [2022-11-20 12:16:22,058 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 10201 transitions. Word has length 21 [2022-11-20 12:16:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:22,058 INFO L495 AbstractCegarLoop]: Abstraction has 2498 states and 10201 transitions. [2022-11-20 12:16:22,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 10201 transitions. [2022-11-20 12:16:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:16:22,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:22,063 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:22,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-20 12:16:22,063 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash 265228522, now seen corresponding path program 1 times [2022-11-20 12:16:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:22,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659870086] [2022-11-20 12:16:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-20 12:16:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:22,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659870086] [2022-11-20 12:16:22,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659870086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:22,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:22,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:22,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407812205] [2022-11-20 12:16:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:22,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:22,344 INFO L87 Difference]: Start difference. First operand 2498 states and 10201 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-11-20 12:16:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:22,414 INFO L93 Difference]: Finished difference Result 2098 states and 8421 transitions. [2022-11-20 12:16:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 22 [2022-11-20 12:16:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:22,423 INFO L225 Difference]: With dead ends: 2098 [2022-11-20 12:16:22,423 INFO L226 Difference]: Without dead ends: 2098 [2022-11-20 12:16:22,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:22,424 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:22,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2022-11-20 12:16:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1698. [2022-11-20 12:16:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1697 states have (on average 3.9133765468473776) internal successors, (6641), 1697 states have internal predecessors, (6641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 6641 transitions. [2022-11-20 12:16:22,478 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 6641 transitions. Word has length 22 [2022-11-20 12:16:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:22,478 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 6641 transitions. [2022-11-20 12:16:22,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-11-20 12:16:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 6641 transitions. [2022-11-20 12:16:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:16:22,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:22,481 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:22,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-20 12:16:22,481 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-20 12:16:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash -371637988, now seen corresponding path program 1 times [2022-11-20 12:16:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:22,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370425348] [2022-11-20 12:16:22,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:22,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:22,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:16:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:22,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:16:22,528 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:16:22,528 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2022-11-20 12:16:22,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-20 12:16:22,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (7 of 10 remaining) [2022-11-20 12:16:22,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-20 12:16:22,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-20 12:16:22,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 10 remaining) [2022-11-20 12:16:22,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-20 12:16:22,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2022-11-20 12:16:22,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2022-11-20 12:16:22,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-20 12:16:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-20 12:16:22,531 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:22,533 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 12:16:22,534 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2022-11-20 12:16:22,557 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:16:22,561 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:16:22,561 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 103 transitions, 266 flow [2022-11-20 12:16:22,561 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 103 transitions, 266 flow [2022-11-20 12:16:22,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 103 transitions, 266 flow [2022-11-20 12:16:22,603 INFO L130 PetriNetUnfolder]: 7/209 cut-off events. [2022-11-20 12:16:22,603 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-11-20 12:16:22,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 209 events. 7/209 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 540 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 199. Up to 14 conditions per place. [2022-11-20 12:16:22,614 INFO L119 LiptonReduction]: Number of co-enabled transitions 5580 [2022-11-20 12:16:24,658 INFO L134 LiptonReduction]: Checked pairs total: 8508 [2022-11-20 12:16:24,658 INFO L136 LiptonReduction]: Total number of compositions: 77 [2022-11-20 12:16:24,659 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 126 flow [2022-11-20 12:16:26,437 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 47776 states, 47211 states have (on average 5.248331956535553) internal successors, (247779), 47775 states have internal predecessors, (247779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:26,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:16:26,439 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=FINITE_AUTOMATA, 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;@6c4833d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:16:26,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-20 12:16:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 47776 states, 47211 states have (on average 5.248331956535553) internal successors, (247779), 47775 states have internal predecessors, (247779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:26,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:26,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:26,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:26,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 31339, now seen corresponding path program 1 times [2022-11-20 12:16:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:26,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880707176] [2022-11-20 12:16:26,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:26,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:26,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:26,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880707176] [2022-11-20 12:16:26,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880707176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:26,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:26,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:26,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246599648] [2022-11-20 12:16:26,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:26,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:26,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:26,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:26,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:26,616 INFO L87 Difference]: Start difference. First operand has 47776 states, 47211 states have (on average 5.248331956535553) internal successors, (247779), 47775 states have internal predecessors, (247779), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:27,411 INFO L93 Difference]: Finished difference Result 31400 states and 161791 transitions. [2022-11-20 12:16:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:27,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:27,631 INFO L225 Difference]: With dead ends: 31400 [2022-11-20 12:16:27,631 INFO L226 Difference]: Without dead ends: 31400 [2022-11-20 12:16:27,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:27,632 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:27,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31400 states. [2022-11-20 12:16:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31400 to 31400. [2022-11-20 12:16:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31400 states, 31209 states have (on average 5.184113556986767) internal successors, (161791), 31399 states have internal predecessors, (161791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31400 states to 31400 states and 161791 transitions. [2022-11-20 12:16:29,499 INFO L78 Accepts]: Start accepts. Automaton has 31400 states and 161791 transitions. Word has length 2 [2022-11-20 12:16:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:29,499 INFO L495 AbstractCegarLoop]: Abstraction has 31400 states and 161791 transitions. [2022-11-20 12:16:29,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 31400 states and 161791 transitions. [2022-11-20 12:16:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:29,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:29,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:29,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-20 12:16:29,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash 31338, now seen corresponding path program 1 times [2022-11-20 12:16:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:29,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924251129] [2022-11-20 12:16:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:29,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924251129] [2022-11-20 12:16:29,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924251129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:29,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:29,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763527619] [2022-11-20 12:16:29,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:29,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:29,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:29,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:29,536 INFO L87 Difference]: Start difference. First operand 31400 states and 161791 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:29,809 INFO L93 Difference]: Finished difference Result 25939 states and 133119 transitions. [2022-11-20 12:16:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:29,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:16:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:29,963 INFO L225 Difference]: With dead ends: 25939 [2022-11-20 12:16:29,963 INFO L226 Difference]: Without dead ends: 25939 [2022-11-20 12:16:29,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:29,963 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:29,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25939 states. [2022-11-20 12:16:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25939 to 25939. [2022-11-20 12:16:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25939 states, 25875 states have (on average 5.144695652173913) internal successors, (133119), 25938 states have internal predecessors, (133119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25939 states to 25939 states and 133119 transitions. [2022-11-20 12:16:31,623 INFO L78 Accepts]: Start accepts. Automaton has 25939 states and 133119 transitions. Word has length 2 [2022-11-20 12:16:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:31,623 INFO L495 AbstractCegarLoop]: Abstraction has 25939 states and 133119 transitions. [2022-11-20 12:16:31,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 25939 states and 133119 transitions. [2022-11-20 12:16:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 12:16:31,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:31,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 12:16:31,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-20 12:16:31,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:31,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:31,627 INFO L85 PathProgramCache]: Analyzing trace with hash 934514082, now seen corresponding path program 1 times [2022-11-20 12:16:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:31,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550751449] [2022-11-20 12:16:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:31,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550751449] [2022-11-20 12:16:31,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550751449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:31,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:31,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373163714] [2022-11-20 12:16:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:31,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:31,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:31,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:31,652 INFO L87 Difference]: Start difference. First operand 25939 states and 133119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:32,011 INFO L93 Difference]: Finished difference Result 38832 states and 196118 transitions. [2022-11-20 12:16:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:32,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 12:16:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:32,736 INFO L225 Difference]: With dead ends: 38832 [2022-11-20 12:16:32,736 INFO L226 Difference]: Without dead ends: 38832 [2022-11-20 12:16:32,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:32,737 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:32,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38832 states. [2022-11-20 12:16:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38832 to 32373. [2022-11-20 12:16:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32373 states, 32309 states have (on average 5.193320746541211) internal successors, (167791), 32372 states have internal predecessors, (167791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32373 states to 32373 states and 167791 transitions. [2022-11-20 12:16:34,440 INFO L78 Accepts]: Start accepts. Automaton has 32373 states and 167791 transitions. Word has length 5 [2022-11-20 12:16:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:34,440 INFO L495 AbstractCegarLoop]: Abstraction has 32373 states and 167791 transitions. [2022-11-20 12:16:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32373 states and 167791 transitions. [2022-11-20 12:16:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 12:16:34,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:34,441 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:34,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-20 12:16:34,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash 112066142, now seen corresponding path program 1 times [2022-11-20 12:16:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:34,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040095611] [2022-11-20 12:16:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:34,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:34,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040095611] [2022-11-20 12:16:34,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040095611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:34,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:34,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135926837] [2022-11-20 12:16:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:34,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:34,474 INFO L87 Difference]: Start difference. First operand 32373 states and 167791 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:34,894 INFO L93 Difference]: Finished difference Result 46764 states and 237712 transitions. [2022-11-20 12:16:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:34,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-11-20 12:16:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:35,858 INFO L225 Difference]: With dead ends: 46764 [2022-11-20 12:16:35,859 INFO L226 Difference]: Without dead ends: 46764 [2022-11-20 12:16:35,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:35,863 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:35,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 9 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46764 states. [2022-11-20 12:16:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46764 to 38727. [2022-11-20 12:16:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38727 states, 38663 states have (on average 5.225849002922691) internal successors, (202047), 38726 states have internal predecessors, (202047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38727 states to 38727 states and 202047 transitions. [2022-11-20 12:16:37,476 INFO L78 Accepts]: Start accepts. Automaton has 38727 states and 202047 transitions. Word has length 9 [2022-11-20 12:16:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:37,477 INFO L495 AbstractCegarLoop]: Abstraction has 38727 states and 202047 transitions. [2022-11-20 12:16:37,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 38727 states and 202047 transitions. [2022-11-20 12:16:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:37,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:37,478 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:37,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-20 12:16:37,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash -820913613, now seen corresponding path program 1 times [2022-11-20 12:16:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:37,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408083705] [2022-11-20 12:16:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:37,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408083705] [2022-11-20 12:16:37,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408083705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:37,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:37,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687071715] [2022-11-20 12:16:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:37,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:37,561 INFO L87 Difference]: Start difference. First operand 38727 states and 202047 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-11-20 12:16:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:37,894 INFO L93 Difference]: Finished difference Result 30690 states and 158345 transitions. [2022-11-20 12:16:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:37,895 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 10 [2022-11-20 12:16:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:38,772 INFO L225 Difference]: With dead ends: 30690 [2022-11-20 12:16:38,773 INFO L226 Difference]: Without dead ends: 30690 [2022-11-20 12:16:38,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:38,773 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:38,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30690 states. [2022-11-20 12:16:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30690 to 24273. [2022-11-20 12:16:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24273 states, 24241 states have (on average 5.105853718905986) internal successors, (123771), 24272 states have internal predecessors, (123771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 123771 transitions. [2022-11-20 12:16:39,838 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 123771 transitions. Word has length 10 [2022-11-20 12:16:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:39,838 INFO L495 AbstractCegarLoop]: Abstraction has 24273 states and 123771 transitions. [2022-11-20 12:16:39,839 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-11-20 12:16:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 123771 transitions. [2022-11-20 12:16:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 12:16:39,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:39,839 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:39,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-20 12:16:39,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:39,840 INFO L85 PathProgramCache]: Analyzing trace with hash -820920163, now seen corresponding path program 1 times [2022-11-20 12:16:39,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:39,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722372892] [2022-11-20 12:16:39,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:16:39,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:39,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722372892] [2022-11-20 12:16:39,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722372892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:39,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:39,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:39,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662631827] [2022-11-20 12:16:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:39,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:39,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:39,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:39,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:39,878 INFO L87 Difference]: Start difference. First operand 24273 states and 123771 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-11-20 12:16:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:40,669 INFO L93 Difference]: Finished difference Result 19434 states and 98113 transitions. [2022-11-20 12:16:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:40,669 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 10 [2022-11-20 12:16:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:40,759 INFO L225 Difference]: With dead ends: 19434 [2022-11-20 12:16:40,760 INFO L226 Difference]: Without dead ends: 19434 [2022-11-20 12:16:40,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:40,760 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:40,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19434 states. [2022-11-20 12:16:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19434 to 14595. [2022-11-20 12:16:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14595 states, 14579 states have (on average 4.969819603539338) internal successors, (72455), 14594 states have internal predecessors, (72455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14595 states to 14595 states and 72455 transitions. [2022-11-20 12:16:41,203 INFO L78 Accepts]: Start accepts. Automaton has 14595 states and 72455 transitions. Word has length 10 [2022-11-20 12:16:41,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:41,204 INFO L495 AbstractCegarLoop]: Abstraction has 14595 states and 72455 transitions. [2022-11-20 12:16:41,204 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-11-20 12:16:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 14595 states and 72455 transitions. [2022-11-20 12:16:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 12:16:41,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:41,205 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:41,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-20 12:16:41,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -282846283, now seen corresponding path program 1 times [2022-11-20 12:16:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:41,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987285382] [2022-11-20 12:16:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:41,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:16:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:41,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987285382] [2022-11-20 12:16:41,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987285382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:41,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:41,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:41,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994516005] [2022-11-20 12:16:41,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:41,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:41,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:41,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:41,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:41,229 INFO L87 Difference]: Start difference. First operand 14595 states and 72455 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-20 12:16:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:41,451 INFO L93 Difference]: Finished difference Result 21816 states and 106546 transitions. [2022-11-20 12:16:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:41,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 13 [2022-11-20 12:16:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:41,559 INFO L225 Difference]: With dead ends: 21816 [2022-11-20 12:16:41,559 INFO L226 Difference]: Without dead ends: 21816 [2022-11-20 12:16:41,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:41,560 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:41,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21816 states. [2022-11-20 12:16:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21816 to 18197. [2022-11-20 12:16:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18197 states, 18181 states have (on average 5.019690886089874) internal successors, (91263), 18196 states have internal predecessors, (91263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18197 states to 18197 states and 91263 transitions. [2022-11-20 12:16:42,475 INFO L78 Accepts]: Start accepts. Automaton has 18197 states and 91263 transitions. Word has length 13 [2022-11-20 12:16:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:42,475 INFO L495 AbstractCegarLoop]: Abstraction has 18197 states and 91263 transitions. [2022-11-20 12:16:42,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-20 12:16:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 18197 states and 91263 transitions. [2022-11-20 12:16:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:16:42,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:42,476 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:42,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-20 12:16:42,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -178296383, now seen corresponding path program 1 times [2022-11-20 12:16:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:42,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458628246] [2022-11-20 12:16:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 12:16:42,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:42,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458628246] [2022-11-20 12:16:42,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458628246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:42,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:42,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621088815] [2022-11-20 12:16:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:42,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:42,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:42,531 INFO L87 Difference]: Start difference. First operand 18197 states and 91263 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:42,754 INFO L93 Difference]: Finished difference Result 14578 states and 72361 transitions. [2022-11-20 12:16:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:16:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:42,851 INFO L225 Difference]: With dead ends: 14578 [2022-11-20 12:16:42,851 INFO L226 Difference]: Without dead ends: 14578 [2022-11-20 12:16:42,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:42,852 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 12 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-11-20 12:16:42,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 12 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14578 states. [2022-11-20 12:16:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14578 to 10959. [2022-11-20 12:16:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10959 states, 10951 states have (on average 4.881654643411561) internal successors, (53459), 10958 states have internal predecessors, (53459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10959 states to 10959 states and 53459 transitions. [2022-11-20 12:16:43,571 INFO L78 Accepts]: Start accepts. Automaton has 10959 states and 53459 transitions. Word has length 14 [2022-11-20 12:16:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:43,572 INFO L495 AbstractCegarLoop]: Abstraction has 10959 states and 53459 transitions. [2022-11-20 12:16:43,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 10959 states and 53459 transitions. [2022-11-20 12:16:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:16:43,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:43,573 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:43,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-20 12:16:43,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1394794220, now seen corresponding path program 1 times [2022-11-20 12:16:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:43,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852600911] [2022-11-20 12:16:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:16:43,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:43,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852600911] [2022-11-20 12:16:43,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852600911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:43,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:43,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109994724] [2022-11-20 12:16:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:43,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:43,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:43,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:43,603 INFO L87 Difference]: Start difference. First operand 10959 states and 53459 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:43,777 INFO L93 Difference]: Finished difference Result 16320 states and 78402 transitions. [2022-11-20 12:16:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 12:16:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:43,856 INFO L225 Difference]: With dead ends: 16320 [2022-11-20 12:16:43,856 INFO L226 Difference]: Without dead ends: 16320 [2022-11-20 12:16:43,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:43,856 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:43,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16320 states. [2022-11-20 12:16:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16320 to 13633. [2022-11-20 12:16:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13633 states, 13625 states have (on average 4.934678899082569) internal successors, (67235), 13632 states have internal predecessors, (67235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13633 states to 13633 states and 67235 transitions. [2022-11-20 12:16:44,266 INFO L78 Accepts]: Start accepts. Automaton has 13633 states and 67235 transitions. Word has length 17 [2022-11-20 12:16:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:44,266 INFO L495 AbstractCegarLoop]: Abstraction has 13633 states and 67235 transitions. [2022-11-20 12:16:44,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 13633 states and 67235 transitions. [2022-11-20 12:16:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:16:44,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:44,268 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:44,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-20 12:16:44,268 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash 288951958, now seen corresponding path program 1 times [2022-11-20 12:16:44,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:44,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109912703] [2022-11-20 12:16:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:16:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:44,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109912703] [2022-11-20 12:16:44,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109912703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:44,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:44,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132495487] [2022-11-20 12:16:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:44,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:44,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:44,316 INFO L87 Difference]: Start difference. First operand 13633 states and 67235 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:44,471 INFO L93 Difference]: Finished difference Result 10946 states and 53381 transitions. [2022-11-20 12:16:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 12:16:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:44,520 INFO L225 Difference]: With dead ends: 10946 [2022-11-20 12:16:44,520 INFO L226 Difference]: Without dead ends: 10946 [2022-11-20 12:16:44,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:44,520 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:44,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 12 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10946 states. [2022-11-20 12:16:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10946 to 8259. [2022-11-20 12:16:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8259 states, 8255 states have (on average 4.788249545729861) internal successors, (39527), 8258 states have internal predecessors, (39527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 39527 transitions. [2022-11-20 12:16:45,166 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 39527 transitions. Word has length 18 [2022-11-20 12:16:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:45,166 INFO L495 AbstractCegarLoop]: Abstraction has 8259 states and 39527 transitions. [2022-11-20 12:16:45,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 39527 transitions. [2022-11-20 12:16:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 12:16:45,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:45,168 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:45,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-20 12:16:45,168 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1315930018, now seen corresponding path program 1 times [2022-11-20 12:16:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335440091] [2022-11-20 12:16:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-20 12:16:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:45,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335440091] [2022-11-20 12:16:45,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335440091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:45,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:45,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:45,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073196159] [2022-11-20 12:16:45,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:45,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:45,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:45,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:45,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:45,206 INFO L87 Difference]: Start difference. First operand 8259 states and 39527 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:45,418 INFO L93 Difference]: Finished difference Result 12120 states and 57344 transitions. [2022-11-20 12:16:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:45,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 12:16:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:45,510 INFO L225 Difference]: With dead ends: 12120 [2022-11-20 12:16:45,510 INFO L226 Difference]: Without dead ends: 12120 [2022-11-20 12:16:45,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:45,511 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:45,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:45,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12120 states. [2022-11-20 12:16:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12120 to 10185. [2022-11-20 12:16:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10185 states, 10181 states have (on average 4.849621844612513) internal successors, (49374), 10184 states have internal predecessors, (49374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10185 states to 10185 states and 49374 transitions. [2022-11-20 12:16:46,064 INFO L78 Accepts]: Start accepts. Automaton has 10185 states and 49374 transitions. Word has length 21 [2022-11-20 12:16:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:46,064 INFO L495 AbstractCegarLoop]: Abstraction has 10185 states and 49374 transitions. [2022-11-20 12:16:46,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 10185 states and 49374 transitions. [2022-11-20 12:16:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:16:46,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:46,068 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:46,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-20 12:16:46,069 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2139129292, now seen corresponding path program 1 times [2022-11-20 12:16:46,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:46,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479309769] [2022-11-20 12:16:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-20 12:16:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:46,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479309769] [2022-11-20 12:16:46,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479309769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:46,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:46,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:46,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440142884] [2022-11-20 12:16:46,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:46,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:46,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:46,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:46,128 INFO L87 Difference]: Start difference. First operand 10185 states and 49374 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-11-20 12:16:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:46,313 INFO L93 Difference]: Finished difference Result 8250 states and 39469 transitions. [2022-11-20 12:16:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:46,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 22 [2022-11-20 12:16:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:46,372 INFO L225 Difference]: With dead ends: 8250 [2022-11-20 12:16:46,372 INFO L226 Difference]: Without dead ends: 8250 [2022-11-20 12:16:46,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:46,373 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:46,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8250 states. [2022-11-20 12:16:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8250 to 6315. [2022-11-20 12:16:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6315 states, 6313 states have (on average 4.683035007128148) internal successors, (29564), 6314 states have internal predecessors, (29564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6315 states to 6315 states and 29564 transitions. [2022-11-20 12:16:46,704 INFO L78 Accepts]: Start accepts. Automaton has 6315 states and 29564 transitions. Word has length 22 [2022-11-20 12:16:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:46,705 INFO L495 AbstractCegarLoop]: Abstraction has 6315 states and 29564 transitions. [2022-11-20 12:16:46,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-11-20 12:16:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6315 states and 29564 transitions. [2022-11-20 12:16:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 12:16:46,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:46,711 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:46,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-20 12:16:46,712 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:46,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1603832220, now seen corresponding path program 1 times [2022-11-20 12:16:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:46,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270649319] [2022-11-20 12:16:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 12:16:46,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:46,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270649319] [2022-11-20 12:16:46,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270649319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:46,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:46,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:16:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558751088] [2022-11-20 12:16:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:46,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:46,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:46,755 INFO L87 Difference]: Start difference. First operand 6315 states and 29564 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-11-20 12:16:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:47,061 INFO L93 Difference]: Finished difference Result 8730 states and 40726 transitions. [2022-11-20 12:16:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:47,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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 25 [2022-11-20 12:16:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:47,113 INFO L225 Difference]: With dead ends: 8730 [2022-11-20 12:16:47,113 INFO L226 Difference]: Without dead ends: 8730 [2022-11-20 12:16:47,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:47,114 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:47,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:16:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8730 states. [2022-11-20 12:16:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8730 to 7520. [2022-11-20 12:16:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7520 states, 7518 states have (on average 4.752992817238627) internal successors, (35733), 7519 states have internal predecessors, (35733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7520 states to 7520 states and 35733 transitions. [2022-11-20 12:16:47,329 INFO L78 Accepts]: Start accepts. Automaton has 7520 states and 35733 transitions. Word has length 25 [2022-11-20 12:16:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:47,330 INFO L495 AbstractCegarLoop]: Abstraction has 7520 states and 35733 transitions. [2022-11-20 12:16:47,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-11-20 12:16:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 7520 states and 35733 transitions. [2022-11-20 12:16:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 12:16:47,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:47,336 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:47,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-20 12:16:47,337 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:47,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1820813730, now seen corresponding path program 1 times [2022-11-20 12:16:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:47,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816486629] [2022-11-20 12:16:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 12:16:47,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:47,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816486629] [2022-11-20 12:16:47,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816486629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:47,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:47,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:16:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450078021] [2022-11-20 12:16:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:47,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:16:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:47,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:16:47,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:16:47,386 INFO L87 Difference]: Start difference. First operand 7520 states and 35733 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:16:47,502 INFO L93 Difference]: Finished difference Result 6310 states and 29530 transitions. [2022-11-20 12:16:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:16:47,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 12:16:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:16:47,533 INFO L225 Difference]: With dead ends: 6310 [2022-11-20 12:16:47,533 INFO L226 Difference]: Without dead ends: 6310 [2022-11-20 12:16:47,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:16:47,534 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:16:47,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 12 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:16:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2022-11-20 12:16:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 5100. [2022-11-20 12:16:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5100 states, 5099 states have (on average 4.574818591880761) internal successors, (23327), 5099 states have internal predecessors, (23327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5100 states to 5100 states and 23327 transitions. [2022-11-20 12:16:47,669 INFO L78 Accepts]: Start accepts. Automaton has 5100 states and 23327 transitions. Word has length 26 [2022-11-20 12:16:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:16:47,669 INFO L495 AbstractCegarLoop]: Abstraction has 5100 states and 23327 transitions. [2022-11-20 12:16:47,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5100 states and 23327 transitions. [2022-11-20 12:16:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 12:16:47,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:47,675 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:47,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-20 12:16:47,676 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-20 12:16:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 606247138, now seen corresponding path program 1 times [2022-11-20 12:16:47,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:47,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628494402] [2022-11-20 12:16:47,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:47,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:16:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:16:47,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:16:47,702 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:16:47,702 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2022-11-20 12:16:47,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (9 of 11 remaining) [2022-11-20 12:16:47,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (8 of 11 remaining) [2022-11-20 12:16:47,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2022-11-20 12:16:47,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2022-11-20 12:16:47,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 11 remaining) [2022-11-20 12:16:47,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 11 remaining) [2022-11-20 12:16:47,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 11 remaining) [2022-11-20 12:16:47,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 11 remaining) [2022-11-20 12:16:47,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 11 remaining) [2022-11-20 12:16:47,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2022-11-20 12:16:47,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-20 12:16:47,704 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:47,705 WARN L233 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 12:16:47,705 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2022-11-20 12:16:47,725 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:16:47,726 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 12:16:47,727 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 114 transitions, 305 flow [2022-11-20 12:16:47,727 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 114 transitions, 305 flow [2022-11-20 12:16:47,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 114 transitions, 305 flow [2022-11-20 12:16:47,757 INFO L130 PetriNetUnfolder]: 8/238 cut-off events. [2022-11-20 12:16:47,757 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-20 12:16:47,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 238 events. 8/238 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 632 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 235. Up to 16 conditions per place. [2022-11-20 12:16:47,767 INFO L119 LiptonReduction]: Number of co-enabled transitions 7280 [2022-11-20 12:16:49,884 INFO L134 LiptonReduction]: Checked pairs total: 12575 [2022-11-20 12:16:49,884 INFO L136 LiptonReduction]: Total number of compositions: 84 [2022-11-20 12:16:49,885 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 37 transitions, 151 flow [2022-11-20 12:16:57,150 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 191135 states, 189995 states have (on average 5.971499249980263) internal successors, (1134555), 191134 states have internal predecessors, (1134555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:57,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:16:57,151 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=FINITE_AUTOMATA, 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;@6c4833d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:16:57,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-20 12:16:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 191135 states, 189995 states have (on average 5.971499249980263) internal successors, (1134555), 191134 states have internal predecessors, (1134555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 12:16:57,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:16:57,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 12:16:57,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2022-11-20 12:16:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 38027, now seen corresponding path program 1 times [2022-11-20 12:16:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:57,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626812515] [2022-11-20 12:16:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:57,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:57,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626812515] [2022-11-20 12:16:57,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626812515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:57,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:57,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 12:16:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133566562] [2022-11-20 12:16:57,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:57,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:16:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:57,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:16:57,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:16:57,833 INFO L87 Difference]: Start difference. First operand has 191135 states, 189995 states have (on average 5.971499249980263) internal successors, (1134555), 191134 states have internal predecessors, (1134555), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:01,251 INFO L93 Difference]: Finished difference Result 125608 states and 741375 transitions. [2022-11-20 12:17:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:01,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-20 12:17:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:02,379 INFO L225 Difference]: With dead ends: 125608 [2022-11-20 12:17:02,379 INFO L226 Difference]: Without dead ends: 125608 [2022-11-20 12:17:02,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:02,380 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:02,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:17:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125608 states.