./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.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_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/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_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/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_5d67988f-f1b1-49e4-967b-09ba2df379a8/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 b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad --- 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:41:15,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:41:15,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:41:15,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:41:15,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:41:15,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:41:15,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:41:15,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:41:15,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:41:15,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:41:15,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:41:15,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:41:15,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:41:15,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:41:15,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:41:15,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:41:15,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:41:15,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:41:15,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:41:15,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:41:15,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:41:15,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:41:15,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:41:15,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:41:15,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:41:15,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:41:15,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:41:15,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:41:15,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:41:15,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:41:15,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:41:15,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:41:15,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:41:15,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:41:15,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:41:15,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:41:15,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:41:15,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:41:15,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:41:15,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:41:15,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:41:15,194 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:41:15,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:41:15,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:41:15,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:41:15,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:41:15,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:41:15,233 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:41:15,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:41:15,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:41:15,234 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:41:15,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:41:15,241 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:41:15,241 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:41:15,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:41:15,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:41:15,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:41:15,242 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:41:15,242 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:41:15,242 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:41:15,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:41:15,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:41:15,243 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:41:15,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:41:15,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:41:15,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:41:15,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:41:15,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:41:15,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:41:15,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:41:15,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:41:15,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:41:15,247 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_5d67988f-f1b1-49e4-967b-09ba2df379a8/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_5d67988f-f1b1-49e4-967b-09ba2df379a8/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 -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2022-11-02 20:41:15,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:41:15,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:41:15,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:41:15,551 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:41:15,552 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:41:15,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-11-02 20:41:15,643 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/data/fc556a40c/fd8e8a7e882f417caa657f3d3b35cc43/FLAG4fe513e78 [2022-11-02 20:41:16,254 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:41:16,255 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-11-02 20:41:16,274 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/data/fc556a40c/fd8e8a7e882f417caa657f3d3b35cc43/FLAG4fe513e78 [2022-11-02 20:41:16,538 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/data/fc556a40c/fd8e8a7e882f417caa657f3d3b35cc43 [2022-11-02 20:41:16,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:41:16,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:41:16,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:41:16,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:41:16,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:41:16,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:41:16" (1/1) ... [2022-11-02 20:41:16,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e4a7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:16, skipping insertion in model container [2022-11-02 20:41:16,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:41:16" (1/1) ... [2022-11-02 20:41:16,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:41:16,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:41:17,038 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_5d67988f-f1b1-49e4-967b-09ba2df379a8/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-11-02 20:41:17,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:41:17,050 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:41:17,132 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_5d67988f-f1b1-49e4-967b-09ba2df379a8/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-11-02 20:41:17,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:41:17,148 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:41:17,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17 WrapperNode [2022-11-02 20:41:17,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:41:17,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:41:17,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:41:17,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:41:17,158 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:41:17" (1/1) ... [2022-11-02 20:41:17,172 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:41:17" (1/1) ... [2022-11-02 20:41:17,235 INFO L138 Inliner]: procedures = 41, calls = 76, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 1331 [2022-11-02 20:41:17,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:41:17,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:41:17,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:41:17,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:41:17,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,282 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:41:17,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:41:17,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:41:17,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:41:17,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (1/1) ... [2022-11-02 20:41:17,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:41:17,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:17,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:41:17,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:41:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:41:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-11-02 20:41:17,412 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-11-02 20:41:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-11-02 20:41:17,413 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-11-02 20:41:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-02 20:41:17,413 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-02 20:41:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 20:41:17,413 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 20:41:17,414 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 20:41:17,414 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 20:41:17,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:41:17,414 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 20:41:17,415 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 20:41:17,415 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-11-02 20:41:17,415 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-11-02 20:41:17,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:41:17,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:41:17,741 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:41:17,743 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:41:17,760 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:17,882 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-02 20:41:17,883 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-02 20:41:17,884 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:17,906 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-02 20:41:17,906 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-02 20:41:17,924 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:17,930 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:17,937 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:17,939 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:17,949 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:17,953 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:17,965 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:18,708 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume !false; [2022-11-02 20:41:18,709 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2022-11-02 20:41:18,709 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2022-11-02 20:41:18,709 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume !false; [2022-11-02 20:41:18,709 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##66: assume false; [2022-11-02 20:41:18,709 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##127: assume !false; [2022-11-02 20:41:18,709 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2022-11-02 20:41:18,710 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2022-11-02 20:41:18,710 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-11-02 20:41:18,710 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-11-02 20:41:18,710 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##169: assume false; [2022-11-02 20:41:18,710 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##236: assume !false; [2022-11-02 20:41:18,710 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##235: assume false; [2022-11-02 20:41:18,711 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##126: assume false; [2022-11-02 20:41:18,712 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:18,743 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-02 20:41:18,743 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-02 20:41:18,744 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:18,745 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:18,745 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:41:18,784 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-11-02 20:41:18,784 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2022-11-02 20:41:18,784 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2022-11-02 20:41:18,785 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-11-02 20:41:18,785 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-11-02 20:41:18,785 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-11-02 20:41:18,797 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:41:18,813 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:41:18,815 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:41:18,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:41:18 BoogieIcfgContainer [2022-11-02 20:41:18,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:41:18,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:41:18,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:41:18,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:41:18,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:41:16" (1/3) ... [2022-11-02 20:41:18,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20826c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:41:18, skipping insertion in model container [2022-11-02 20:41:18,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:41:17" (2/3) ... [2022-11-02 20:41:18,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20826c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:41:18, skipping insertion in model container [2022-11-02 20:41:18,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:41:18" (3/3) ... [2022-11-02 20:41:18,830 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2022-11-02 20:41:18,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:41:18,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:41:18,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:41:18,903 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;@1130247c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:41:18,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:41:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 319 states, 259 states have (on average 1.5250965250965252) internal successors, (395), 285 states have internal predecessors, (395), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-02 20:41:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:41:18,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:18,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:18,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:18,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash -207662691, now seen corresponding path program 1 times [2022-11-02 20:41:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:18,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959328037] [2022-11-02 20:41:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:19,231 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:41:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:19,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959328037] [2022-11-02 20:41:19,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959328037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:19,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:19,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427829676] [2022-11-02 20:41:19,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:19,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:19,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:19,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:19,294 INFO L87 Difference]: Start difference. First operand has 319 states, 259 states have (on average 1.5250965250965252) internal successors, (395), 285 states have internal predecessors, (395), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:19,380 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2022-11-02 20:41:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:19,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:41:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:19,396 INFO L225 Difference]: With dead ends: 318 [2022-11-02 20:41:19,396 INFO L226 Difference]: Without dead ends: 316 [2022-11-02 20:41:19,397 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:41:19,401 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 262 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:19,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 630 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-02 20:41:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2022-11-02 20:41:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 257 states have (on average 1.5058365758754864) internal successors, (387), 281 states have internal predecessors, (387), 50 states have call successors, (50), 7 states have call predecessors, (50), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-02 20:41:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2022-11-02 20:41:19,464 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 8 [2022-11-02 20:41:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:19,464 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2022-11-02 20:41:19,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2022-11-02 20:41:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:41:19,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:19,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:19,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:41:19,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:19,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1841054047, now seen corresponding path program 1 times [2022-11-02 20:41:19,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:19,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926874582] [2022-11-02 20:41:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:19,632 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:41:19,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:19,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926874582] [2022-11-02 20:41:19,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926874582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:19,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:19,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:19,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770349803] [2022-11-02 20:41:19,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:19,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:19,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:19,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:19,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:19,638 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:19,796 INFO L93 Difference]: Finished difference Result 438 states and 641 transitions. [2022-11-02 20:41:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:41:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:19,800 INFO L225 Difference]: With dead ends: 438 [2022-11-02 20:41:19,800 INFO L226 Difference]: Without dead ends: 438 [2022-11-02 20:41:19,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:41:19,802 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 370 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:19,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 779 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-02 20:41:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 417. [2022-11-02 20:41:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 358 states have (on average 1.4245810055865922) internal successors, (510), 362 states have internal predecessors, (510), 48 states have call successors, (48), 11 states have call predecessors, (48), 9 states have return successors, (52), 44 states have call predecessors, (52), 37 states have call successors, (52) [2022-11-02 20:41:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 610 transitions. [2022-11-02 20:41:19,832 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 610 transitions. Word has length 16 [2022-11-02 20:41:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:19,833 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 610 transitions. [2022-11-02 20:41:19,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 610 transitions. [2022-11-02 20:41:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:41:19,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:19,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:19,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:41:19,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1499851735, now seen corresponding path program 1 times [2022-11-02 20:41:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:19,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527049665] [2022-11-02 20:41:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:19,928 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:41:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527049665] [2022-11-02 20:41:19,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527049665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:19,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:19,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:41:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442364665] [2022-11-02 20:41:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:19,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:19,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:19,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:19,932 INFO L87 Difference]: Start difference. First operand 417 states and 610 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:41:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:20,001 INFO L93 Difference]: Finished difference Result 416 states and 609 transitions. [2022-11-02 20:41:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:20,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:41:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:20,008 INFO L225 Difference]: With dead ends: 416 [2022-11-02 20:41:20,008 INFO L226 Difference]: Without dead ends: 411 [2022-11-02 20:41:20,009 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:41:20,015 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 272 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:20,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 543 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-11-02 20:41:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2022-11-02 20:41:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 353 states have (on average 1.4022662889518414) internal successors, (495), 356 states have internal predecessors, (495), 48 states have call successors, (48), 11 states have call predecessors, (48), 9 states have return successors, (52), 44 states have call predecessors, (52), 37 states have call successors, (52) [2022-11-02 20:41:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 595 transitions. [2022-11-02 20:41:20,062 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 595 transitions. Word has length 14 [2022-11-02 20:41:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:20,062 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 595 transitions. [2022-11-02 20:41:20,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:41:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 595 transitions. [2022-11-02 20:41:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:41:20,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:20,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:20,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:41:20,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash -866854956, now seen corresponding path program 1 times [2022-11-02 20:41:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:20,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529159543] [2022-11-02 20:41:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:20,198 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:41:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:20,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529159543] [2022-11-02 20:41:20,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529159543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:20,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:20,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:20,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953549521] [2022-11-02 20:41:20,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:20,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:20,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:20,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:20,202 INFO L87 Difference]: Start difference. First operand 411 states and 595 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:20,244 INFO L93 Difference]: Finished difference Result 497 states and 703 transitions. [2022-11-02 20:41:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:41:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:20,248 INFO L225 Difference]: With dead ends: 497 [2022-11-02 20:41:20,248 INFO L226 Difference]: Without dead ends: 497 [2022-11-02 20:41:20,249 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:41:20,250 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 407 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:20,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 540 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-11-02 20:41:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 459. [2022-11-02 20:41:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 394 states have (on average 1.3959390862944163) internal successors, (550), 404 states have internal predecessors, (550), 50 states have call successors, (50), 14 states have call predecessors, (50), 14 states have return successors, (59), 43 states have call predecessors, (59), 41 states have call successors, (59) [2022-11-02 20:41:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 659 transitions. [2022-11-02 20:41:20,268 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 659 transitions. Word has length 19 [2022-11-02 20:41:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:20,268 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 659 transitions. [2022-11-02 20:41:20,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 659 transitions. [2022-11-02 20:41:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:41:20,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:20,270 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:41:20,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:41:20,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:20,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:20,271 INFO L85 PathProgramCache]: Analyzing trace with hash 122564209, now seen corresponding path program 1 times [2022-11-02 20:41:20,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:20,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624740876] [2022-11-02 20:41:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:20,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:20,322 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:41:20,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:20,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624740876] [2022-11-02 20:41:20,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624740876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:20,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:20,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815463703] [2022-11-02 20:41:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:20,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:20,325 INFO L87 Difference]: Start difference. First operand 459 states and 659 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:20,374 INFO L93 Difference]: Finished difference Result 638 states and 904 transitions. [2022-11-02 20:41:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:20,375 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:41:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:20,379 INFO L225 Difference]: With dead ends: 638 [2022-11-02 20:41:20,380 INFO L226 Difference]: Without dead ends: 638 [2022-11-02 20:41:20,380 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:41:20,381 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 394 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:20,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 655 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-11-02 20:41:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 613. [2022-11-02 20:41:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 531 states have (on average 1.384180790960452) internal successors, (735), 538 states have internal predecessors, (735), 60 states have call successors, (60), 22 states have call predecessors, (60), 21 states have return successors, (80), 55 states have call predecessors, (80), 53 states have call successors, (80) [2022-11-02 20:41:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 875 transitions. [2022-11-02 20:41:20,412 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 875 transitions. Word has length 22 [2022-11-02 20:41:20,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:20,413 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 875 transitions. [2022-11-02 20:41:20,413 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 875 transitions. [2022-11-02 20:41:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:41:20,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:20,416 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:41:20,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:41:20,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2116337547, now seen corresponding path program 1 times [2022-11-02 20:41:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:20,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369199134] [2022-11-02 20:41:20,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:41:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:20,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:20,493 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:41:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:20,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369199134] [2022-11-02 20:41:20,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369199134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:20,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:20,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:20,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531868004] [2022-11-02 20:41:20,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:20,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:20,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:20,498 INFO L87 Difference]: Start difference. First operand 613 states and 875 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:41:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:21,003 INFO L93 Difference]: Finished difference Result 669 states and 949 transitions. [2022-11-02 20:41:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-02 20:41:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:21,009 INFO L225 Difference]: With dead ends: 669 [2022-11-02 20:41:21,009 INFO L226 Difference]: Without dead ends: 669 [2022-11-02 20:41:21,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:21,010 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 115 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:21,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1246 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:41:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-02 20:41:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 648. [2022-11-02 20:41:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 564 states have (on average 1.375886524822695) internal successors, (776), 571 states have internal predecessors, (776), 60 states have call successors, (60), 22 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2022-11-02 20:41:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 921 transitions. [2022-11-02 20:41:21,037 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 921 transitions. Word has length 29 [2022-11-02 20:41:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:21,038 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 921 transitions. [2022-11-02 20:41:21,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:41:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 921 transitions. [2022-11-02 20:41:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:41:21,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:21,041 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:41:21,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:41:21,042 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:21,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash -205375653, now seen corresponding path program 1 times [2022-11-02 20:41:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:21,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985265489] [2022-11-02 20:41:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:21,126 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:41:21,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:21,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985265489] [2022-11-02 20:41:21,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985265489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:21,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:21,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113879567] [2022-11-02 20:41:21,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:21,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:21,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:21,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:21,129 INFO L87 Difference]: Start difference. First operand 648 states and 921 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:21,221 INFO L93 Difference]: Finished difference Result 660 states and 937 transitions. [2022-11-02 20:41:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:21,222 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:41:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:21,228 INFO L225 Difference]: With dead ends: 660 [2022-11-02 20:41:21,229 INFO L226 Difference]: Without dead ends: 660 [2022-11-02 20:41:21,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:41:21,232 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 20 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:21,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 778 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-11-02 20:41:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 659. [2022-11-02 20:41:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.373913043478261) internal successors, (790), 581 states have internal predecessors, (790), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2022-11-02 20:41:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 935 transitions. [2022-11-02 20:41:21,266 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 935 transitions. Word has length 28 [2022-11-02 20:41:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:21,268 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 935 transitions. [2022-11-02 20:41:21,268 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 935 transitions. [2022-11-02 20:41:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:41:21,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:21,271 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:41:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:41:21,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash -729865897, now seen corresponding path program 1 times [2022-11-02 20:41:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:21,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787324367] [2022-11-02 20:41:21,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:21,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:41:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:21,518 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:41:21,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:21,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787324367] [2022-11-02 20:41:21,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787324367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:21,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:21,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678479281] [2022-11-02 20:41:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:21,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:21,522 INFO L87 Difference]: Start difference. First operand 659 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:22,059 INFO L93 Difference]: Finished difference Result 680 states and 962 transitions. [2022-11-02 20:41:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:22,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-02 20:41:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:22,063 INFO L225 Difference]: With dead ends: 680 [2022-11-02 20:41:22,064 INFO L226 Difference]: Without dead ends: 680 [2022-11-02 20:41:22,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:22,065 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 608 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:22,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1197 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-11-02 20:41:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2022-11-02 20:41:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.3721739130434782) internal successors, (789), 581 states have internal predecessors, (789), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2022-11-02 20:41:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 934 transitions. [2022-11-02 20:41:22,090 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 934 transitions. Word has length 30 [2022-11-02 20:41:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:22,091 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 934 transitions. [2022-11-02 20:41:22,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 934 transitions. [2022-11-02 20:41:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:41:22,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:22,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:22,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:41:22,096 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1222819339, now seen corresponding path program 1 times [2022-11-02 20:41:22,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:22,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492034137] [2022-11-02 20:41:22,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:41:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,319 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:41:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:22,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492034137] [2022-11-02 20:41:22,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492034137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:22,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:22,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336356074] [2022-11-02 20:41:22,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:22,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:22,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:22,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:22,322 INFO L87 Difference]: Start difference. First operand 659 states and 934 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:22,767 INFO L93 Difference]: Finished difference Result 680 states and 961 transitions. [2022-11-02 20:41:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-02 20:41:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:22,772 INFO L225 Difference]: With dead ends: 680 [2022-11-02 20:41:22,773 INFO L226 Difference]: Without dead ends: 680 [2022-11-02 20:41:22,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:22,776 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 670 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:22,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 951 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-11-02 20:41:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2022-11-02 20:41:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.3704347826086956) internal successors, (788), 581 states have internal predecessors, (788), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2022-11-02 20:41:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 933 transitions. [2022-11-02 20:41:22,796 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 933 transitions. Word has length 32 [2022-11-02 20:41:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:22,796 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 933 transitions. [2022-11-02 20:41:22,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 933 transitions. [2022-11-02 20:41:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:41:22,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:22,798 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, 1] [2022-11-02 20:41:22,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:41:22,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash -663319401, now seen corresponding path program 1 times [2022-11-02 20:41:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:22,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182796007] [2022-11-02 20:41:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:22,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:41:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:22,929 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:41:22,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:22,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182796007] [2022-11-02 20:41:22,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182796007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:22,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:22,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:22,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467624994] [2022-11-02 20:41:22,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:22,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:22,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:22,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:22,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:22,931 INFO L87 Difference]: Start difference. First operand 659 states and 933 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:41:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:23,335 INFO L93 Difference]: Finished difference Result 688 states and 969 transitions. [2022-11-02 20:41:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:23,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-02 20:41:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:23,339 INFO L225 Difference]: With dead ends: 688 [2022-11-02 20:41:23,339 INFO L226 Difference]: Without dead ends: 676 [2022-11-02 20:41:23,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:23,340 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 395 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:23,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1470 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-02 20:41:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 657. [2022-11-02 20:41:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 574 states have (on average 1.3693379790940767) internal successors, (786), 580 states have internal predecessors, (786), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (84), 54 states have call predecessors, (84), 52 states have call successors, (84) [2022-11-02 20:41:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 929 transitions. [2022-11-02 20:41:23,357 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 929 transitions. Word has length 33 [2022-11-02 20:41:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:23,357 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 929 transitions. [2022-11-02 20:41:23,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:41:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 929 transitions. [2022-11-02 20:41:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:41:23,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:23,359 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:41:23,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:41:23,359 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2133265312, now seen corresponding path program 1 times [2022-11-02 20:41:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:23,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054392083] [2022-11-02 20:41:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:23,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:23,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:41:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:23,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:41:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:23,467 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:41:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:23,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054392083] [2022-11-02 20:41:23,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054392083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:23,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:23,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543901706] [2022-11-02 20:41:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:23,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:23,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:23,470 INFO L87 Difference]: Start difference. First operand 657 states and 929 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:41:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:23,854 INFO L93 Difference]: Finished difference Result 686 states and 965 transitions. [2022-11-02 20:41:23,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:23,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-02 20:41:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:23,861 INFO L225 Difference]: With dead ends: 686 [2022-11-02 20:41:23,861 INFO L226 Difference]: Without dead ends: 669 [2022-11-02 20:41:23,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:23,862 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 394 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:23,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1431 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:23,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-02 20:41:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 650. [2022-11-02 20:41:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 570 states have (on average 1.3701754385964913) internal successors, (781), 576 states have internal predecessors, (781), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (82), 52 states have call predecessors, (82), 50 states have call successors, (82) [2022-11-02 20:41:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 920 transitions. [2022-11-02 20:41:23,885 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 920 transitions. Word has length 32 [2022-11-02 20:41:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:23,885 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 920 transitions. [2022-11-02 20:41:23,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:41:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 920 transitions. [2022-11-02 20:41:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:41:23,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:23,887 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:41:23,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:41:23,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -608614884, now seen corresponding path program 1 times [2022-11-02 20:41:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:23,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899772722] [2022-11-02 20:41:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:23,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:23,946 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:41:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:23,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899772722] [2022-11-02 20:41:23,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899772722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:23,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:23,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383135640] [2022-11-02 20:41:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:23,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:23,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:23,949 INFO L87 Difference]: Start difference. First operand 650 states and 920 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:23,983 INFO L93 Difference]: Finished difference Result 666 states and 931 transitions. [2022-11-02 20:41:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:23,983 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:41:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:23,988 INFO L225 Difference]: With dead ends: 666 [2022-11-02 20:41:23,988 INFO L226 Difference]: Without dead ends: 625 [2022-11-02 20:41:23,988 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:41:23,989 INFO L413 NwaCegarLoop]: 483 mSDtfsCounter, 84 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:23,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 880 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-11-02 20:41:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 621. [2022-11-02 20:41:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 545 states have (on average 1.3688073394495412) internal successors, (746), 552 states have internal predecessors, (746), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:41:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 879 transitions. [2022-11-02 20:41:24,009 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 879 transitions. Word has length 30 [2022-11-02 20:41:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:24,009 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 879 transitions. [2022-11-02 20:41:24,010 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 879 transitions. [2022-11-02 20:41:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:41:24,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:24,012 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:41:24,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:41:24,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:24,013 INFO L85 PathProgramCache]: Analyzing trace with hash -444205772, now seen corresponding path program 1 times [2022-11-02 20:41:24,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:24,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002068995] [2022-11-02 20:41:24,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:24,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:24,124 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:41:24,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:24,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002068995] [2022-11-02 20:41:24,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002068995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:24,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:24,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:41:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408794495] [2022-11-02 20:41:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:24,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:24,126 INFO L87 Difference]: Start difference. First operand 621 states and 879 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:24,214 INFO L93 Difference]: Finished difference Result 637 states and 896 transitions. [2022-11-02 20:41:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:41:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:24,218 INFO L225 Difference]: With dead ends: 637 [2022-11-02 20:41:24,218 INFO L226 Difference]: Without dead ends: 637 [2022-11-02 20:41:24,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:24,220 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 27 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:24,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1213 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-02 20:41:24,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 623. [2022-11-02 20:41:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 554 states have internal predecessors, (748), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:41:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 881 transitions. [2022-11-02 20:41:24,243 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 881 transitions. Word has length 30 [2022-11-02 20:41:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:24,243 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 881 transitions. [2022-11-02 20:41:24,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 881 transitions. [2022-11-02 20:41:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:41:24,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:24,245 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:41:24,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:41:24,246 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1157172862, now seen corresponding path program 1 times [2022-11-02 20:41:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:24,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938243913] [2022-11-02 20:41:24,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:24,321 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:41:24,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:24,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938243913] [2022-11-02 20:41:24,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938243913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:24,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:24,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:41:24,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764635976] [2022-11-02 20:41:24,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:24,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:24,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:24,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:24,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:24,324 INFO L87 Difference]: Start difference. First operand 623 states and 881 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:24,388 INFO L93 Difference]: Finished difference Result 639 states and 898 transitions. [2022-11-02 20:41:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:24,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:41:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:24,391 INFO L225 Difference]: With dead ends: 639 [2022-11-02 20:41:24,392 INFO L226 Difference]: Without dead ends: 639 [2022-11-02 20:41:24,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:24,393 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 28 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:24,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1217 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-11-02 20:41:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 623. [2022-11-02 20:41:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 554 states have internal predecessors, (748), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:41:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 881 transitions. [2022-11-02 20:41:24,415 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 881 transitions. Word has length 31 [2022-11-02 20:41:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:24,415 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 881 transitions. [2022-11-02 20:41:24,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 881 transitions. [2022-11-02 20:41:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:41:24,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:24,416 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, 1, 1] [2022-11-02 20:41:24,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:41:24,417 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:24,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:24,417 INFO L85 PathProgramCache]: Analyzing trace with hash 791167666, now seen corresponding path program 1 times [2022-11-02 20:41:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:24,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812898111] [2022-11-02 20:41:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:24,485 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:41:24,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:24,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812898111] [2022-11-02 20:41:24,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812898111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:24,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:24,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:41:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295306849] [2022-11-02 20:41:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:24,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:24,488 INFO L87 Difference]: Start difference. First operand 623 states and 881 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:24,825 INFO L93 Difference]: Finished difference Result 881 states and 1243 transitions. [2022-11-02 20:41:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:41:24,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-11-02 20:41:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:24,829 INFO L225 Difference]: With dead ends: 881 [2022-11-02 20:41:24,830 INFO L226 Difference]: Without dead ends: 881 [2022-11-02 20:41:24,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:24,831 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 162 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:24,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1105 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-02 20:41:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 702. [2022-11-02 20:41:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 622 states have (on average 1.3762057877813505) internal successors, (856), 630 states have internal predecessors, (856), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (80), 49 states have call predecessors, (80), 50 states have call successors, (80) [2022-11-02 20:41:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 993 transitions. [2022-11-02 20:41:24,852 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 993 transitions. Word has length 34 [2022-11-02 20:41:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:24,853 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 993 transitions. [2022-11-02 20:41:24,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 993 transitions. [2022-11-02 20:41:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:41:24,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:24,855 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, 1] [2022-11-02 20:41:24,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:41:24,855 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1367133224, now seen corresponding path program 1 times [2022-11-02 20:41:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:24,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099310790] [2022-11-02 20:41:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:24,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:41:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:24,920 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:41:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:24,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099310790] [2022-11-02 20:41:24,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099310790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:24,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:24,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901606675] [2022-11-02 20:41:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:24,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:24,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:24,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:24,923 INFO L87 Difference]: Start difference. First operand 702 states and 993 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:25,201 INFO L93 Difference]: Finished difference Result 730 states and 1027 transitions. [2022-11-02 20:41:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:41:25,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-11-02 20:41:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:25,205 INFO L225 Difference]: With dead ends: 730 [2022-11-02 20:41:25,206 INFO L226 Difference]: Without dead ends: 717 [2022-11-02 20:41:25,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:25,207 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 85 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:25,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1388 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-11-02 20:41:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 700. [2022-11-02 20:41:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 621 states have (on average 1.3752012882447664) internal successors, (854), 629 states have internal predecessors, (854), 56 states have call successors, (56), 23 states have call predecessors, (56), 22 states have return successors, (79), 48 states have call predecessors, (79), 49 states have call successors, (79) [2022-11-02 20:41:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 989 transitions. [2022-11-02 20:41:25,270 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 989 transitions. Word has length 33 [2022-11-02 20:41:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:25,271 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 989 transitions. [2022-11-02 20:41:25,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 989 transitions. [2022-11-02 20:41:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:41:25,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:25,272 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, 1, 1, 1] [2022-11-02 20:41:25,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:41:25,273 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:25,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1481962220, now seen corresponding path program 1 times [2022-11-02 20:41:25,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:25,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290446288] [2022-11-02 20:41:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,439 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:41:25,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:25,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290446288] [2022-11-02 20:41:25,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290446288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:25,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:25,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:25,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637878771] [2022-11-02 20:41:25,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:25,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:25,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:25,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:25,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:25,442 INFO L87 Difference]: Start difference. First operand 700 states and 989 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:26,026 INFO L93 Difference]: Finished difference Result 729 states and 1012 transitions. [2022-11-02 20:41:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-02 20:41:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:26,030 INFO L225 Difference]: With dead ends: 729 [2022-11-02 20:41:26,030 INFO L226 Difference]: Without dead ends: 729 [2022-11-02 20:41:26,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:26,031 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 721 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:26,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 935 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:41:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-11-02 20:41:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 691. [2022-11-02 20:41:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 612 states have (on average 1.3611111111111112) internal successors, (833), 620 states have internal predecessors, (833), 56 states have call successors, (56), 23 states have call predecessors, (56), 22 states have return successors, (79), 48 states have call predecessors, (79), 49 states have call successors, (79) [2022-11-02 20:41:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 968 transitions. [2022-11-02 20:41:26,052 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 968 transitions. Word has length 35 [2022-11-02 20:41:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:26,052 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 968 transitions. [2022-11-02 20:41:26,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 968 transitions. [2022-11-02 20:41:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:41:26,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:26,054 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, 1, 1, 1] [2022-11-02 20:41:26,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:41:26,054 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:26,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1698462691, now seen corresponding path program 1 times [2022-11-02 20:41:26,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:26,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248320811] [2022-11-02 20:41:26,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:26,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:41:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,150 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:41:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:26,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248320811] [2022-11-02 20:41:26,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248320811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:26,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:26,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038256868] [2022-11-02 20:41:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:26,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:26,153 INFO L87 Difference]: Start difference. First operand 691 states and 968 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:26,375 INFO L93 Difference]: Finished difference Result 719 states and 1002 transitions. [2022-11-02 20:41:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:41:26,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-02 20:41:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:26,379 INFO L225 Difference]: With dead ends: 719 [2022-11-02 20:41:26,379 INFO L226 Difference]: Without dead ends: 706 [2022-11-02 20:41:26,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:26,380 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 85 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:26,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1375 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-11-02 20:41:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 689. [2022-11-02 20:41:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 611 states have (on average 1.3600654664484453) internal successors, (831), 619 states have internal predecessors, (831), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:41:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 964 transitions. [2022-11-02 20:41:26,409 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 964 transitions. Word has length 35 [2022-11-02 20:41:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:26,409 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 964 transitions. [2022-11-02 20:41:26,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 964 transitions. [2022-11-02 20:41:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:41:26,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:26,411 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, 1, 1, 1, 1, 1] [2022-11-02 20:41:26,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:41:26,412 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1261225060, now seen corresponding path program 1 times [2022-11-02 20:41:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:26,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791326224] [2022-11-02 20:41:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,472 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:41:26,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:26,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791326224] [2022-11-02 20:41:26,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791326224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:26,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:26,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:41:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929734623] [2022-11-02 20:41:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:26,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:41:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:41:26,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:41:26,475 INFO L87 Difference]: Start difference. First operand 689 states and 964 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:26,528 INFO L93 Difference]: Finished difference Result 697 states and 975 transitions. [2022-11-02 20:41:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:41:26,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:41:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:26,531 INFO L225 Difference]: With dead ends: 697 [2022-11-02 20:41:26,531 INFO L226 Difference]: Without dead ends: 697 [2022-11-02 20:41:26,531 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:41:26,532 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 5 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:26,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 766 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-02 20:41:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2022-11-02 20:41:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 619 states have (on average 1.3602584814216478) internal successors, (842), 627 states have internal predecessors, (842), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:41:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 975 transitions. [2022-11-02 20:41:26,554 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 975 transitions. Word has length 37 [2022-11-02 20:41:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:26,554 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 975 transitions. [2022-11-02 20:41:26,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:41:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 975 transitions. [2022-11-02 20:41:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:41:26,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:26,557 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, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:26,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:41:26,557 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:26,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1320764659, now seen corresponding path program 1 times [2022-11-02 20:41:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:26,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208917614] [2022-11-02 20:41:26,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:41:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:26,663 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:41:26,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:26,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208917614] [2022-11-02 20:41:26,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208917614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:26,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:26,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834185485] [2022-11-02 20:41:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:26,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:26,666 INFO L87 Difference]: Start difference. First operand 697 states and 975 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:26,974 INFO L93 Difference]: Finished difference Result 719 states and 999 transitions. [2022-11-02 20:41:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:26,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-02 20:41:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:26,978 INFO L225 Difference]: With dead ends: 719 [2022-11-02 20:41:26,979 INFO L226 Difference]: Without dead ends: 704 [2022-11-02 20:41:26,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:26,980 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 96 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:26,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1693 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-11-02 20:41:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 697. [2022-11-02 20:41:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 619 states have (on average 1.3408723747980613) internal successors, (830), 627 states have internal predecessors, (830), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2022-11-02 20:41:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 963 transitions. [2022-11-02 20:41:27,003 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 963 transitions. Word has length 38 [2022-11-02 20:41:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:27,004 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 963 transitions. [2022-11-02 20:41:27,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 963 transitions. [2022-11-02 20:41:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:41:27,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:27,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:41:27,006 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash -257120717, now seen corresponding path program 1 times [2022-11-02 20:41:27,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:27,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030161285] [2022-11-02 20:41:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:27,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:41:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:27,129 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:41:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030161285] [2022-11-02 20:41:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030161285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:27,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:27,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338156117] [2022-11-02 20:41:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:27,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:27,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:27,132 INFO L87 Difference]: Start difference. First operand 697 states and 963 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:27,654 INFO L93 Difference]: Finished difference Result 717 states and 983 transitions. [2022-11-02 20:41:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:41:27,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-02 20:41:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:27,658 INFO L225 Difference]: With dead ends: 717 [2022-11-02 20:41:27,658 INFO L226 Difference]: Without dead ends: 717 [2022-11-02 20:41:27,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:41:27,659 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 525 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:27,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1399 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-11-02 20:41:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2022-11-02 20:41:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 626 states have (on average 1.3354632587859425) internal successors, (836), 637 states have internal predecessors, (836), 55 states have call successors, (55), 23 states have call predecessors, (55), 25 states have return successors, (82), 47 states have call predecessors, (82), 48 states have call successors, (82) [2022-11-02 20:41:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 973 transitions. [2022-11-02 20:41:27,681 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 973 transitions. Word has length 38 [2022-11-02 20:41:27,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:27,682 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 973 transitions. [2022-11-02 20:41:27,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 973 transitions. [2022-11-02 20:41:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:41:27,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:27,684 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:27,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:41:27,685 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1775362044, now seen corresponding path program 1 times [2022-11-02 20:41:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:27,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575492846] [2022-11-02 20:41:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:27,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:41:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:27,796 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:41:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:27,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575492846] [2022-11-02 20:41:27,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575492846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:27,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:27,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:27,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575723887] [2022-11-02 20:41:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:27,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:27,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:27,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:27,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:27,798 INFO L87 Difference]: Start difference. First operand 707 states and 973 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:28,129 INFO L93 Difference]: Finished difference Result 724 states and 990 transitions. [2022-11-02 20:41:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:28,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:41:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:28,133 INFO L225 Difference]: With dead ends: 724 [2022-11-02 20:41:28,133 INFO L226 Difference]: Without dead ends: 705 [2022-11-02 20:41:28,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:28,134 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 108 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:28,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1971 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-11-02 20:41:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 699. [2022-11-02 20:41:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 619 states have (on average 1.3344103392568658) internal successors, (826), 630 states have internal predecessors, (826), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (81), 46 states have call predecessors, (81), 47 states have call successors, (81) [2022-11-02 20:41:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 961 transitions. [2022-11-02 20:41:28,155 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 961 transitions. Word has length 39 [2022-11-02 20:41:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:28,156 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 961 transitions. [2022-11-02 20:41:28,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 961 transitions. [2022-11-02 20:41:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:41:28,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:28,158 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:28,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:41:28,158 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 777524033, now seen corresponding path program 1 times [2022-11-02 20:41:28,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:28,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632305762] [2022-11-02 20:41:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:28,242 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:41:28,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:28,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632305762] [2022-11-02 20:41:28,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632305762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:28,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:28,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:28,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533448852] [2022-11-02 20:41:28,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:28,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:28,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:28,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:28,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:28,244 INFO L87 Difference]: Start difference. First operand 699 states and 961 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:28,533 INFO L93 Difference]: Finished difference Result 718 states and 981 transitions. [2022-11-02 20:41:28,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:28,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:41:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:28,537 INFO L225 Difference]: With dead ends: 718 [2022-11-02 20:41:28,537 INFO L226 Difference]: Without dead ends: 697 [2022-11-02 20:41:28,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:28,537 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 312 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:28,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1330 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-02 20:41:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2022-11-02 20:41:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 611 states have (on average 1.3338788870703764) internal successors, (815), 622 states have internal predecessors, (815), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (81), 46 states have call predecessors, (81), 47 states have call successors, (81) [2022-11-02 20:41:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 950 transitions. [2022-11-02 20:41:28,556 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 950 transitions. Word has length 39 [2022-11-02 20:41:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:28,556 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 950 transitions. [2022-11-02 20:41:28,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 950 transitions. [2022-11-02 20:41:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:41:28,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:28,559 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:28,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:41:28,559 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1595982943, now seen corresponding path program 1 times [2022-11-02 20:41:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:28,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884800090] [2022-11-02 20:41:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:28,660 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:41:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884800090] [2022-11-02 20:41:28,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884800090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:28,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:28,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750512720] [2022-11-02 20:41:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:28,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:28,663 INFO L87 Difference]: Start difference. First operand 691 states and 950 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:29,112 INFO L93 Difference]: Finished difference Result 711 states and 972 transitions. [2022-11-02 20:41:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:29,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-02 20:41:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:29,116 INFO L225 Difference]: With dead ends: 711 [2022-11-02 20:41:29,116 INFO L226 Difference]: Without dead ends: 711 [2022-11-02 20:41:29,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:29,117 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 84 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:29,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1755 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-02 20:41:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 696. [2022-11-02 20:41:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 615 states have (on average 1.3317073170731708) internal successors, (819), 626 states have internal predecessors, (819), 54 states have call successors, (54), 23 states have call predecessors, (54), 26 states have return successors, (83), 47 states have call predecessors, (83), 47 states have call successors, (83) [2022-11-02 20:41:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 956 transitions. [2022-11-02 20:41:29,140 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 956 transitions. Word has length 39 [2022-11-02 20:41:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:29,140 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 956 transitions. [2022-11-02 20:41:29,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 956 transitions. [2022-11-02 20:41:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:41:29,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:29,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:29,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:41:29,143 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:29,143 INFO L85 PathProgramCache]: Analyzing trace with hash -398634571, now seen corresponding path program 1 times [2022-11-02 20:41:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:29,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444392717] [2022-11-02 20:41:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:29,217 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:41:29,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:29,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444392717] [2022-11-02 20:41:29,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444392717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:29,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:29,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875473224] [2022-11-02 20:41:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:29,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:29,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:29,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:29,221 INFO L87 Difference]: Start difference. First operand 696 states and 956 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:29,594 INFO L93 Difference]: Finished difference Result 518 states and 681 transitions. [2022-11-02 20:41:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:29,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:41:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:29,597 INFO L225 Difference]: With dead ends: 518 [2022-11-02 20:41:29,598 INFO L226 Difference]: Without dead ends: 518 [2022-11-02 20:41:29,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:29,599 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 485 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:29,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 955 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-11-02 20:41:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 477. [2022-11-02 20:41:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 418 states have (on average 1.299043062200957) internal successors, (543), 428 states have internal predecessors, (543), 39 states have call successors, (39), 16 states have call predecessors, (39), 19 states have return successors, (47), 33 states have call predecessors, (47), 32 states have call successors, (47) [2022-11-02 20:41:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 629 transitions. [2022-11-02 20:41:29,637 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 629 transitions. Word has length 41 [2022-11-02 20:41:29,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:29,638 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 629 transitions. [2022-11-02 20:41:29,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 629 transitions. [2022-11-02 20:41:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:41:29,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:29,640 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:29,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:41:29,640 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1554772088, now seen corresponding path program 1 times [2022-11-02 20:41:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:29,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942079413] [2022-11-02 20:41:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:29,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:41:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:29,707 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:41:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:29,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942079413] [2022-11-02 20:41:29,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942079413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:29,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:29,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:41:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985150539] [2022-11-02 20:41:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:29,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:29,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:29,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:29,711 INFO L87 Difference]: Start difference. First operand 477 states and 629 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:30,007 INFO L93 Difference]: Finished difference Result 607 states and 796 transitions. [2022-11-02 20:41:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:41:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:41:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:30,010 INFO L225 Difference]: With dead ends: 607 [2022-11-02 20:41:30,010 INFO L226 Difference]: Without dead ends: 591 [2022-11-02 20:41:30,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:30,011 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 180 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:30,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 971 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-11-02 20:41:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 531. [2022-11-02 20:41:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 466 states have (on average 1.2918454935622317) internal successors, (602), 470 states have internal predecessors, (602), 41 states have call successors, (41), 18 states have call predecessors, (41), 23 states have return successors, (59), 43 states have call predecessors, (59), 34 states have call successors, (59) [2022-11-02 20:41:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 702 transitions. [2022-11-02 20:41:30,026 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 702 transitions. Word has length 40 [2022-11-02 20:41:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:30,026 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 702 transitions. [2022-11-02 20:41:30,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 702 transitions. [2022-11-02 20:41:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:41:30,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:30,028 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:30,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:41:30,029 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2126401672, now seen corresponding path program 1 times [2022-11-02 20:41:30,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:30,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647699854] [2022-11-02 20:41:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:41:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:30,150 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:41:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647699854] [2022-11-02 20:41:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647699854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:30,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:30,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:30,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631270354] [2022-11-02 20:41:30,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:30,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:30,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:30,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:30,153 INFO L87 Difference]: Start difference. First operand 531 states and 702 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:30,589 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-11-02 20:41:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:30,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-02 20:41:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:30,592 INFO L225 Difference]: With dead ends: 523 [2022-11-02 20:41:30,592 INFO L226 Difference]: Without dead ends: 482 [2022-11-02 20:41:30,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:30,593 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 454 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:30,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1055 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-02 20:41:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 455. [2022-11-02 20:41:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 398 states have (on average 1.3115577889447236) internal successors, (522), 409 states have internal predecessors, (522), 38 states have call successors, (38), 15 states have call predecessors, (38), 18 states have return successors, (47), 31 states have call predecessors, (47), 31 states have call successors, (47) [2022-11-02 20:41:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 607 transitions. [2022-11-02 20:41:30,623 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 607 transitions. Word has length 40 [2022-11-02 20:41:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:30,623 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 607 transitions. [2022-11-02 20:41:30,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 607 transitions. [2022-11-02 20:41:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:41:30,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:30,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:30,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:41:30,626 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1405383092, now seen corresponding path program 1 times [2022-11-02 20:41:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:30,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903156792] [2022-11-02 20:41:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:30,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:41:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:30,799 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:41:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:30,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903156792] [2022-11-02 20:41:30,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903156792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:30,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:30,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:30,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810987307] [2022-11-02 20:41:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:30,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:30,802 INFO L87 Difference]: Start difference. First operand 455 states and 607 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:31,269 INFO L93 Difference]: Finished difference Result 500 states and 670 transitions. [2022-11-02 20:41:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:41:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:31,272 INFO L225 Difference]: With dead ends: 500 [2022-11-02 20:41:31,272 INFO L226 Difference]: Without dead ends: 499 [2022-11-02 20:41:31,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:31,274 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 287 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:31,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1801 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-02 20:41:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 470. [2022-11-02 20:41:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 412 states have (on average 1.3009708737864079) internal successors, (536), 423 states have internal predecessors, (536), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (55), 32 states have call predecessors, (55), 31 states have call successors, (55) [2022-11-02 20:41:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 629 transitions. [2022-11-02 20:41:31,289 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 629 transitions. Word has length 41 [2022-11-02 20:41:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:31,290 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 629 transitions. [2022-11-02 20:41:31,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2022-11-02 20:41:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:41:31,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:31,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:31,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:41:31,292 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1405659922, now seen corresponding path program 1 times [2022-11-02 20:41:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:31,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002266358] [2022-11-02 20:41:31,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:41:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:31,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:41:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:31,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002266358] [2022-11-02 20:41:31,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002266358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:31,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:31,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975688692] [2022-11-02 20:41:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:31,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:31,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:31,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:31,451 INFO L87 Difference]: Start difference. First operand 470 states and 629 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:31,896 INFO L93 Difference]: Finished difference Result 487 states and 647 transitions. [2022-11-02 20:41:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:31,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 20:41:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:31,899 INFO L225 Difference]: With dead ends: 487 [2022-11-02 20:41:31,899 INFO L226 Difference]: Without dead ends: 477 [2022-11-02 20:41:31,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:31,900 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 78 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:31,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1943 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-11-02 20:41:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 467. [2022-11-02 20:41:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 409 states have (on average 1.3031784841075795) internal successors, (533), 421 states have internal predecessors, (533), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (54), 31 states have call predecessors, (54), 31 states have call successors, (54) [2022-11-02 20:41:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 625 transitions. [2022-11-02 20:41:31,912 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 625 transitions. Word has length 41 [2022-11-02 20:41:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:31,912 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 625 transitions. [2022-11-02 20:41:31,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 625 transitions. [2022-11-02 20:41:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:41:31,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:31,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:31,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:41:31,914 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 188020548, now seen corresponding path program 1 times [2022-11-02 20:41:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:31,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943004701] [2022-11-02 20:41:31,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:32,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:41:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:32,053 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:41:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:32,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943004701] [2022-11-02 20:41:32,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943004701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:32,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:32,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241300540] [2022-11-02 20:41:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:32,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:32,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:32,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:32,056 INFO L87 Difference]: Start difference. First operand 467 states and 625 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:32,571 INFO L93 Difference]: Finished difference Result 523 states and 694 transitions. [2022-11-02 20:41:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:32,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-02 20:41:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:32,574 INFO L225 Difference]: With dead ends: 523 [2022-11-02 20:41:32,574 INFO L226 Difference]: Without dead ends: 511 [2022-11-02 20:41:32,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:32,575 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 607 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:32,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1096 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-11-02 20:41:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 453. [2022-11-02 20:41:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 397 states have (on average 1.309823677581864) internal successors, (520), 408 states have internal predecessors, (520), 37 states have call successors, (37), 15 states have call predecessors, (37), 18 states have return successors, (46), 30 states have call predecessors, (46), 30 states have call successors, (46) [2022-11-02 20:41:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2022-11-02 20:41:32,589 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 42 [2022-11-02 20:41:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:32,590 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2022-11-02 20:41:32,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2022-11-02 20:41:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:41:32,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:32,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:32,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:41:32,596 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1315082489, now seen corresponding path program 1 times [2022-11-02 20:41:32,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187107453] [2022-11-02 20:41:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:32,799 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:41:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:32,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187107453] [2022-11-02 20:41:32,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187107453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:32,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:32,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351338207] [2022-11-02 20:41:32,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:32,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:32,802 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:33,127 INFO L93 Difference]: Finished difference Result 413 states and 544 transitions. [2022-11-02 20:41:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:41:33,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-02 20:41:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:33,130 INFO L225 Difference]: With dead ends: 413 [2022-11-02 20:41:33,130 INFO L226 Difference]: Without dead ends: 413 [2022-11-02 20:41:33,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:33,131 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 102 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:33,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1755 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-02 20:41:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2022-11-02 20:41:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 364 states have internal predecessors, (461), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (41), 29 states have call predecessors, (41), 29 states have call successors, (41) [2022-11-02 20:41:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 537 transitions. [2022-11-02 20:41:33,141 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 537 transitions. Word has length 44 [2022-11-02 20:41:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:33,142 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 537 transitions. [2022-11-02 20:41:33,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 537 transitions. [2022-11-02 20:41:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:41:33,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:33,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:33,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:41:33,144 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:33,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash 817778302, now seen corresponding path program 1 times [2022-11-02 20:41:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:33,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020407964] [2022-11-02 20:41:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:33,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:33,300 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:41:33,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:33,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020407964] [2022-11-02 20:41:33,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020407964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:33,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:33,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:33,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280466906] [2022-11-02 20:41:33,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:33,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:33,302 INFO L87 Difference]: Start difference. First operand 407 states and 537 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:33,667 INFO L93 Difference]: Finished difference Result 413 states and 542 transitions. [2022-11-02 20:41:33,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:33,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-02 20:41:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:33,669 INFO L225 Difference]: With dead ends: 413 [2022-11-02 20:41:33,670 INFO L226 Difference]: Without dead ends: 413 [2022-11-02 20:41:33,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:33,670 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 397 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:33,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1031 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-02 20:41:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2022-11-02 20:41:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2857142857142858) internal successors, (459), 364 states have internal predecessors, (459), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (41), 29 states have call predecessors, (41), 29 states have call successors, (41) [2022-11-02 20:41:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 535 transitions. [2022-11-02 20:41:33,682 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 535 transitions. Word has length 46 [2022-11-02 20:41:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:33,682 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 535 transitions. [2022-11-02 20:41:33,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 535 transitions. [2022-11-02 20:41:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:41:33,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:33,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:33,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:41:33,684 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 351110669, now seen corresponding path program 1 times [2022-11-02 20:41:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:33,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341869752] [2022-11-02 20:41:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:41:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:33,800 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:41:33,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:33,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341869752] [2022-11-02 20:41:33,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341869752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:33,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:33,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444034233] [2022-11-02 20:41:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:33,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:33,803 INFO L87 Difference]: Start difference. First operand 407 states and 535 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:34,343 INFO L93 Difference]: Finished difference Result 422 states and 550 transitions. [2022-11-02 20:41:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:34,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-02 20:41:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:34,345 INFO L225 Difference]: With dead ends: 422 [2022-11-02 20:41:34,346 INFO L226 Difference]: Without dead ends: 409 [2022-11-02 20:41:34,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:34,347 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 74 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:34,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1931 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:41:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-02 20:41:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2022-11-02 20:41:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 354 states have (on average 1.2853107344632768) internal successors, (455), 361 states have internal predecessors, (455), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (40), 28 states have call predecessors, (40), 28 states have call successors, (40) [2022-11-02 20:41:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 529 transitions. [2022-11-02 20:41:34,364 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 529 transitions. Word has length 46 [2022-11-02 20:41:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:34,365 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 529 transitions. [2022-11-02 20:41:34,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 529 transitions. [2022-11-02 20:41:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:41:34,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:34,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:34,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:41:34,367 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2022690400, now seen corresponding path program 1 times [2022-11-02 20:41:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:34,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963203084] [2022-11-02 20:41:34,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:41:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:34,526 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:41:34,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:34,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963203084] [2022-11-02 20:41:34,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963203084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:34,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:34,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335687274] [2022-11-02 20:41:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:34,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:34,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:34,529 INFO L87 Difference]: Start difference. First operand 403 states and 529 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:35,226 INFO L93 Difference]: Finished difference Result 422 states and 549 transitions. [2022-11-02 20:41:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:35,226 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-11-02 20:41:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:35,228 INFO L225 Difference]: With dead ends: 422 [2022-11-02 20:41:35,229 INFO L226 Difference]: Without dead ends: 404 [2022-11-02 20:41:35,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:41:35,230 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 148 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:35,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1920 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:41:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-11-02 20:41:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 398. [2022-11-02 20:41:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 349 states have (on average 1.2836676217765044) internal successors, (448), 357 states have internal predecessors, (448), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (39), 27 states have call predecessors, (39), 28 states have call successors, (39) [2022-11-02 20:41:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 521 transitions. [2022-11-02 20:41:35,249 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 521 transitions. Word has length 47 [2022-11-02 20:41:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:35,250 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 521 transitions. [2022-11-02 20:41:35,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 521 transitions. [2022-11-02 20:41:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:41:35,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:35,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:35,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:41:35,252 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2034007966, now seen corresponding path program 1 times [2022-11-02 20:41:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:35,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288169008] [2022-11-02 20:41:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:35,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:35,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:35,340 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:41:35,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:35,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288169008] [2022-11-02 20:41:35,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288169008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:35,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:35,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031020608] [2022-11-02 20:41:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:35,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:35,343 INFO L87 Difference]: Start difference. First operand 398 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:35,838 INFO L93 Difference]: Finished difference Result 418 states and 542 transitions. [2022-11-02 20:41:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:35,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-02 20:41:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:35,841 INFO L225 Difference]: With dead ends: 418 [2022-11-02 20:41:35,841 INFO L226 Difference]: Without dead ends: 403 [2022-11-02 20:41:35,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:35,843 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 148 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:35,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1389 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-02 20:41:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 397. [2022-11-02 20:41:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 349 states have (on average 1.2808022922636104) internal successors, (447), 356 states have internal predecessors, (447), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (38), 27 states have call predecessors, (38), 27 states have call successors, (38) [2022-11-02 20:41:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 518 transitions. [2022-11-02 20:41:35,854 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 518 transitions. Word has length 48 [2022-11-02 20:41:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:35,855 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 518 transitions. [2022-11-02 20:41:35,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 518 transitions. [2022-11-02 20:41:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:41:35,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:35,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:35,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:41:35,857 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:35,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1900155685, now seen corresponding path program 1 times [2022-11-02 20:41:35,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:35,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009960304] [2022-11-02 20:41:35,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:35,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:35,950 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:41:35,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:35,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009960304] [2022-11-02 20:41:35,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009960304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:35,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:35,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:41:35,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868431865] [2022-11-02 20:41:35,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:35,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:35,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:35,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:35,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:41:35,952 INFO L87 Difference]: Start difference. First operand 397 states and 518 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:36,179 INFO L93 Difference]: Finished difference Result 482 states and 622 transitions. [2022-11-02 20:41:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:41:36,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-11-02 20:41:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:36,182 INFO L225 Difference]: With dead ends: 482 [2022-11-02 20:41:36,182 INFO L226 Difference]: Without dead ends: 482 [2022-11-02 20:41:36,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:36,183 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 188 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:36,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 859 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:36,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-02 20:41:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2022-11-02 20:41:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 397 states have (on average 1.279596977329975) internal successors, (508), 403 states have internal predecessors, (508), 35 states have call successors, (35), 16 states have call predecessors, (35), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2022-11-02 20:41:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 587 transitions. [2022-11-02 20:41:36,193 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 587 transitions. Word has length 49 [2022-11-02 20:41:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:36,194 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 587 transitions. [2022-11-02 20:41:36,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 587 transitions. [2022-11-02 20:41:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:41:36,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:36,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:36,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:41:36,196 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash 785908469, now seen corresponding path program 1 times [2022-11-02 20:41:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:36,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209474474] [2022-11-02 20:41:36,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:36,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:36,301 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:41:36,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:36,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209474474] [2022-11-02 20:41:36,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209474474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:36,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:36,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:36,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247665392] [2022-11-02 20:41:36,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:36,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:41:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:36,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:41:36,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:41:36,306 INFO L87 Difference]: Start difference. First operand 450 states and 587 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:36,530 INFO L93 Difference]: Finished difference Result 463 states and 603 transitions. [2022-11-02 20:41:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:41:36,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 20:41:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:36,532 INFO L225 Difference]: With dead ends: 463 [2022-11-02 20:41:36,533 INFO L226 Difference]: Without dead ends: 463 [2022-11-02 20:41:36,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:36,533 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 70 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:36,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1065 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-11-02 20:41:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 452. [2022-11-02 20:41:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.2781954887218046) internal successors, (510), 405 states have internal predecessors, (510), 35 states have call successors, (35), 16 states have call predecessors, (35), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2022-11-02 20:41:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 589 transitions. [2022-11-02 20:41:36,543 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 589 transitions. Word has length 48 [2022-11-02 20:41:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:36,544 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 589 transitions. [2022-11-02 20:41:36,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 589 transitions. [2022-11-02 20:41:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:41:36,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:36,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:36,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:41:36,546 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1427465013, now seen corresponding path program 1 times [2022-11-02 20:41:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70435609] [2022-11-02 20:41:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:36,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:36,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:36,714 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:41:36,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:36,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70435609] [2022-11-02 20:41:36,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70435609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:36,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:36,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081908348] [2022-11-02 20:41:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:36,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:36,718 INFO L87 Difference]: Start difference. First operand 452 states and 589 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:37,105 INFO L93 Difference]: Finished difference Result 451 states and 583 transitions. [2022-11-02 20:41:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 20:41:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:37,107 INFO L225 Difference]: With dead ends: 451 [2022-11-02 20:41:37,108 INFO L226 Difference]: Without dead ends: 451 [2022-11-02 20:41:37,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:37,108 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 81 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:37,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1815 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-11-02 20:41:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 440. [2022-11-02 20:41:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 388 states have (on average 1.2731958762886597) internal successors, (494), 393 states have internal predecessors, (494), 34 states have call successors, (34), 16 states have call predecessors, (34), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2022-11-02 20:41:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 572 transitions. [2022-11-02 20:41:37,119 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 572 transitions. Word has length 48 [2022-11-02 20:41:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:37,120 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 572 transitions. [2022-11-02 20:41:37,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 572 transitions. [2022-11-02 20:41:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:41:37,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:37,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:37,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:41:37,122 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 827652383, now seen corresponding path program 1 times [2022-11-02 20:41:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377999796] [2022-11-02 20:41:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:37,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:41:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:37,271 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:41:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:37,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377999796] [2022-11-02 20:41:37,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377999796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:37,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:37,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542169527] [2022-11-02 20:41:37,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:37,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:37,274 INFO L87 Difference]: Start difference. First operand 440 states and 572 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:37,637 INFO L93 Difference]: Finished difference Result 469 states and 607 transitions. [2022-11-02 20:41:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:37,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-11-02 20:41:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:37,640 INFO L225 Difference]: With dead ends: 469 [2022-11-02 20:41:37,640 INFO L226 Difference]: Without dead ends: 469 [2022-11-02 20:41:37,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:37,641 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 81 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:37,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1775 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-11-02 20:41:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 440. [2022-11-02 20:41:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 388 states have (on average 1.268041237113402) internal successors, (492), 393 states have internal predecessors, (492), 34 states have call successors, (34), 16 states have call predecessors, (34), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2022-11-02 20:41:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 570 transitions. [2022-11-02 20:41:37,654 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 570 transitions. Word has length 51 [2022-11-02 20:41:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:37,654 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 570 transitions. [2022-11-02 20:41:37,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 570 transitions. [2022-11-02 20:41:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:41:37,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:37,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:37,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:41:37,658 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash 141980076, now seen corresponding path program 1 times [2022-11-02 20:41:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:37,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945389286] [2022-11-02 20:41:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:37,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:41:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:37,781 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:41:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:37,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945389286] [2022-11-02 20:41:37,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945389286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:37,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:37,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415832107] [2022-11-02 20:41:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:37,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:37,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:37,784 INFO L87 Difference]: Start difference. First operand 440 states and 570 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:38,218 INFO L93 Difference]: Finished difference Result 458 states and 589 transitions. [2022-11-02 20:41:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-11-02 20:41:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:38,221 INFO L225 Difference]: With dead ends: 458 [2022-11-02 20:41:38,221 INFO L226 Difference]: Without dead ends: 442 [2022-11-02 20:41:38,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:38,222 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 82 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:38,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2040 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-02 20:41:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2022-11-02 20:41:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 385 states have (on average 1.2675324675324675) internal successors, (488), 390 states have internal predecessors, (488), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (43), 30 states have call predecessors, (43), 29 states have call successors, (43) [2022-11-02 20:41:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 564 transitions. [2022-11-02 20:41:38,232 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 564 transitions. Word has length 51 [2022-11-02 20:41:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:38,233 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 564 transitions. [2022-11-02 20:41:38,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 564 transitions. [2022-11-02 20:41:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:41:38,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:38,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:38,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:41:38,235 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash -646852178, now seen corresponding path program 1 times [2022-11-02 20:41:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:38,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901250262] [2022-11-02 20:41:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:38,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:41:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:38,348 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:41:38,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:38,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901250262] [2022-11-02 20:41:38,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901250262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:38,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:38,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967279177] [2022-11-02 20:41:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:38,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:38,351 INFO L87 Difference]: Start difference. First operand 436 states and 564 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:38,800 INFO L93 Difference]: Finished difference Result 454 states and 583 transitions. [2022-11-02 20:41:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:38,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-11-02 20:41:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:38,802 INFO L225 Difference]: With dead ends: 454 [2022-11-02 20:41:38,802 INFO L226 Difference]: Without dead ends: 437 [2022-11-02 20:41:38,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:38,803 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 82 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:38,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2066 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-02 20:41:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 431. [2022-11-02 20:41:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 381 states have (on average 1.2677165354330708) internal successors, (483), 386 states have internal predecessors, (483), 32 states have call successors, (32), 16 states have call predecessors, (32), 17 states have return successors, (42), 29 states have call predecessors, (42), 28 states have call successors, (42) [2022-11-02 20:41:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 557 transitions. [2022-11-02 20:41:38,814 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 557 transitions. Word has length 52 [2022-11-02 20:41:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:38,814 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 557 transitions. [2022-11-02 20:41:38,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 557 transitions. [2022-11-02 20:41:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:41:38,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:38,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:38,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:41:38,817 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -403973580, now seen corresponding path program 1 times [2022-11-02 20:41:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:38,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008249798] [2022-11-02 20:41:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:41:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:38,963 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:41:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:38,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008249798] [2022-11-02 20:41:38,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008249798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:38,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:38,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884034509] [2022-11-02 20:41:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:38,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:38,966 INFO L87 Difference]: Start difference. First operand 431 states and 557 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:39,422 INFO L93 Difference]: Finished difference Result 449 states and 576 transitions. [2022-11-02 20:41:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:39,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-11-02 20:41:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:39,424 INFO L225 Difference]: With dead ends: 449 [2022-11-02 20:41:39,425 INFO L226 Difference]: Without dead ends: 433 [2022-11-02 20:41:39,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:39,425 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 82 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:39,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1956 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-02 20:41:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2022-11-02 20:41:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 378 states have (on average 1.2671957671957672) internal successors, (479), 383 states have internal predecessors, (479), 31 states have call successors, (31), 16 states have call predecessors, (31), 17 states have return successors, (41), 28 states have call predecessors, (41), 27 states have call successors, (41) [2022-11-02 20:41:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 551 transitions. [2022-11-02 20:41:39,436 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 551 transitions. Word has length 52 [2022-11-02 20:41:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:39,436 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 551 transitions. [2022-11-02 20:41:39,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 551 transitions. [2022-11-02 20:41:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:41:39,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:39,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:39,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:41:39,439 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:39,439 INFO L85 PathProgramCache]: Analyzing trace with hash 515113277, now seen corresponding path program 1 times [2022-11-02 20:41:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:39,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112939359] [2022-11-02 20:41:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:39,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:41:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:39,548 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:41:39,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:39,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112939359] [2022-11-02 20:41:39,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112939359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:39,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:39,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061167703] [2022-11-02 20:41:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:39,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:39,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:39,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:39,553 INFO L87 Difference]: Start difference. First operand 427 states and 551 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:39,948 INFO L93 Difference]: Finished difference Result 441 states and 565 transitions. [2022-11-02 20:41:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:39,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-11-02 20:41:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:39,950 INFO L225 Difference]: With dead ends: 441 [2022-11-02 20:41:39,950 INFO L226 Difference]: Without dead ends: 424 [2022-11-02 20:41:39,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:39,951 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 72 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:39,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1778 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-11-02 20:41:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 418. [2022-11-02 20:41:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2648648648648648) internal successors, (468), 375 states have internal predecessors, (468), 30 states have call successors, (30), 16 states have call predecessors, (30), 17 states have return successors, (40), 27 states have call predecessors, (40), 26 states have call successors, (40) [2022-11-02 20:41:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 538 transitions. [2022-11-02 20:41:39,962 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 538 transitions. Word has length 52 [2022-11-02 20:41:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:39,964 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 538 transitions. [2022-11-02 20:41:39,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 538 transitions. [2022-11-02 20:41:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:41:39,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:39,967 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, 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:41:39,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:41:39,967 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1195477270, now seen corresponding path program 1 times [2022-11-02 20:41:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:39,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950658486] [2022-11-02 20:41:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:40,167 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:41:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950658486] [2022-11-02 20:41:40,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950658486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:40,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:40,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203312640] [2022-11-02 20:41:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:40,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:40,170 INFO L87 Difference]: Start difference. First operand 418 states and 538 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:40,535 INFO L93 Difference]: Finished difference Result 550 states and 725 transitions. [2022-11-02 20:41:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-11-02 20:41:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:40,538 INFO L225 Difference]: With dead ends: 550 [2022-11-02 20:41:40,538 INFO L226 Difference]: Without dead ends: 550 [2022-11-02 20:41:40,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:40,539 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 133 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:40,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1884 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-02 20:41:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 418. [2022-11-02 20:41:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2621621621621621) internal successors, (467), 375 states have internal predecessors, (467), 30 states have call successors, (30), 16 states have call predecessors, (30), 17 states have return successors, (40), 27 states have call predecessors, (40), 26 states have call successors, (40) [2022-11-02 20:41:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 537 transitions. [2022-11-02 20:41:40,552 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 537 transitions. Word has length 54 [2022-11-02 20:41:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:40,553 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 537 transitions. [2022-11-02 20:41:40,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 537 transitions. [2022-11-02 20:41:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:41:40,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:40,555 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, 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:41:40,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:41:40,555 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1153490444, now seen corresponding path program 1 times [2022-11-02 20:41:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:40,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785868099] [2022-11-02 20:41:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:40,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:41:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:40,700 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:41:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:40,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785868099] [2022-11-02 20:41:40,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785868099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:40,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:40,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:41:40,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886179986] [2022-11-02 20:41:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:40,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:41:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:40,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:41:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:40,703 INFO L87 Difference]: Start difference. First operand 418 states and 537 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:41,360 INFO L93 Difference]: Finished difference Result 434 states and 553 transitions. [2022-11-02 20:41:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:41:41,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-11-02 20:41:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:41,362 INFO L225 Difference]: With dead ends: 434 [2022-11-02 20:41:41,362 INFO L226 Difference]: Without dead ends: 390 [2022-11-02 20:41:41,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:41:41,363 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 137 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:41,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1798 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:41:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-02 20:41:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 382. [2022-11-02 20:41:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 338 states have (on average 1.257396449704142) internal successors, (425), 342 states have internal predecessors, (425), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (37), 25 states have call predecessors, (37), 24 states have call successors, (37) [2022-11-02 20:41:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 490 transitions. [2022-11-02 20:41:41,385 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 490 transitions. Word has length 56 [2022-11-02 20:41:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:41,385 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 490 transitions. [2022-11-02 20:41:41,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 490 transitions. [2022-11-02 20:41:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:41:41,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:41,387 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, 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:41:41,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:41:41,387 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1693203453, now seen corresponding path program 1 times [2022-11-02 20:41:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:41,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534838116] [2022-11-02 20:41:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:41,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:41:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:41,495 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:41:41,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:41,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534838116] [2022-11-02 20:41:41,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534838116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:41,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:41,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090298453] [2022-11-02 20:41:41,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:41,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:41,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:41,498 INFO L87 Difference]: Start difference. First operand 382 states and 490 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:41,918 INFO L93 Difference]: Finished difference Result 400 states and 509 transitions. [2022-11-02 20:41:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-11-02 20:41:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:41,920 INFO L225 Difference]: With dead ends: 400 [2022-11-02 20:41:41,920 INFO L226 Difference]: Without dead ends: 366 [2022-11-02 20:41:41,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:41:41,921 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 90 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:41,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1547 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-02 20:41:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 360. [2022-11-02 20:41:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.2570532915360502) internal successors, (401), 323 states have internal predecessors, (401), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (35), 23 states have call predecessors, (35), 22 states have call successors, (35) [2022-11-02 20:41:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 462 transitions. [2022-11-02 20:41:41,934 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 462 transitions. Word has length 56 [2022-11-02 20:41:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:41,934 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 462 transitions. [2022-11-02 20:41:41,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:41:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 462 transitions. [2022-11-02 20:41:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:41:41,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:41,936 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, 1, 1, 1, 1, 1, 1, 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:41:41,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:41:41,936 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:41,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:41,937 INFO L85 PathProgramCache]: Analyzing trace with hash 835021725, now seen corresponding path program 1 times [2022-11-02 20:41:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299346498] [2022-11-02 20:41:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:42,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:41:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:42,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:42,041 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:41:42,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:42,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299346498] [2022-11-02 20:41:42,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299346498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:42,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:42,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957012992] [2022-11-02 20:41:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:42,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:42,044 INFO L87 Difference]: Start difference. First operand 360 states and 462 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:42,308 INFO L93 Difference]: Finished difference Result 341 states and 429 transitions. [2022-11-02 20:41:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2022-11-02 20:41:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:42,310 INFO L225 Difference]: With dead ends: 341 [2022-11-02 20:41:42,311 INFO L226 Difference]: Without dead ends: 341 [2022-11-02 20:41:42,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:42,313 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 250 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:42,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 868 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-02 20:41:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 327. [2022-11-02 20:41:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 294 states have internal predecessors, (366), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-11-02 20:41:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 412 transitions. [2022-11-02 20:41:42,321 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 412 transitions. Word has length 62 [2022-11-02 20:41:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:42,321 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 412 transitions. [2022-11-02 20:41:42,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 412 transitions. [2022-11-02 20:41:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:41:42,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:42,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:42,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:41:42,323 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1659041663, now seen corresponding path program 1 times [2022-11-02 20:41:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:42,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297284994] [2022-11-02 20:41:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:41:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:42,485 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:41:42,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:42,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297284994] [2022-11-02 20:41:42,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297284994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:42,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:42,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:41:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305023789] [2022-11-02 20:41:42,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:42,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:41:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:41:42,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:42,488 INFO L87 Difference]: Start difference. First operand 327 states and 412 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:42,907 INFO L93 Difference]: Finished difference Result 371 states and 466 transitions. [2022-11-02 20:41:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:41:42,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2022-11-02 20:41:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:42,910 INFO L225 Difference]: With dead ends: 371 [2022-11-02 20:41:42,910 INFO L226 Difference]: Without dead ends: 355 [2022-11-02 20:41:42,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:41:42,910 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 353 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:42,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1308 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:42,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-02 20:41:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 335. [2022-11-02 20:41:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 298 states have (on average 1.2516778523489933) internal successors, (373), 301 states have internal predecessors, (373), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (26), 21 states have call predecessors, (26), 20 states have call successors, (26) [2022-11-02 20:41:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 422 transitions. [2022-11-02 20:41:42,928 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 422 transitions. Word has length 66 [2022-11-02 20:41:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:42,929 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 422 transitions. [2022-11-02 20:41:42,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 422 transitions. [2022-11-02 20:41:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:41:42,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:42,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:42,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:41:42,931 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1959206108, now seen corresponding path program 1 times [2022-11-02 20:41:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:42,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208931937] [2022-11-02 20:41:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:43,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:43,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:41:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:43,110 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:41:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208931937] [2022-11-02 20:41:43,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208931937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:43,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:43,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:41:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592668737] [2022-11-02 20:41:43,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:43,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:43,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:43,112 INFO L87 Difference]: Start difference. First operand 335 states and 422 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:43,650 INFO L93 Difference]: Finished difference Result 454 states and 552 transitions. [2022-11-02 20:41:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2022-11-02 20:41:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:43,653 INFO L225 Difference]: With dead ends: 454 [2022-11-02 20:41:43,653 INFO L226 Difference]: Without dead ends: 454 [2022-11-02 20:41:43,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:41:43,654 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 539 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:43,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1052 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-02 20:41:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 429. [2022-11-02 20:41:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 382 states have (on average 1.2408376963350785) internal successors, (474), 387 states have internal predecessors, (474), 25 states have call successors, (25), 19 states have call predecessors, (25), 21 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2022-11-02 20:41:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 527 transitions. [2022-11-02 20:41:43,665 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 527 transitions. Word has length 68 [2022-11-02 20:41:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:43,666 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 527 transitions. [2022-11-02 20:41:43,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 527 transitions. [2022-11-02 20:41:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:41:43,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:43,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:43,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 20:41:43,668 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash 377679953, now seen corresponding path program 1 times [2022-11-02 20:41:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:43,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145803764] [2022-11-02 20:41:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:43,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:41:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:41:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:43,951 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:41:43,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:43,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145803764] [2022-11-02 20:41:43,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145803764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:43,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:43,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:41:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245843533] [2022-11-02 20:41:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:43,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:41:43,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:43,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:41:43,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:43,954 INFO L87 Difference]: Start difference. First operand 429 states and 527 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:44,382 INFO L93 Difference]: Finished difference Result 459 states and 559 transitions. [2022-11-02 20:41:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:41:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2022-11-02 20:41:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:44,384 INFO L225 Difference]: With dead ends: 459 [2022-11-02 20:41:44,385 INFO L226 Difference]: Without dead ends: 443 [2022-11-02 20:41:44,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:41:44,386 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 152 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:44,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1563 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:41:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-02 20:41:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 421. [2022-11-02 20:41:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 375 states have (on average 1.2426666666666666) internal successors, (466), 380 states have internal predecessors, (466), 25 states have call successors, (25), 19 states have call predecessors, (25), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2022-11-02 20:41:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 517 transitions. [2022-11-02 20:41:44,396 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 517 transitions. Word has length 67 [2022-11-02 20:41:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:44,396 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 517 transitions. [2022-11-02 20:41:44,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 517 transitions. [2022-11-02 20:41:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 20:41:44,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:44,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:41:44,399 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2019693577, now seen corresponding path program 1 times [2022-11-02 20:41:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:44,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390916130] [2022-11-02 20:41:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:41:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:41:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:44,555 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:41:44,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:44,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390916130] [2022-11-02 20:41:44,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390916130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:44,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:44,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:41:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574086167] [2022-11-02 20:41:44,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:44,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:41:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:44,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:41:44,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:44,558 INFO L87 Difference]: Start difference. First operand 421 states and 517 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:41:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:45,239 INFO L93 Difference]: Finished difference Result 420 states and 515 transitions. [2022-11-02 20:41:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:41:45,240 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2022-11-02 20:41:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:45,241 INFO L225 Difference]: With dead ends: 420 [2022-11-02 20:41:45,242 INFO L226 Difference]: Without dead ends: 346 [2022-11-02 20:41:45,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:41:45,243 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 193 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:45,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1384 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:41:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-11-02 20:41:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-11-02 20:41:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 307 states have (on average 1.247557003257329) internal successors, (383), 311 states have internal predecessors, (383), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 20:41:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 427 transitions. [2022-11-02 20:41:45,252 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 427 transitions. Word has length 69 [2022-11-02 20:41:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:45,252 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 427 transitions. [2022-11-02 20:41:45,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:41:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 427 transitions. [2022-11-02 20:41:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 20:41:45,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:45,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:41:45,255 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:45,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2013543144, now seen corresponding path program 1 times [2022-11-02 20:41:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:45,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546685325] [2022-11-02 20:41:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:41:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,400 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:41:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:45,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546685325] [2022-11-02 20:41:45,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546685325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:45,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:45,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:45,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044378290] [2022-11-02 20:41:45,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:45,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:45,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:45,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:45,403 INFO L87 Difference]: Start difference. First operand 346 states and 427 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:45,629 INFO L93 Difference]: Finished difference Result 398 states and 491 transitions. [2022-11-02 20:41:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:41:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-11-02 20:41:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:45,631 INFO L225 Difference]: With dead ends: 398 [2022-11-02 20:41:45,631 INFO L226 Difference]: Without dead ends: 373 [2022-11-02 20:41:45,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:41:45,632 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 106 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:45,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1087 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-02 20:41:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 357. [2022-11-02 20:41:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.22397476340694) internal successors, (388), 322 states have internal predecessors, (388), 22 states have call successors, (22), 16 states have call predecessors, (22), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 20:41:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 433 transitions. [2022-11-02 20:41:45,640 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 433 transitions. Word has length 71 [2022-11-02 20:41:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:45,640 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 433 transitions. [2022-11-02 20:41:45,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 433 transitions. [2022-11-02 20:41:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:41:45,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:45,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:45,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:41:45,643 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -291513568, now seen corresponding path program 1 times [2022-11-02 20:41:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:45,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882480115] [2022-11-02 20:41:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:41:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:45,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882480115] [2022-11-02 20:41:45,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882480115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:45,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:45,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980218513] [2022-11-02 20:41:45,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:45,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:41:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:45,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:41:45,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:45,793 INFO L87 Difference]: Start difference. First operand 357 states and 433 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:41:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:45,985 INFO L93 Difference]: Finished difference Result 392 states and 476 transitions. [2022-11-02 20:41:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:45,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-11-02 20:41:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:45,988 INFO L225 Difference]: With dead ends: 392 [2022-11-02 20:41:45,988 INFO L226 Difference]: Without dead ends: 392 [2022-11-02 20:41:45,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:45,989 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 77 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:45,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1208 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-02 20:41:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 265. [2022-11-02 20:41:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.1794871794871795) internal successors, (276), 238 states have internal predecessors, (276), 16 states have call successors, (16), 12 states have call predecessors, (16), 14 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-02 20:41:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 311 transitions. [2022-11-02 20:41:45,997 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 311 transitions. Word has length 74 [2022-11-02 20:41:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:45,997 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 311 transitions. [2022-11-02 20:41:45,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:41:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 311 transitions. [2022-11-02 20:41:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:41:45,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:45,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:41:46,000 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:46,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1369005511, now seen corresponding path program 1 times [2022-11-02 20:41:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:46,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775657598] [2022-11-02 20:41:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:41:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:41:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,143 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:41:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:46,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775657598] [2022-11-02 20:41:46,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775657598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:46,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:46,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:46,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767729559] [2022-11-02 20:41:46,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:46,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:46,146 INFO L87 Difference]: Start difference. First operand 265 states and 311 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:46,518 INFO L93 Difference]: Finished difference Result 494 states and 579 transitions. [2022-11-02 20:41:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:41:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-11-02 20:41:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:46,520 INFO L225 Difference]: With dead ends: 494 [2022-11-02 20:41:46,520 INFO L226 Difference]: Without dead ends: 444 [2022-11-02 20:41:46,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:41:46,520 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 390 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:46,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1069 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-02 20:41:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 191. [2022-11-02 20:41:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 173 states have internal predecessors, (198), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:41:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2022-11-02 20:41:46,526 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 77 [2022-11-02 20:41:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:46,526 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2022-11-02 20:41:46,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2022-11-02 20:41:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:41:46,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:46,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:46,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:41:46,528 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 586260984, now seen corresponding path program 1 times [2022-11-02 20:41:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:46,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136321125] [2022-11-02 20:41:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:41:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,611 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:41:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:46,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136321125] [2022-11-02 20:41:46,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136321125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:46,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:46,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951411678] [2022-11-02 20:41:46,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:46,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:46,613 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:46,719 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2022-11-02 20:41:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2022-11-02 20:41:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:46,721 INFO L225 Difference]: With dead ends: 199 [2022-11-02 20:41:46,722 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:41:46,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:46,722 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:46,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 507 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:46,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:41:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2022-11-02 20:41:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.152046783625731) internal successors, (197), 173 states have internal predecessors, (197), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:41:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2022-11-02 20:41:46,727 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 83 [2022-11-02 20:41:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:46,727 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2022-11-02 20:41:46,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:41:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2022-11-02 20:41:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:41:46,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:46,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:46,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:41:46,730 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:46,730 INFO L85 PathProgramCache]: Analyzing trace with hash 727590310, now seen corresponding path program 1 times [2022-11-02 20:41:46,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:46,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174974498] [2022-11-02 20:41:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:46,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:41:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:41:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174974498] [2022-11-02 20:41:46,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174974498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:46,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:46,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:46,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039095677] [2022-11-02 20:41:46,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:46,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:46,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:46,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:46,847 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:46,990 INFO L93 Difference]: Finished difference Result 221 states and 250 transitions. [2022-11-02 20:41:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2022-11-02 20:41:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:46,992 INFO L225 Difference]: With dead ends: 221 [2022-11-02 20:41:46,992 INFO L226 Difference]: Without dead ends: 221 [2022-11-02 20:41:46,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:41:46,993 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 47 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:46,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 684 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-02 20:41:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2022-11-02 20:41:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 173 states have (on average 1.1502890173410405) internal successors, (199), 175 states have internal predecessors, (199), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:41:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2022-11-02 20:41:46,998 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 103 [2022-11-02 20:41:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:46,999 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2022-11-02 20:41:46,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2022-11-02 20:41:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:41:47,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:47,001 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:47,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:41:47,001 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1604320614, now seen corresponding path program 1 times [2022-11-02 20:41:47,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:47,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539010173] [2022-11-02 20:41:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:41:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:41:47,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539010173] [2022-11-02 20:41:47,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539010173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:47,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:47,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:41:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157951779] [2022-11-02 20:41:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:47,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:41:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:47,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:41:47,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:41:47,211 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:47,480 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2022-11-02 20:41:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:47,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2022-11-02 20:41:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:47,482 INFO L225 Difference]: With dead ends: 230 [2022-11-02 20:41:47,482 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:41:47,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:41:47,483 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 283 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:47,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 921 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:41:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2022-11-02 20:41:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 173 states have internal predecessors, (195), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:41:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions. [2022-11-02 20:41:47,487 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 103 [2022-11-02 20:41:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:47,487 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 214 transitions. [2022-11-02 20:41:47,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions. [2022-11-02 20:41:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:41:47,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:47,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:47,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:41:47,488 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash -247821256, now seen corresponding path program 1 times [2022-11-02 20:41:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:47,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097654451] [2022-11-02 20:41:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:41:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:41:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:47,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097654451] [2022-11-02 20:41:47,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097654451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:47,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:47,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:41:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218844474] [2022-11-02 20:41:47,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:47,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:41:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:41:47,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:41:47,787 INFO L87 Difference]: Start difference. First operand 191 states and 214 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:48,251 INFO L93 Difference]: Finished difference Result 296 states and 340 transitions. [2022-11-02 20:41:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:41:48,252 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 104 [2022-11-02 20:41:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:48,253 INFO L225 Difference]: With dead ends: 296 [2022-11-02 20:41:48,253 INFO L226 Difference]: Without dead ends: 265 [2022-11-02 20:41:48,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:41:48,254 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 487 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:48,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1347 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-02 20:41:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 206. [2022-11-02 20:41:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.145945945945946) internal successors, (212), 187 states have internal predecessors, (212), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-02 20:41:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 232 transitions. [2022-11-02 20:41:48,258 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 232 transitions. Word has length 104 [2022-11-02 20:41:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:48,259 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 232 transitions. [2022-11-02 20:41:48,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2022-11-02 20:41:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 20:41:48,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:48,260 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:48,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:41:48,261 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2004323598, now seen corresponding path program 1 times [2022-11-02 20:41:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:48,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453470229] [2022-11-02 20:41:48,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:48,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:41:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:41:48,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:48,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453470229] [2022-11-02 20:41:48,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453470229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:48,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:48,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:41:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823524312] [2022-11-02 20:41:48,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:48,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:41:48,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:48,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:41:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:41:48,568 INFO L87 Difference]: Start difference. First operand 206 states and 232 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 11 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:48,869 INFO L93 Difference]: Finished difference Result 223 states and 251 transitions. [2022-11-02 20:41:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:41:48,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 11 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 105 [2022-11-02 20:41:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:48,871 INFO L225 Difference]: With dead ends: 223 [2022-11-02 20:41:48,871 INFO L226 Difference]: Without dead ends: 220 [2022-11-02 20:41:48,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:41:48,872 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 30 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:48,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1674 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-02 20:41:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 206. [2022-11-02 20:41:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.1405405405405404) internal successors, (211), 187 states have internal predecessors, (211), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-02 20:41:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 231 transitions. [2022-11-02 20:41:48,876 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 231 transitions. Word has length 105 [2022-11-02 20:41:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:48,876 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 231 transitions. [2022-11-02 20:41:48,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 11 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 231 transitions. [2022-11-02 20:41:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 20:41:48,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:48,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:48,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:41:48,878 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:48,878 INFO L85 PathProgramCache]: Analyzing trace with hash -629299870, now seen corresponding path program 1 times [2022-11-02 20:41:48,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:48,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222844826] [2022-11-02 20:41:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:48,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:41:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:41:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:49,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222844826] [2022-11-02 20:41:49,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222844826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:49,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:49,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:41:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465291077] [2022-11-02 20:41:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:49,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:49,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:49,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:49,032 INFO L87 Difference]: Start difference. First operand 206 states and 231 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:49,124 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-11-02 20:41:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:49,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 108 [2022-11-02 20:41:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:49,125 INFO L225 Difference]: With dead ends: 207 [2022-11-02 20:41:49,126 INFO L226 Difference]: Without dead ends: 198 [2022-11-02 20:41:49,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:49,126 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 136 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:49,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 300 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-02 20:41:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 184. [2022-11-02 20:41:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.1219512195121952) internal successors, (184), 166 states have internal predecessors, (184), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 20:41:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2022-11-02 20:41:49,130 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 108 [2022-11-02 20:41:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:49,131 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2022-11-02 20:41:49,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2022-11-02 20:41:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:41:49,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:49,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:41:49,133 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash 809951383, now seen corresponding path program 1 times [2022-11-02 20:41:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:49,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862285451] [2022-11-02 20:41:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:41:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:41:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:41:49,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:49,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862285451] [2022-11-02 20:41:49,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862285451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:49,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:49,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121098664] [2022-11-02 20:41:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:49,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:49,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:49,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:49,361 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:41:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:49,494 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2022-11-02 20:41:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:41:49,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 114 [2022-11-02 20:41:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:49,496 INFO L225 Difference]: With dead ends: 173 [2022-11-02 20:41:49,496 INFO L226 Difference]: Without dead ends: 163 [2022-11-02 20:41:49,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:41:49,497 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 66 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:49,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 668 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-02 20:41:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-11-02 20:41:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.1095890410958904) internal successors, (162), 147 states have internal predecessors, (162), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-02 20:41:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2022-11-02 20:41:49,500 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 114 [2022-11-02 20:41:49,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:49,500 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2022-11-02 20:41:49,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:41:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2022-11-02 20:41:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:41:49,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:49,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 20:41:49,503 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1384297966, now seen corresponding path program 1 times [2022-11-02 20:41:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:49,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687917827] [2022-11-02 20:41:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:41:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:41:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:41:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687917827] [2022-11-02 20:41:49,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687917827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:49,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:49,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:41:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184966515] [2022-11-02 20:41:49,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:49,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:41:49,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:41:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:49,692 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:41:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:49,969 INFO L93 Difference]: Finished difference Result 284 states and 309 transitions. [2022-11-02 20:41:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:41:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2022-11-02 20:41:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:49,970 INFO L225 Difference]: With dead ends: 284 [2022-11-02 20:41:49,971 INFO L226 Difference]: Without dead ends: 163 [2022-11-02 20:41:49,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:41:49,971 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 130 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:49,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 808 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:41:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-02 20:41:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-11-02 20:41:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.1027397260273972) internal successors, (161), 147 states have internal predecessors, (161), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-02 20:41:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2022-11-02 20:41:49,974 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 115 [2022-11-02 20:41:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:49,975 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2022-11-02 20:41:49,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:41:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2022-11-02 20:41:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:41:49,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:49,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 20:41:49,979 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 20:41:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1263306388, now seen corresponding path program 1 times [2022-11-02 20:41:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:49,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807894892] [2022-11-02 20:41:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:41:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:41:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:41:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:41:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:41:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:50,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807894892] [2022-11-02 20:41:50,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807894892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:50,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:50,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:41:50,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505348067] [2022-11-02 20:41:50,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:50,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:41:50,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:50,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:41:50,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:41:50,258 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 10 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:41:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:50,672 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2022-11-02 20:41:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:41:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 10 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2022-11-02 20:41:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:50,673 INFO L225 Difference]: With dead ends: 173 [2022-11-02 20:41:50,674 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:41:50,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:41:50,674 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 398 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:50,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 676 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:41:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:41:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:41:50,675 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:41:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:41:50,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2022-11-02 20:41:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:50,675 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:41:50,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 10 states have internal predecessors, (94), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:41:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:41:50,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:41:50,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-11-02 20:41:50,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-11-02 20:41:50,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 20:41:50,688 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, 1, 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:41:50,691 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:41:50,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:41:50 BoogieIcfgContainer [2022-11-02 20:41:50,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:41:50,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:41:50,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:41:50,703 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:41:50,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:41:18" (3/4) ... [2022-11-02 20:41:50,706 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:41:50,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2022-11-02 20:41:50,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2022-11-02 20:41:50,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-11-02 20:41:50,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-02 20:41:50,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-02 20:41:50,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2022-11-02 20:41:50,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2022-11-02 20:41:50,739 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2022-11-02 20:41:50,740 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-02 20:41:50,742 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-02 20:41:50,744 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-02 20:41:50,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:41:50,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:41:50,885 INFO L158 Benchmark]: Toolchain (without parser) took 34343.13ms. Allocated memory was 96.5MB in the beginning and 247.5MB in the end (delta: 151.0MB). Free memory was 53.2MB in the beginning and 194.6MB in the end (delta: -141.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-11-02 20:41:50,885 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 71.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:41:50,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.14ms. Allocated memory is still 96.5MB. Free memory was 75.7MB in the beginning and 58.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:41:50,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.19ms. Allocated memory is still 96.5MB. Free memory was 58.3MB in the beginning and 51.7MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:41:50,886 INFO L158 Benchmark]: Boogie Preprocessor took 58.97ms. Allocated memory is still 96.5MB. Free memory was 51.7MB in the beginning and 47.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:41:50,886 INFO L158 Benchmark]: RCFGBuilder took 1523.38ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 47.5MB in the beginning and 64.4MB in the end (delta: -16.8MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-11-02 20:41:50,886 INFO L158 Benchmark]: TraceAbstraction took 31880.37ms. Allocated memory was 117.4MB in the beginning and 247.5MB in the end (delta: 130.0MB). Free memory was 63.7MB in the beginning and 213.5MB in the end (delta: -149.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:41:50,886 INFO L158 Benchmark]: Witness Printer took 182.19ms. Allocated memory is still 247.5MB. Free memory was 213.5MB in the beginning and 194.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 20:41:50,887 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.32ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 71.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 594.14ms. Allocated memory is still 96.5MB. Free memory was 75.7MB in the beginning and 58.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.19ms. Allocated memory is still 96.5MB. Free memory was 58.3MB in the beginning and 51.7MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.97ms. Allocated memory is still 96.5MB. Free memory was 51.7MB in the beginning and 47.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1523.38ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 47.5MB in the beginning and 64.4MB in the end (delta: -16.8MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31880.37ms. Allocated memory was 117.4MB in the beginning and 247.5MB in the end (delta: 130.0MB). Free memory was 63.7MB in the beginning and 213.5MB in the end (delta: -149.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 182.19ms. Allocated memory is still 247.5MB. Free memory was 213.5MB in the beginning and 194.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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: 1627]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 667]: 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 8 procedures, 319 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 63, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14259 SdHoareTripleChecker+Valid, 17.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13969 mSDsluCounter, 78801 SdHoareTripleChecker+Invalid, 14.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57343 mSDsCounter, 2391 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20005 IncrementalHoareTripleChecker+Invalid, 22396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2391 mSolverCounterUnsat, 21458 mSDtfsCounter, 20005 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 761 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=707occurred in iteration=21, InterpolantAutomatonStates: 473, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 63 MinimizatonAttempts, 1628 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 3270 NumberOfCodeBlocks, 3270 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3207 ConstructedInterpolants, 0 QuantifiedInterpolants, 7194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 63 InterpolantComputations, 63 PerfectInterpolantSequences, 140/140 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:41:50,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d67988f-f1b1-49e4-967b-09ba2df379a8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE