./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc --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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- 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-5e519f3 [2022-11-02 20:57:37,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:37,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:37,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:37,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:37,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:37,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:37,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:37,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:37,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:37,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:37,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:37,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:37,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:37,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:37,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:37,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:37,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:37,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:37,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:37,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:37,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:37,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:37,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:37,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:37,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:37,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:37,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:37,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:37,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:37,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:37,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:37,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:37,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:37,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:37,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:37,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:37,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:37,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:37,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:37,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:37,712 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:57:37,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:37,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:37,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:37,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:37,743 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:37,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:37,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:37,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:37,745 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:37,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:37,746 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:37,746 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:57:37,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:57:37,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:37,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:37,748 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:57:37,748 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:57:37,748 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:57:37,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:37,749 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:57:37,749 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:37,749 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:37,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:37,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:37,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:37,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:37,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:37,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:37,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:57:37,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:57:37,752 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_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/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_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-11-02 20:57:38,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:38,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:38,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:38,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:38,158 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:38,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/locks/test_locks_13.c [2022-11-02 20:57:38,279 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/data/fb5805559/b7fbc25025524937827825e22f2a6378/FLAG86415b811 [2022-11-02 20:57:38,987 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:38,988 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/sv-benchmarks/c/locks/test_locks_13.c [2022-11-02 20:57:38,998 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/data/fb5805559/b7fbc25025524937827825e22f2a6378/FLAG86415b811 [2022-11-02 20:57:39,329 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/data/fb5805559/b7fbc25025524937827825e22f2a6378 [2022-11-02 20:57:39,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:39,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:39,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:39,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:39,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:39,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b01e46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39, skipping insertion in model container [2022-11-02 20:57:39,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:39,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:39,676 WARN L230 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_a2be55ff-4960-49a2-8621-c4f9c163a981/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-11-02 20:57:39,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:39,711 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:39,776 WARN L230 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_a2be55ff-4960-49a2-8621-c4f9c163a981/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-11-02 20:57:39,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:39,798 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:39,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39 WrapperNode [2022-11-02 20:57:39,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:39,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:39,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:39,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:39,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,878 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 171 [2022-11-02 20:57:39,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:39,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:39,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:39,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:39,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,946 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:39,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:39,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:39,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:39,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (1/1) ... [2022-11-02 20:57:39,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:40,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:57:40,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:57:40,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:40,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:40,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:40,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:57:40,155 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:40,158 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:40,540 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:40,550 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:40,565 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:57:40,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:40 BoogieIcfgContainer [2022-11-02 20:57:40,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:40,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:40,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:40,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:40,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:39" (1/3) ... [2022-11-02 20:57:40,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26437bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:40, skipping insertion in model container [2022-11-02 20:57:40,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:39" (2/3) ... [2022-11-02 20:57:40,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26437bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:40, skipping insertion in model container [2022-11-02 20:57:40,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:40" (3/3) ... [2022-11-02 20:57:40,588 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-11-02 20:57:40,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:40,636 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:57:40,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:40,744 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;@5745b558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:40,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:57:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:57:40,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:40,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:57:40,776 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash 28705099, now seen corresponding path program 1 times [2022-11-02 20:57:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516520173] [2022-11-02 20:57:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,061 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-02 20:57:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:41,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516520173] [2022-11-02 20:57:41,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516520173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:41,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:41,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:41,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661277987] [2022-11-02 20:57:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:41,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:57:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:57:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:57:41,125 INFO L87 Difference]: Start difference. First operand has 50 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 49 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:41,147 INFO L93 Difference]: Finished difference Result 50 states and 88 transitions. [2022-11-02 20:57:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:57:41,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:57:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:41,161 INFO L225 Difference]: With dead ends: 50 [2022-11-02 20:57:41,162 INFO L226 Difference]: Without dead ends: 48 [2022-11-02 20:57:41,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:57:41,176 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:41,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-02 20:57:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-02 20:57:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 86 transitions. [2022-11-02 20:57:41,238 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 86 transitions. Word has length 5 [2022-11-02 20:57:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:41,238 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 86 transitions. [2022-11-02 20:57:41,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 86 transitions. [2022-11-02 20:57:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:57:41,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:41,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:57:41,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:57:41,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 889699595, now seen corresponding path program 1 times [2022-11-02 20:57:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:41,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938272453] [2022-11-02 20:57:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,420 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-02 20:57:41,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:41,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938272453] [2022-11-02 20:57:41,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938272453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:41,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:41,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:41,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831693039] [2022-11-02 20:57:41,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:41,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:41,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:41,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:41,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:41,426 INFO L87 Difference]: Start difference. First operand 48 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:41,441 INFO L93 Difference]: Finished difference Result 47 states and 85 transitions. [2022-11-02 20:57:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:57:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:41,443 INFO L225 Difference]: With dead ends: 47 [2022-11-02 20:57:41,444 INFO L226 Difference]: Without dead ends: 45 [2022-11-02 20:57:41,444 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-02 20:57:41,446 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:41,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:41,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-02 20:57:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-02 20:57:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 83 transitions. [2022-11-02 20:57:41,472 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 83 transitions. Word has length 6 [2022-11-02 20:57:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:41,475 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 83 transitions. [2022-11-02 20:57:41,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2022-11-02 20:57:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:57:41,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:41,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:41,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:57:41,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1359894467, now seen corresponding path program 1 times [2022-11-02 20:57:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:41,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726930858] [2022-11-02 20:57:41,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:41,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,623 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-02 20:57:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726930858] [2022-11-02 20:57:41,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726930858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:41,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:41,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062025627] [2022-11-02 20:57:41,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:41,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:41,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:41,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:41,628 INFO L87 Difference]: Start difference. First operand 45 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:41,673 INFO L93 Difference]: Finished difference Result 87 states and 161 transitions. [2022-11-02 20:57:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:41,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:57:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:41,676 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:57:41,678 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:57:41,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:41,682 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 163 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-02 20:57:41,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:57:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2022-11-02 20:57:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2022-11-02 20:57:41,709 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2022-11-02 20:57:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:41,712 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2022-11-02 20:57:41,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2022-11-02 20:57:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:57:41,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:41,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:41,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:57:41,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1914004475, now seen corresponding path program 1 times [2022-11-02 20:57:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:41,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759631847] [2022-11-02 20:57:41,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:41,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,870 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-02 20:57:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:41,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759631847] [2022-11-02 20:57:41,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759631847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:41,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:41,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:41,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555712404] [2022-11-02 20:57:41,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:41,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:41,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:41,875 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:41,903 INFO L93 Difference]: Finished difference Result 87 states and 159 transitions. [2022-11-02 20:57:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:41,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:57:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:41,905 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:57:41,905 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:57:41,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:41,907 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:41,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:57:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-11-02 20:57:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2022-11-02 20:57:41,919 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2022-11-02 20:57:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:41,920 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2022-11-02 20:57:41,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2022-11-02 20:57:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:57:41,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:41,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:41,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:57:41,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 793156859, now seen corresponding path program 1 times [2022-11-02 20:57:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:41,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855836820] [2022-11-02 20:57:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,994 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-02 20:57:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855836820] [2022-11-02 20:57:41,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855836820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:41,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:41,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:41,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265541562] [2022-11-02 20:57:41,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:41,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:41,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:41,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:41,999 INFO L87 Difference]: Start difference. First operand 85 states and 158 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:42,025 INFO L93 Difference]: Finished difference Result 90 states and 161 transitions. [2022-11-02 20:57:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:42,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:57:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:42,027 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:57:42,027 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:57:42,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,029 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:42,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:57:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-11-02 20:57:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2022-11-02 20:57:42,042 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2022-11-02 20:57:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:42,043 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2022-11-02 20:57:42,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2022-11-02 20:57:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:57:42,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:42,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:42,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:57:42,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:42,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash -795191043, now seen corresponding path program 1 times [2022-11-02 20:57:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:42,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257760417] [2022-11-02 20:57:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,121 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-02 20:57:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257760417] [2022-11-02 20:57:42,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257760417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:42,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:42,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703267815] [2022-11-02 20:57:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:42,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,125 INFO L87 Difference]: Start difference. First operand 88 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:42,151 INFO L93 Difference]: Finished difference Result 167 states and 306 transitions. [2022-11-02 20:57:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:42,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:57:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:42,154 INFO L225 Difference]: With dead ends: 167 [2022-11-02 20:57:42,154 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 20:57:42,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,156 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 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-02 20:57:42,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 20:57:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2022-11-02 20:57:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2022-11-02 20:57:42,170 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2022-11-02 20:57:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:42,171 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2022-11-02 20:57:42,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2022-11-02 20:57:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:57:42,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:42,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:42,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:57:42,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1816259397, now seen corresponding path program 1 times [2022-11-02 20:57:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:42,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639832763] [2022-11-02 20:57:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:42,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,250 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-02 20:57:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:42,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639832763] [2022-11-02 20:57:42,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639832763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:42,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:42,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:42,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020789053] [2022-11-02 20:57:42,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:42,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:42,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:42,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:42,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,254 INFO L87 Difference]: Start difference. First operand 117 states and 213 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:42,320 INFO L93 Difference]: Finished difference Result 169 states and 304 transitions. [2022-11-02 20:57:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:42,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:57:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:42,323 INFO L225 Difference]: With dead ends: 169 [2022-11-02 20:57:42,323 INFO L226 Difference]: Without dead ends: 169 [2022-11-02 20:57:42,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,325 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:42,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-02 20:57:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2022-11-02 20:57:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2022-11-02 20:57:42,350 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2022-11-02 20:57:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:42,351 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2022-11-02 20:57:42,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2022-11-02 20:57:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:57:42,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:42,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:42,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:57:42,354 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1119094160, now seen corresponding path program 1 times [2022-11-02 20:57:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:42,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121971951] [2022-11-02 20:57:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,448 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-02 20:57:42,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:42,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121971951] [2022-11-02 20:57:42,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121971951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:42,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:42,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237082660] [2022-11-02 20:57:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:42,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,455 INFO L87 Difference]: Start difference. First operand 167 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:42,490 INFO L93 Difference]: Finished difference Result 171 states and 304 transitions. [2022-11-02 20:57:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:42,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:57:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:42,493 INFO L225 Difference]: With dead ends: 171 [2022-11-02 20:57:42,493 INFO L226 Difference]: Without dead ends: 171 [2022-11-02 20:57:42,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,495 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:42,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-02 20:57:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-11-02 20:57:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2022-11-02 20:57:42,521 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2022-11-02 20:57:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:42,525 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2022-11-02 20:57:42,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2022-11-02 20:57:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:57:42,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:42,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:42,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:57:42,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -469253742, now seen corresponding path program 1 times [2022-11-02 20:57:42,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:42,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825551108] [2022-11-02 20:57:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,612 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-02 20:57:42,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:42,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825551108] [2022-11-02 20:57:42,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825551108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:42,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:42,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:42,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297800744] [2022-11-02 20:57:42,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:42,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:42,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,616 INFO L87 Difference]: Start difference. First operand 169 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:42,635 INFO L93 Difference]: Finished difference Result 327 states and 580 transitions. [2022-11-02 20:57:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:57:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:42,638 INFO L225 Difference]: With dead ends: 327 [2022-11-02 20:57:42,638 INFO L226 Difference]: Without dead ends: 327 [2022-11-02 20:57:42,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,640 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:42,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-02 20:57:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2022-11-02 20:57:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 579 transitions. [2022-11-02 20:57:42,667 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 579 transitions. Word has length 22 [2022-11-02 20:57:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:42,667 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 579 transitions. [2022-11-02 20:57:42,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 579 transitions. [2022-11-02 20:57:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:57:42,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:42,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:42,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:57:42,674 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash 551814612, now seen corresponding path program 1 times [2022-11-02 20:57:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756898844] [2022-11-02 20:57:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,758 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-02 20:57:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:42,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756898844] [2022-11-02 20:57:42,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756898844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:42,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:42,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134982055] [2022-11-02 20:57:42,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:42,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,771 INFO L87 Difference]: Start difference. First operand 325 states and 579 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:42,796 INFO L93 Difference]: Finished difference Result 415 states and 744 transitions. [2022-11-02 20:57:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:42,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:57:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:42,799 INFO L225 Difference]: With dead ends: 415 [2022-11-02 20:57:42,801 INFO L226 Difference]: Without dead ends: 415 [2022-11-02 20:57:42,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,803 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 224 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-02 20:57:42,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-02 20:57:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2022-11-02 20:57:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2022-11-02 20:57:42,849 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2022-11-02 20:57:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:42,850 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2022-11-02 20:57:42,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2022-11-02 20:57:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:57:42,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:42,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:42,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:57:42,853 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1661751056, now seen corresponding path program 1 times [2022-11-02 20:57:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:42,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63292737] [2022-11-02 20:57:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:42,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,915 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-02 20:57:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:42,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63292737] [2022-11-02 20:57:42,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63292737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:42,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:42,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014703873] [2022-11-02 20:57:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:42,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:42,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:42,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:42,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,925 INFO L87 Difference]: Start difference. First operand 325 states and 575 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:42,945 INFO L93 Difference]: Finished difference Result 611 states and 1088 transitions. [2022-11-02 20:57:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:42,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-02 20:57:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:42,951 INFO L225 Difference]: With dead ends: 611 [2022-11-02 20:57:42,951 INFO L226 Difference]: Without dead ends: 611 [2022-11-02 20:57:42,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:42,954 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 157 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-02 20:57:42,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-02 20:57:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2022-11-02 20:57:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 783 transitions. [2022-11-02 20:57:42,974 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 783 transitions. Word has length 23 [2022-11-02 20:57:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:42,977 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 783 transitions. [2022-11-02 20:57:42,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 783 transitions. [2022-11-02 20:57:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:57:42,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:42,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:42,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:57:42,996 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:42,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1612147886, now seen corresponding path program 1 times [2022-11-02 20:57:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:42,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786137434] [2022-11-02 20:57:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,056 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-02 20:57:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786137434] [2022-11-02 20:57:43,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786137434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:43,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:43,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499212686] [2022-11-02 20:57:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:43,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,061 INFO L87 Difference]: Start difference. First operand 449 states and 783 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:43,085 INFO L93 Difference]: Finished difference Result 635 states and 1100 transitions. [2022-11-02 20:57:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:43,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-02 20:57:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:43,089 INFO L225 Difference]: With dead ends: 635 [2022-11-02 20:57:43,089 INFO L226 Difference]: Without dead ends: 635 [2022-11-02 20:57:43,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,092 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:43,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-11-02 20:57:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2022-11-02 20:57:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1099 transitions. [2022-11-02 20:57:43,146 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1099 transitions. Word has length 23 [2022-11-02 20:57:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:43,147 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 1099 transitions. [2022-11-02 20:57:43,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1099 transitions. [2022-11-02 20:57:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:57:43,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:43,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:43,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:57:43,149 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 25538215, now seen corresponding path program 1 times [2022-11-02 20:57:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:43,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757142391] [2022-11-02 20:57:43,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,193 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-02 20:57:43,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757142391] [2022-11-02 20:57:43,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757142391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:43,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:43,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:43,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301965382] [2022-11-02 20:57:43,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:43,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:43,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:43,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,197 INFO L87 Difference]: Start difference. First operand 633 states and 1099 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:43,216 INFO L93 Difference]: Finished difference Result 647 states and 1108 transitions. [2022-11-02 20:57:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:43,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:57:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:43,220 INFO L225 Difference]: With dead ends: 647 [2022-11-02 20:57:43,221 INFO L226 Difference]: Without dead ends: 647 [2022-11-02 20:57:43,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,222 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:43,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-02 20:57:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2022-11-02 20:57:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1107 transitions. [2022-11-02 20:57:43,247 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1107 transitions. Word has length 24 [2022-11-02 20:57:43,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:43,248 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1107 transitions. [2022-11-02 20:57:43,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1107 transitions. [2022-11-02 20:57:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:57:43,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:43,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:43,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:57:43,251 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1562809687, now seen corresponding path program 1 times [2022-11-02 20:57:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:43,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130085466] [2022-11-02 20:57:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,295 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-02 20:57:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130085466] [2022-11-02 20:57:43,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130085466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:43,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:43,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:43,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474160152] [2022-11-02 20:57:43,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:43,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,299 INFO L87 Difference]: Start difference. First operand 645 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:43,320 INFO L93 Difference]: Finished difference Result 1191 states and 2060 transitions. [2022-11-02 20:57:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:43,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:57:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:43,326 INFO L225 Difference]: With dead ends: 1191 [2022-11-02 20:57:43,327 INFO L226 Difference]: Without dead ends: 1191 [2022-11-02 20:57:43,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,328 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 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-02 20:57:43,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:43,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-11-02 20:57:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 901. [2022-11-02 20:57:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1515 transitions. [2022-11-02 20:57:43,358 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1515 transitions. Word has length 24 [2022-11-02 20:57:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:43,358 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1515 transitions. [2022-11-02 20:57:43,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1515 transitions. [2022-11-02 20:57:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:57:43,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:43,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:43,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:57:43,361 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1711089255, now seen corresponding path program 1 times [2022-11-02 20:57:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:43,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959753718] [2022-11-02 20:57:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,396 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-02 20:57:43,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959753718] [2022-11-02 20:57:43,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959753718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:43,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:43,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410024705] [2022-11-02 20:57:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:43,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,399 INFO L87 Difference]: Start difference. First operand 901 states and 1515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:43,422 INFO L93 Difference]: Finished difference Result 1255 states and 2100 transitions. [2022-11-02 20:57:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:43,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:57:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:43,428 INFO L225 Difference]: With dead ends: 1255 [2022-11-02 20:57:43,428 INFO L226 Difference]: Without dead ends: 1255 [2022-11-02 20:57:43,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,430 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:43,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2022-11-02 20:57:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2022-11-02 20:57:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2099 transitions. [2022-11-02 20:57:43,465 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2099 transitions. Word has length 24 [2022-11-02 20:57:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:43,466 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 2099 transitions. [2022-11-02 20:57:43,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2099 transitions. [2022-11-02 20:57:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:57:43,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:43,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:43,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:57:43,469 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1202246301, now seen corresponding path program 1 times [2022-11-02 20:57:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:43,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890671340] [2022-11-02 20:57:43,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,524 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-02 20:57:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890671340] [2022-11-02 20:57:43,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890671340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:43,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:43,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123604410] [2022-11-02 20:57:43,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:43,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:43,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,529 INFO L87 Difference]: Start difference. First operand 1253 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:43,560 INFO L93 Difference]: Finished difference Result 1271 states and 2100 transitions. [2022-11-02 20:57:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:57:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:43,567 INFO L225 Difference]: With dead ends: 1271 [2022-11-02 20:57:43,567 INFO L226 Difference]: Without dead ends: 1271 [2022-11-02 20:57:43,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,569 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:43,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-11-02 20:57:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2022-11-02 20:57:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2099 transitions. [2022-11-02 20:57:43,609 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2099 transitions. Word has length 25 [2022-11-02 20:57:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:43,609 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 2099 transitions. [2022-11-02 20:57:43,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2099 transitions. [2022-11-02 20:57:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:57:43,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:43,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:43,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:57:43,613 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1504373093, now seen corresponding path program 1 times [2022-11-02 20:57:43,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:43,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907034071] [2022-11-02 20:57:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,683 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-02 20:57:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907034071] [2022-11-02 20:57:43,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907034071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:43,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:43,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685971864] [2022-11-02 20:57:43,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:43,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:43,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,686 INFO L87 Difference]: Start difference. First operand 1269 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:43,729 INFO L93 Difference]: Finished difference Result 2311 states and 3860 transitions. [2022-11-02 20:57:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:43,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:57:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:43,739 INFO L225 Difference]: With dead ends: 2311 [2022-11-02 20:57:43,739 INFO L226 Difference]: Without dead ends: 2311 [2022-11-02 20:57:43,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,741 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 153 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-02 20:57:43,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-11-02 20:57:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1797. [2022-11-02 20:57:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2899 transitions. [2022-11-02 20:57:43,807 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2899 transitions. Word has length 25 [2022-11-02 20:57:43,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:43,807 INFO L495 AbstractCegarLoop]: Abstraction has 1797 states and 2899 transitions. [2022-11-02 20:57:43,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2899 transitions. [2022-11-02 20:57:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:57:43,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:43,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:43,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:57:43,812 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash 483304739, now seen corresponding path program 1 times [2022-11-02 20:57:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:43,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859733273] [2022-11-02 20:57:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,854 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-02 20:57:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859733273] [2022-11-02 20:57:43,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859733273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:43,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:43,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349598133] [2022-11-02 20:57:43,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:43,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:43,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,857 INFO L87 Difference]: Start difference. First operand 1797 states and 2899 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:43,889 INFO L93 Difference]: Finished difference Result 2471 states and 3972 transitions. [2022-11-02 20:57:43,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:43,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:57:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:43,899 INFO L225 Difference]: With dead ends: 2471 [2022-11-02 20:57:43,899 INFO L226 Difference]: Without dead ends: 2471 [2022-11-02 20:57:43,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:43,901 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:43,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-11-02 20:57:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2469. [2022-11-02 20:57:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3971 transitions. [2022-11-02 20:57:44,003 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3971 transitions. Word has length 25 [2022-11-02 20:57:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:44,003 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 3971 transitions. [2022-11-02 20:57:44,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3971 transitions. [2022-11-02 20:57:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:57:44,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:44,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:44,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:57:44,007 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash -608860292, now seen corresponding path program 1 times [2022-11-02 20:57:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:44,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082826978] [2022-11-02 20:57:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:44,036 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-02 20:57:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:44,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082826978] [2022-11-02 20:57:44,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082826978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:44,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:44,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615398776] [2022-11-02 20:57:44,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:44,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,038 INFO L87 Difference]: Start difference. First operand 2469 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:44,064 INFO L93 Difference]: Finished difference Result 2503 states and 3972 transitions. [2022-11-02 20:57:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-02 20:57:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:44,074 INFO L225 Difference]: With dead ends: 2503 [2022-11-02 20:57:44,074 INFO L226 Difference]: Without dead ends: 2503 [2022-11-02 20:57:44,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,075 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:44,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2022-11-02 20:57:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2022-11-02 20:57:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3971 transitions. [2022-11-02 20:57:44,147 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3971 transitions. Word has length 26 [2022-11-02 20:57:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:44,147 INFO L495 AbstractCegarLoop]: Abstraction has 2501 states and 3971 transitions. [2022-11-02 20:57:44,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3971 transitions. [2022-11-02 20:57:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:57:44,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:44,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:44,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:57:44,152 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:44,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2097759102, now seen corresponding path program 1 times [2022-11-02 20:57:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:44,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156616883] [2022-11-02 20:57:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:44,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:44,199 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-02 20:57:44,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156616883] [2022-11-02 20:57:44,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156616883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:44,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:44,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209735856] [2022-11-02 20:57:44,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:44,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:44,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:44,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,202 INFO L87 Difference]: Start difference. First operand 2501 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:44,241 INFO L93 Difference]: Finished difference Result 4487 states and 7204 transitions. [2022-11-02 20:57:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:44,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-02 20:57:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:44,259 INFO L225 Difference]: With dead ends: 4487 [2022-11-02 20:57:44,259 INFO L226 Difference]: Without dead ends: 4487 [2022-11-02 20:57:44,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,260 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 151 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-02 20:57:44,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-11-02 20:57:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 3589. [2022-11-02 20:57:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5539 transitions. [2022-11-02 20:57:44,374 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5539 transitions. Word has length 26 [2022-11-02 20:57:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:44,375 INFO L495 AbstractCegarLoop]: Abstraction has 3589 states and 5539 transitions. [2022-11-02 20:57:44,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5539 transitions. [2022-11-02 20:57:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:57:44,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:44,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:44,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:57:44,380 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:44,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1076690748, now seen corresponding path program 1 times [2022-11-02 20:57:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:44,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754952624] [2022-11-02 20:57:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:44,412 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-02 20:57:44,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:44,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754952624] [2022-11-02 20:57:44,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754952624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:44,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:44,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073895817] [2022-11-02 20:57:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:44,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:44,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:44,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,418 INFO L87 Difference]: Start difference. First operand 3589 states and 5539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:44,456 INFO L93 Difference]: Finished difference Result 4871 states and 7492 transitions. [2022-11-02 20:57:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:44,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-02 20:57:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:44,492 INFO L225 Difference]: With dead ends: 4871 [2022-11-02 20:57:44,500 INFO L226 Difference]: Without dead ends: 4871 [2022-11-02 20:57:44,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,501 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:44,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2022-11-02 20:57:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4869. [2022-11-02 20:57:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7491 transitions. [2022-11-02 20:57:44,684 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7491 transitions. Word has length 26 [2022-11-02 20:57:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:44,684 INFO L495 AbstractCegarLoop]: Abstraction has 4869 states and 7491 transitions. [2022-11-02 20:57:44,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7491 transitions. [2022-11-02 20:57:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:57:44,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:44,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:44,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:57:44,692 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash 606237144, now seen corresponding path program 1 times [2022-11-02 20:57:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:44,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964033633] [2022-11-02 20:57:44,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:44,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:44,730 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-02 20:57:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964033633] [2022-11-02 20:57:44,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964033633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:44,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:44,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690559903] [2022-11-02 20:57:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:44,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:44,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,734 INFO L87 Difference]: Start difference. First operand 4869 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:44,776 INFO L93 Difference]: Finished difference Result 4935 states and 7492 transitions. [2022-11-02 20:57:44,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:44,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-02 20:57:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:44,789 INFO L225 Difference]: With dead ends: 4935 [2022-11-02 20:57:44,790 INFO L226 Difference]: Without dead ends: 4935 [2022-11-02 20:57:44,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,792 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:44,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2022-11-02 20:57:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4933. [2022-11-02 20:57:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7491 transitions. [2022-11-02 20:57:44,927 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7491 transitions. Word has length 27 [2022-11-02 20:57:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:44,927 INFO L495 AbstractCegarLoop]: Abstraction has 4933 states and 7491 transitions. [2022-11-02 20:57:44,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7491 transitions. [2022-11-02 20:57:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:57:44,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:44,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:44,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:57:44,935 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -982110758, now seen corresponding path program 1 times [2022-11-02 20:57:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:44,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296589657] [2022-11-02 20:57:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:44,967 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-02 20:57:44,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:44,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296589657] [2022-11-02 20:57:44,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296589657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:44,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:44,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953491960] [2022-11-02 20:57:44,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:44,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:44,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:44,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:44,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:44,971 INFO L87 Difference]: Start difference. First operand 4933 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:45,030 INFO L93 Difference]: Finished difference Result 8711 states and 13380 transitions. [2022-11-02 20:57:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:45,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-02 20:57:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:45,110 INFO L225 Difference]: With dead ends: 8711 [2022-11-02 20:57:45,111 INFO L226 Difference]: Without dead ends: 8711 [2022-11-02 20:57:45,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:45,112 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 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-02 20:57:45,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2022-11-02 20:57:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 7173. [2022-11-02 20:57:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 10563 transitions. [2022-11-02 20:57:45,270 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 10563 transitions. Word has length 27 [2022-11-02 20:57:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:45,271 INFO L495 AbstractCegarLoop]: Abstraction has 7173 states and 10563 transitions. [2022-11-02 20:57:45,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 10563 transitions. [2022-11-02 20:57:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:57:45,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:45,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:45,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:57:45,282 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2003179112, now seen corresponding path program 1 times [2022-11-02 20:57:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:45,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775155533] [2022-11-02 20:57:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:45,367 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-02 20:57:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:45,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775155533] [2022-11-02 20:57:45,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775155533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:45,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:45,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:45,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152217456] [2022-11-02 20:57:45,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:45,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:45,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:45,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:45,374 INFO L87 Difference]: Start difference. First operand 7173 states and 10563 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:45,431 INFO L93 Difference]: Finished difference Result 9607 states and 14084 transitions. [2022-11-02 20:57:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-02 20:57:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:45,452 INFO L225 Difference]: With dead ends: 9607 [2022-11-02 20:57:45,452 INFO L226 Difference]: Without dead ends: 9607 [2022-11-02 20:57:45,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:45,453 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:45,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2022-11-02 20:57:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2022-11-02 20:57:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14083 transitions. [2022-11-02 20:57:45,691 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14083 transitions. Word has length 27 [2022-11-02 20:57:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:45,691 INFO L495 AbstractCegarLoop]: Abstraction has 9605 states and 14083 transitions. [2022-11-02 20:57:45,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14083 transitions. [2022-11-02 20:57:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:57:45,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:45,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:45,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:57:45,746 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:45,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash -380447663, now seen corresponding path program 1 times [2022-11-02 20:57:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:45,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475440416] [2022-11-02 20:57:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:45,794 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-02 20:57:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:45,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475440416] [2022-11-02 20:57:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475440416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:45,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915913490] [2022-11-02 20:57:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:45,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:45,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:45,797 INFO L87 Difference]: Start difference. First operand 9605 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:45,865 INFO L93 Difference]: Finished difference Result 9735 states and 14084 transitions. [2022-11-02 20:57:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:45,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-02 20:57:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:45,894 INFO L225 Difference]: With dead ends: 9735 [2022-11-02 20:57:45,894 INFO L226 Difference]: Without dead ends: 9735 [2022-11-02 20:57:45,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:45,896 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:45,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2022-11-02 20:57:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2022-11-02 20:57:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2022-11-02 20:57:46,257 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2022-11-02 20:57:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:46,257 INFO L495 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2022-11-02 20:57:46,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2022-11-02 20:57:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:57:46,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:46,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:46,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:57:46,269 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:46,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1968795565, now seen corresponding path program 1 times [2022-11-02 20:57:46,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:46,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297431651] [2022-11-02 20:57:46,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:46,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:46,317 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-02 20:57:46,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:46,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297431651] [2022-11-02 20:57:46,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297431651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:46,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:46,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:46,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950959253] [2022-11-02 20:57:46,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:46,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:46,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:46,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:46,325 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:46,394 INFO L93 Difference]: Finished difference Result 16903 states and 24708 transitions. [2022-11-02 20:57:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-02 20:57:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:46,433 INFO L225 Difference]: With dead ends: 16903 [2022-11-02 20:57:46,433 INFO L226 Difference]: Without dead ends: 16903 [2022-11-02 20:57:46,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:46,434 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 147 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-02 20:57:46,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2022-11-02 20:57:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 14341. [2022-11-02 20:57:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 20099 transitions. [2022-11-02 20:57:46,818 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 20099 transitions. Word has length 28 [2022-11-02 20:57:46,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:46,818 INFO L495 AbstractCegarLoop]: Abstraction has 14341 states and 20099 transitions. [2022-11-02 20:57:46,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 20099 transitions. [2022-11-02 20:57:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:57:46,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:46,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:46,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:57:46,840 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:46,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1305103377, now seen corresponding path program 1 times [2022-11-02 20:57:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:46,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789499684] [2022-11-02 20:57:46,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:46,891 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-02 20:57:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:46,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789499684] [2022-11-02 20:57:46,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789499684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:46,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:46,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633386061] [2022-11-02 20:57:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:46,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:46,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:46,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:46,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:46,895 INFO L87 Difference]: Start difference. First operand 14341 states and 20099 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:47,081 INFO L93 Difference]: Finished difference Result 18951 states and 26372 transitions. [2022-11-02 20:57:47,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:47,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-02 20:57:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:47,122 INFO L225 Difference]: With dead ends: 18951 [2022-11-02 20:57:47,122 INFO L226 Difference]: Without dead ends: 18951 [2022-11-02 20:57:47,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:47,123 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:47,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2022-11-02 20:57:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18949. [2022-11-02 20:57:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18949 states, 18948 states have (on average 1.3917563858982478) internal successors, (26371), 18948 states have internal predecessors, (26371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 26371 transitions. [2022-11-02 20:57:47,583 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 26371 transitions. Word has length 28 [2022-11-02 20:57:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:47,583 INFO L495 AbstractCegarLoop]: Abstraction has 18949 states and 26371 transitions. [2022-11-02 20:57:47,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 26371 transitions. [2022-11-02 20:57:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:57:47,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:47,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:47,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:57:47,611 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash -902905267, now seen corresponding path program 1 times [2022-11-02 20:57:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:47,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381110599] [2022-11-02 20:57:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:47,646 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-02 20:57:47,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:47,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381110599] [2022-11-02 20:57:47,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381110599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:47,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:47,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766963785] [2022-11-02 20:57:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:47,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:47,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:47,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:47,650 INFO L87 Difference]: Start difference. First operand 18949 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:47,869 INFO L93 Difference]: Finished difference Result 19207 states and 26372 transitions. [2022-11-02 20:57:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:47,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:57:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:47,926 INFO L225 Difference]: With dead ends: 19207 [2022-11-02 20:57:47,926 INFO L226 Difference]: Without dead ends: 19207 [2022-11-02 20:57:47,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:47,927 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:47,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2022-11-02 20:57:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 19205. [2022-11-02 20:57:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 19204 states have (on average 1.3732034992709852) internal successors, (26371), 19204 states have internal predecessors, (26371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 26371 transitions. [2022-11-02 20:57:48,351 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 26371 transitions. Word has length 29 [2022-11-02 20:57:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:48,352 INFO L495 AbstractCegarLoop]: Abstraction has 19205 states and 26371 transitions. [2022-11-02 20:57:48,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 26371 transitions. [2022-11-02 20:57:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:57:48,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:48,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:48,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:57:48,374 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1803714127, now seen corresponding path program 1 times [2022-11-02 20:57:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:48,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634954924] [2022-11-02 20:57:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:48,402 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-02 20:57:48,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634954924] [2022-11-02 20:57:48,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634954924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:48,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:48,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745297521] [2022-11-02 20:57:48,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:48,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:48,405 INFO L87 Difference]: Start difference. First operand 19205 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:48,626 INFO L93 Difference]: Finished difference Result 32775 states and 45316 transitions. [2022-11-02 20:57:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:57:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:48,696 INFO L225 Difference]: With dead ends: 32775 [2022-11-02 20:57:48,696 INFO L226 Difference]: Without dead ends: 32775 [2022-11-02 20:57:48,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:48,697 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 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-02 20:57:48,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32775 states. [2022-11-02 20:57:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32775 to 28677. [2022-11-02 20:57:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28677 states, 28676 states have (on average 1.3302761891477193) internal successors, (38147), 28676 states have internal predecessors, (38147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 38147 transitions. [2022-11-02 20:57:49,552 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 38147 transitions. Word has length 29 [2022-11-02 20:57:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:49,552 INFO L495 AbstractCegarLoop]: Abstraction has 28677 states and 38147 transitions. [2022-11-02 20:57:49,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 38147 transitions. [2022-11-02 20:57:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:57:49,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:49,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:49,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:57:49,589 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 782645773, now seen corresponding path program 1 times [2022-11-02 20:57:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:49,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078365550] [2022-11-02 20:57:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:49,643 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-02 20:57:49,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:49,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078365550] [2022-11-02 20:57:49,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078365550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:49,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:49,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373488368] [2022-11-02 20:57:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:49,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:49,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:49,646 INFO L87 Difference]: Start difference. First operand 28677 states and 38147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:49,779 INFO L93 Difference]: Finished difference Result 37383 states and 49156 transitions. [2022-11-02 20:57:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:57:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:50,031 INFO L225 Difference]: With dead ends: 37383 [2022-11-02 20:57:50,031 INFO L226 Difference]: Without dead ends: 37383 [2022-11-02 20:57:50,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:50,032 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:50,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37383 states. [2022-11-02 20:57:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37383 to 37381. [2022-11-02 20:57:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37381 states, 37380 states have (on average 1.315008025682183) internal successors, (49155), 37380 states have internal predecessors, (49155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37381 states to 37381 states and 49155 transitions. [2022-11-02 20:57:51,000 INFO L78 Accepts]: Start accepts. Automaton has 37381 states and 49155 transitions. Word has length 29 [2022-11-02 20:57:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:51,001 INFO L495 AbstractCegarLoop]: Abstraction has 37381 states and 49155 transitions. [2022-11-02 20:57:51,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 37381 states and 49155 transitions. [2022-11-02 20:57:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:57:51,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:51,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:51,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:57:51,041 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash 80778534, now seen corresponding path program 1 times [2022-11-02 20:57:51,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:51,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805706543] [2022-11-02 20:57:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:51,075 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-02 20:57:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:51,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805706543] [2022-11-02 20:57:51,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805706543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:51,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:51,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114471782] [2022-11-02 20:57:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:51,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:51,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:51,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:51,079 INFO L87 Difference]: Start difference. First operand 37381 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:51,252 INFO L93 Difference]: Finished difference Result 37895 states and 49156 transitions. [2022-11-02 20:57:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:51,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-02 20:57:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:51,352 INFO L225 Difference]: With dead ends: 37895 [2022-11-02 20:57:51,353 INFO L226 Difference]: Without dead ends: 37895 [2022-11-02 20:57:51,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:51,354 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:51,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37895 states. [2022-11-02 20:57:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37895 to 37893. [2022-11-02 20:57:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37893 states, 37892 states have (on average 1.2972395228544285) internal successors, (49155), 37892 states have internal predecessors, (49155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37893 states to 37893 states and 49155 transitions. [2022-11-02 20:57:52,276 INFO L78 Accepts]: Start accepts. Automaton has 37893 states and 49155 transitions. Word has length 30 [2022-11-02 20:57:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:52,276 INFO L495 AbstractCegarLoop]: Abstraction has 37893 states and 49155 transitions. [2022-11-02 20:57:52,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37893 states and 49155 transitions. [2022-11-02 20:57:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:57:52,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:52,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:52,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:57:52,309 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:52,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1507569368, now seen corresponding path program 1 times [2022-11-02 20:57:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:52,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491783892] [2022-11-02 20:57:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:52,346 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-02 20:57:52,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:52,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491783892] [2022-11-02 20:57:52,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491783892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:52,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:52,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301712088] [2022-11-02 20:57:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:52,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:52,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:52,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:52,350 INFO L87 Difference]: Start difference. First operand 37893 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:52,889 INFO L93 Difference]: Finished difference Result 73735 states and 92164 transitions. [2022-11-02 20:57:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:52,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-02 20:57:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:53,051 INFO L225 Difference]: With dead ends: 73735 [2022-11-02 20:57:53,052 INFO L226 Difference]: Without dead ends: 73735 [2022-11-02 20:57:53,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:53,053 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:53,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73735 states. [2022-11-02 20:57:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73735 to 73733. [2022-11-02 20:57:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2499728747355288) internal successors, (92163), 73732 states have internal predecessors, (92163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 92163 transitions. [2022-11-02 20:57:54,721 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 92163 transitions. Word has length 30 [2022-11-02 20:57:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:54,722 INFO L495 AbstractCegarLoop]: Abstraction has 73733 states and 92163 transitions. [2022-11-02 20:57:54,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 92163 transitions. [2022-11-02 20:57:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:57:54,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:54,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:54,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:57:54,805 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash -486501014, now seen corresponding path program 1 times [2022-11-02 20:57:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:54,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208699822] [2022-11-02 20:57:54,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:54,849 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-02 20:57:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:54,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208699822] [2022-11-02 20:57:54,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208699822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:54,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:54,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837679330] [2022-11-02 20:57:54,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:54,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:54,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:54,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:54,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:54,852 INFO L87 Difference]: Start difference. First operand 73733 states and 92163 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:55,182 INFO L93 Difference]: Finished difference Result 79879 states and 101380 transitions. [2022-11-02 20:57:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:55,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-02 20:57:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:55,315 INFO L225 Difference]: With dead ends: 79879 [2022-11-02 20:57:55,316 INFO L226 Difference]: Without dead ends: 79879 [2022-11-02 20:57:55,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:55,317 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 33 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 184 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-02 20:57:55,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2022-11-02 20:57:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 73733. [2022-11-02 20:57:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2360847393262084) internal successors, (91139), 73732 states have internal predecessors, (91139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 91139 transitions. [2022-11-02 20:57:56,874 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 91139 transitions. Word has length 30 [2022-11-02 20:57:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:56,875 INFO L495 AbstractCegarLoop]: Abstraction has 73733 states and 91139 transitions. [2022-11-02 20:57:56,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 91139 transitions. [2022-11-02 20:57:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:57:56,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:56,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:56,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:57:56,934 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 510205634, now seen corresponding path program 1 times [2022-11-02 20:57:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:56,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024465317] [2022-11-02 20:57:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:56,971 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-02 20:57:56,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:56,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024465317] [2022-11-02 20:57:56,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024465317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:56,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:56,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:56,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650930028] [2022-11-02 20:57:56,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:56,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:56,976 INFO L87 Difference]: Start difference. First operand 73733 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:57,659 INFO L93 Difference]: Finished difference Result 121863 states and 149508 transitions. [2022-11-02 20:57:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:57,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:57:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:57,823 INFO L225 Difference]: With dead ends: 121863 [2022-11-02 20:57:57,823 INFO L226 Difference]: Without dead ends: 121863 [2022-11-02 20:57:57,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:57,824 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 141 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-02 20:57:57,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121863 states. [2022-11-02 20:57:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121863 to 113669. [2022-11-02 20:57:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113669 states, 113668 states have (on average 1.2071911179927508) internal successors, (137219), 113668 states have internal predecessors, (137219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113669 states to 113669 states and 137219 transitions. [2022-11-02 20:57:59,300 INFO L78 Accepts]: Start accepts. Automaton has 113669 states and 137219 transitions. Word has length 31 [2022-11-02 20:57:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:59,301 INFO L495 AbstractCegarLoop]: Abstraction has 113669 states and 137219 transitions. [2022-11-02 20:57:59,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 113669 states and 137219 transitions. [2022-11-02 20:57:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:57:59,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:59,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:59,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:57:59,955 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:57:59,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash -510862720, now seen corresponding path program 1 times [2022-11-02 20:57:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:59,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751350164] [2022-11-02 20:57:59,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:59,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:59,996 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-02 20:57:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:59,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751350164] [2022-11-02 20:57:59,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751350164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:59,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:59,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99802733] [2022-11-02 20:57:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:59,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:00,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:00,003 INFO L87 Difference]: Start difference. First operand 113669 states and 137219 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:00,483 INFO L93 Difference]: Finished difference Result 144391 states and 169988 transitions. [2022-11-02 20:58:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:00,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:58:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:00,689 INFO L225 Difference]: With dead ends: 144391 [2022-11-02 20:58:00,689 INFO L226 Difference]: Without dead ends: 144391 [2022-11-02 20:58:00,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:00,690 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 52 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:00,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144391 states. [2022-11-02 20:58:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144391 to 144389. [2022-11-02 20:58:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144389 states, 144388 states have (on average 1.177293126852647) internal successors, (169987), 144388 states have internal predecessors, (169987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144389 states to 144389 states and 169987 transitions. [2022-11-02 20:58:03,394 INFO L78 Accepts]: Start accepts. Automaton has 144389 states and 169987 transitions. Word has length 31 [2022-11-02 20:58:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:03,395 INFO L495 AbstractCegarLoop]: Abstraction has 144389 states and 169987 transitions. [2022-11-02 20:58:03,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 144389 states and 169987 transitions. [2022-11-02 20:58:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:58:03,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:03,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:03,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:58:03,474 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:58:03,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1363278403, now seen corresponding path program 1 times [2022-11-02 20:58:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:03,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239308410] [2022-11-02 20:58:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:03,508 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-02 20:58:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:03,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239308410] [2022-11-02 20:58:03,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239308410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:03,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:03,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681741323] [2022-11-02 20:58:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:03,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:03,511 INFO L87 Difference]: Start difference. First operand 144389 states and 169987 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:03,881 INFO L93 Difference]: Finished difference Result 147463 states and 172036 transitions. [2022-11-02 20:58:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:03,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:58:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:04,041 INFO L225 Difference]: With dead ends: 147463 [2022-11-02 20:58:04,041 INFO L226 Difference]: Without dead ends: 147463 [2022-11-02 20:58:04,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:04,042 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 54 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:04,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147463 states. [2022-11-02 20:58:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147463 to 147461. [2022-11-02 20:58:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147461 states, 147460 states have (on average 1.1666553641665536) internal successors, (172035), 147460 states have internal predecessors, (172035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147461 states to 147461 states and 172035 transitions. [2022-11-02 20:58:07,016 INFO L78 Accepts]: Start accepts. Automaton has 147461 states and 172035 transitions. Word has length 32 [2022-11-02 20:58:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:07,017 INFO L495 AbstractCegarLoop]: Abstraction has 147461 states and 172035 transitions. [2022-11-02 20:58:07,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 147461 states and 172035 transitions. [2022-11-02 20:58:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:58:07,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:07,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:07,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:58:07,137 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:58:07,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:07,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1343340991, now seen corresponding path program 1 times [2022-11-02 20:58:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:07,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049704323] [2022-11-02 20:58:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:07,169 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-02 20:58:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:07,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049704323] [2022-11-02 20:58:07,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049704323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:07,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:07,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284112950] [2022-11-02 20:58:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:07,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:07,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:07,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:07,174 INFO L87 Difference]: Start difference. First operand 147461 states and 172035 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:08,591 INFO L93 Difference]: Finished difference Result 237573 states and 270339 transitions. [2022-11-02 20:58:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:08,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:58:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:08,871 INFO L225 Difference]: With dead ends: 237573 [2022-11-02 20:58:08,871 INFO L226 Difference]: Without dead ends: 237573 [2022-11-02 20:58:08,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:08,872 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 138 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-02 20:58:08,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237573 states. [2022-11-02 20:58:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237573 to 229381. [2022-11-02 20:58:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229381 states, 229380 states have (on average 1.1428502920917256) internal successors, (262147), 229380 states have internal predecessors, (262147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229381 states to 229381 states and 262147 transitions. [2022-11-02 20:58:12,761 INFO L78 Accepts]: Start accepts. Automaton has 229381 states and 262147 transitions. Word has length 32 [2022-11-02 20:58:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:12,761 INFO L495 AbstractCegarLoop]: Abstraction has 229381 states and 262147 transitions. [2022-11-02 20:58:12,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 229381 states and 262147 transitions. [2022-11-02 20:58:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:58:13,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:13,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:13,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:58:13,030 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:58:13,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash 322272637, now seen corresponding path program 1 times [2022-11-02 20:58:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:13,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590113193] [2022-11-02 20:58:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:13,061 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-02 20:58:13,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:13,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590113193] [2022-11-02 20:58:13,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590113193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:13,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:13,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791527675] [2022-11-02 20:58:13,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:13,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:13,065 INFO L87 Difference]: Start difference. First operand 229381 states and 262147 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:13,934 INFO L93 Difference]: Finished difference Result 286723 states and 315394 transitions. [2022-11-02 20:58:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:13,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:58:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:13,935 INFO L225 Difference]: With dead ends: 286723 [2022-11-02 20:58:13,935 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:58:13,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:13,936 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:13,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:58:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:58:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:58:13,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-11-02 20:58:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:13,939 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:58:13,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:58:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:58:13,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:58:13,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-11-02 20:58:13,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-11-02 20:58:13,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:58:13,948 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:13,951 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:58:13,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:58:13 BoogieIcfgContainer [2022-11-02 20:58:13,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:58:13,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:58:13,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:58:13,956 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:58:13,957 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:40" (3/4) ... [2022-11-02 20:58:13,961 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:58:13,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-02 20:58:13,977 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:58:13,977 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-02 20:58:13,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:58:14,030 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:58:14,030 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:58:14,031 INFO L158 Benchmark]: Toolchain (without parser) took 34691.08ms. Allocated memory was 113.2MB in the beginning and 14.6GB in the end (delta: 14.5GB). Free memory was 77.9MB in the beginning and 11.7GB in the end (delta: -11.6GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2022-11-02 20:58:14,031 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 86.0MB. Free memory was 58.2MB in the beginning and 58.2MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:14,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.04ms. Allocated memory is still 113.2MB. Free memory was 77.7MB in the beginning and 87.7MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:58:14,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.65ms. Allocated memory is still 113.2MB. Free memory was 87.7MB in the beginning and 86.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:14,033 INFO L158 Benchmark]: Boogie Preprocessor took 66.22ms. Allocated memory is still 113.2MB. Free memory was 86.1MB in the beginning and 84.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:58:14,033 INFO L158 Benchmark]: RCFGBuilder took 617.91ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 68.3MB in the end (delta: 16.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 20:58:14,033 INFO L158 Benchmark]: TraceAbstraction took 33383.41ms. Allocated memory was 113.2MB in the beginning and 14.6GB in the end (delta: 14.5GB). Free memory was 67.7MB in the beginning and 11.7GB in the end (delta: -11.6GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2022-11-02 20:58:14,034 INFO L158 Benchmark]: Witness Printer took 74.40ms. Allocated memory is still 14.6GB. Free memory was 11.7GB in the beginning and 11.7GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:58:14,035 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 86.0MB. Free memory was 58.2MB in the beginning and 58.2MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.04ms. Allocated memory is still 113.2MB. Free memory was 77.7MB in the beginning and 87.7MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.65ms. Allocated memory is still 113.2MB. Free memory was 87.7MB in the beginning and 86.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.22ms. Allocated memory is still 113.2MB. Free memory was 86.1MB in the beginning and 84.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 617.91ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 68.3MB in the end (delta: 16.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33383.41ms. Allocated memory was 113.2MB in the beginning and 14.6GB in the end (delta: 14.5GB). Free memory was 67.7MB in the beginning and 11.7GB in the end (delta: -11.6GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 74.40ms. Allocated memory is still 14.6GB. Free memory was 11.7GB in the beginning and 11.7GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 205]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 38, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.6s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2002 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2002 mSDsluCounter, 6530 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2564 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 3966 mSDtfsCounter, 192 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229381occurred in iteration=37, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 951 NumberOfCodeBlocks, 951 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 2013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:58:14,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2be55ff-4960-49a2-8621-c4f9c163a981/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE