./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54165abed718b8d39f88748583b76365fb540324 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:09:07,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:09:07,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:09:07,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:09:07,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:09:07,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:09:07,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:09:07,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:09:07,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:09:07,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:09:07,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:09:07,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:09:07,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:09:07,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:09:07,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:09:07,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:09:07,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:09:07,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:09:07,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:09:07,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:09:07,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:09:07,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:09:07,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:09:07,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:09:07,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:09:07,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:09:07,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:09:07,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:09:07,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:09:07,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:09:07,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:09:07,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:09:07,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:09:07,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:09:07,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:09:07,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:09:07,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:09:07,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:09:07,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:09:07,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:09:07,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:09:07,526 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-10-13 01:09:07,571 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:09:07,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:09:07,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:09:07,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:09:07,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:09:07,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:09:07,574 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:09:07,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:09:07,574 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:09:07,575 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 01:09:07,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:09:07,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:09:07,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:09:07,577 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 01:09:07,577 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 01:09:07,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:09:07,577 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 01:09:07,578 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:09:07,578 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:09:07,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:09:07,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:09:07,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:09:07,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:09:07,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:09:07,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:09:07,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:09:07,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:09:07,580 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:09:07,581 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_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/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_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54165abed718b8d39f88748583b76365fb540324 [2021-10-13 01:09:07,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:09:07,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:09:07,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:09:07,900 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:09:07,906 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:09:07,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-10-13 01:09:07,989 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/data/fa5effa8e/d3b830339188495f93f3d47276587a06/FLAG744d8f678 [2021-10-13 01:09:08,517 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:09:08,518 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-10-13 01:09:08,542 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/data/fa5effa8e/d3b830339188495f93f3d47276587a06/FLAG744d8f678 [2021-10-13 01:09:08,844 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/data/fa5effa8e/d3b830339188495f93f3d47276587a06 [2021-10-13 01:09:08,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:09:08,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-13 01:09:08,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:09:08,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:09:08,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:09:08,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:09:08" (1/1) ... [2021-10-13 01:09:08,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162f7865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:08, skipping insertion in model container [2021-10-13 01:09:08,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:09:08" (1/1) ... [2021-10-13 01:09:08,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:09:08,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:09:09,245 WARN L228 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_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-10-13 01:09:09,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:09:09,309 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:09:09,338 WARN L228 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_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-10-13 01:09:09,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:09:09,387 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:09:09,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09 WrapperNode [2021-10-13 01:09:09,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:09:09,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:09:09,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:09:09,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:09:09,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (1/1) ... [2021-10-13 01:09:09,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (1/1) ... [2021-10-13 01:09:09,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (1/1) ... [2021-10-13 01:09:09,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (1/1) ... [2021-10-13 01:09:09,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (1/1) ... [2021-10-13 01:09:09,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (1/1) ... [2021-10-13 01:09:09,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (1/1) ... [2021-10-13 01:09:09,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:09:09,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:09:09,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:09:09,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:09:09,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (1/1) ... [2021-10-13 01:09:09,507 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:09:09,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:09:09,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:09:09,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:09:09,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-13 01:09:09,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:09:09,576 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-13 01:09:09,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-10-13 01:09:09,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-10-13 01:09:09,579 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-10-13 01:09:09,580 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-10-13 01:09:09,580 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2021-10-13 01:09:09,580 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2021-10-13 01:09:09,580 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2021-10-13 01:09:09,581 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2021-10-13 01:09:09,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-13 01:09:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-13 01:09:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-13 01:09:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-13 01:09:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-13 01:09:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-13 01:09:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:09:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-10-13 01:09:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-10-13 01:09:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-13 01:09:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-13 01:09:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-13 01:09:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-13 01:09:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-13 01:09:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-13 01:09:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-13 01:09:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-13 01:09:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-13 01:09:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-13 01:09:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-13 01:09:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-13 01:09:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-13 01:09:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-13 01:09:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-13 01:09:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-13 01:09:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-13 01:09:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-13 01:09:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-13 01:09:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-13 01:09:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-13 01:09:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-13 01:09:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-13 01:09:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-13 01:09:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-13 01:09:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-13 01:09:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-13 01:09:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-13 01:09:09,591 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-13 01:09:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-13 01:09:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-13 01:09:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-13 01:09:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-13 01:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-13 01:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-13 01:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-13 01:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-13 01:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-13 01:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-13 01:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-13 01:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-13 01:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-13 01:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-13 01:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-13 01:09:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-13 01:09:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-13 01:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-13 01:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-13 01:09:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-13 01:09:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-13 01:09:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-13 01:09:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-13 01:09:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-13 01:09:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-13 01:09:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-13 01:09:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-13 01:09:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-13 01:09:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-13 01:09:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-13 01:09:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-13 01:09:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-13 01:09:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-13 01:09:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-13 01:09:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-13 01:09:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-13 01:09:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-13 01:09:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-13 01:09:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-13 01:09:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-13 01:09:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-13 01:09:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-13 01:09:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-13 01:09:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-13 01:09:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-13 01:09:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-13 01:09:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-13 01:09:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-13 01:09:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-13 01:09:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-13 01:09:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-13 01:09:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-13 01:09:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-13 01:09:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-13 01:09:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-13 01:09:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-13 01:09:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-13 01:09:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-13 01:09:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-13 01:09:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-13 01:09:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-13 01:09:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-13 01:09:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-13 01:09:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-13 01:09:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-13 01:09:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-13 01:09:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-13 01:09:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-13 01:09:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-13 01:09:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-13 01:09:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-13 01:09:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-10-13 01:09:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-10-13 01:09:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 01:09:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 01:09:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2021-10-13 01:09:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 01:09:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 01:09:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2021-10-13 01:09:09,609 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2021-10-13 01:09:09,611 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2021-10-13 01:09:09,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-13 01:09:09,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 01:09:09,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 01:09:09,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-13 01:09:09,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:09:09,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:09:10,534 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:09:10,535 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-10-13 01:09:10,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:09:10 BoogieIcfgContainer [2021-10-13 01:09:10,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:09:10,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:09:10,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:09:10,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:09:10,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:09:08" (1/3) ... [2021-10-13 01:09:10,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ac0b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:09:10, skipping insertion in model container [2021-10-13 01:09:10,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:09:09" (2/3) ... [2021-10-13 01:09:10,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ac0b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:09:10, skipping insertion in model container [2021-10-13 01:09:10,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:09:10" (3/3) ... [2021-10-13 01:09:10,554 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-10-13 01:09:10,564 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:09:10,565 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2021-10-13 01:09:10,620 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:09:10,628 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 01:09:10,629 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2021-10-13 01:09:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 144 states have (on average 2.1527777777777777) internal successors, (310), 265 states have internal predecessors, (310), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2021-10-13 01:09:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 01:09:10,671 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:10,671 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:10,672 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr20ENSURES_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash -774541734, now seen corresponding path program 1 times [2021-10-13 01:09:10,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:10,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814391629] [2021-10-13 01:09:10,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:10,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:10,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:10,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:10,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814391629] [2021-10-13 01:09:10,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814391629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:10,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:10,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:09:10,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321765276] [2021-10-13 01:09:10,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:09:10,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:10,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:09:10,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:09:10,961 INFO L87 Difference]: Start difference. First operand has 279 states, 144 states have (on average 2.1527777777777777) internal successors, (310), 265 states have internal predecessors, (310), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 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) [2021-10-13 01:09:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:11,575 INFO L93 Difference]: Finished difference Result 320 states and 355 transitions. [2021-10-13 01:09:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:09:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 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 9 [2021-10-13 01:09:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:11,600 INFO L225 Difference]: With dead ends: 320 [2021-10-13 01:09:11,601 INFO L226 Difference]: Without dead ends: 315 [2021-10-13 01:09:11,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:09:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-10-13 01:09:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2021-10-13 01:09:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 145 states have (on average 1.896551724137931) internal successors, (275), 264 states have internal predecessors, (275), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2021-10-13 01:09:11,695 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2021-10-13 01:09:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:11,696 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2021-10-13 01:09:11,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 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) [2021-10-13 01:09:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2021-10-13 01:09:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 01:09:11,697 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:11,697 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:11,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:09:11,697 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:11,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1757963271, now seen corresponding path program 1 times [2021-10-13 01:09:11,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:11,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389788659] [2021-10-13 01:09:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:11,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:11,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:11,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389788659] [2021-10-13 01:09:11,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389788659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:11,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:11,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:09:11,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54472988] [2021-10-13 01:09:11,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:09:11,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:09:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:11,800 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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) [2021-10-13 01:09:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:12,430 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2021-10-13 01:09:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:09:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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 10 [2021-10-13 01:09:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:12,433 INFO L225 Difference]: With dead ends: 332 [2021-10-13 01:09:12,434 INFO L226 Difference]: Without dead ends: 332 [2021-10-13 01:09:12,434 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-10-13 01:09:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2021-10-13 01:09:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 145 states have (on average 1.8827586206896552) internal successors, (273), 262 states have internal predecessors, (273), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2021-10-13 01:09:12,453 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2021-10-13 01:09:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:12,453 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2021-10-13 01:09:12,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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) [2021-10-13 01:09:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2021-10-13 01:09:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 01:09:12,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:12,454 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:12,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:09:12,455 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1757963272, now seen corresponding path program 1 times [2021-10-13 01:09:12,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:12,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085288514] [2021-10-13 01:09:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:12,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:12,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:12,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085288514] [2021-10-13 01:09:12,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085288514] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:12,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:12,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:09:12,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034662995] [2021-10-13 01:09:12,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:09:12,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:12,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:09:12,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:12,534 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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) [2021-10-13 01:09:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:13,129 INFO L93 Difference]: Finished difference Result 342 states and 380 transitions. [2021-10-13 01:09:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:09:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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 10 [2021-10-13 01:09:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:13,132 INFO L225 Difference]: With dead ends: 342 [2021-10-13 01:09:13,132 INFO L226 Difference]: Without dead ends: 342 [2021-10-13 01:09:13,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-10-13 01:09:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 273. [2021-10-13 01:09:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 145 states have (on average 1.8689655172413793) internal successors, (271), 260 states have internal predecessors, (271), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2021-10-13 01:09:13,146 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2021-10-13 01:09:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:13,146 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2021-10-13 01:09:13,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 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) [2021-10-13 01:09:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2021-10-13 01:09:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 01:09:13,147 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:13,147 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:13,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:09:13,148 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:13,148 INFO L82 PathProgramCache]: Analyzing trace with hash 389021379, now seen corresponding path program 1 times [2021-10-13 01:09:13,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:13,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325833324] [2021-10-13 01:09:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:13,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:13,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:13,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325833324] [2021-10-13 01:09:13,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325833324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:13,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:13,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:09:13,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636464644] [2021-10-13 01:09:13,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:09:13,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:13,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:09:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:13,246 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:13,722 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2021-10-13 01:09:13,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:09:13,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-10-13 01:09:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:13,724 INFO L225 Difference]: With dead ends: 308 [2021-10-13 01:09:13,724 INFO L226 Difference]: Without dead ends: 307 [2021-10-13 01:09:13,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:09:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-10-13 01:09:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2021-10-13 01:09:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 144 states have (on average 1.8680555555555556) internal successors, (269), 259 states have internal predecessors, (269), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2021-10-13 01:09:13,735 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2021-10-13 01:09:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:13,735 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2021-10-13 01:09:13,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2021-10-13 01:09:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 01:09:13,736 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:13,736 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:13,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:09:13,737 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1684555217, now seen corresponding path program 1 times [2021-10-13 01:09:13,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:13,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490982668] [2021-10-13 01:09:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:13,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:13,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:13,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:13,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490982668] [2021-10-13 01:09:13,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490982668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:13,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:13,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:09:13,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622857116] [2021-10-13 01:09:13,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:09:13,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:13,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:09:13,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:13,809 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 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) [2021-10-13 01:09:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:14,308 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2021-10-13 01:09:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:09:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 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 15 [2021-10-13 01:09:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:14,311 INFO L225 Difference]: With dead ends: 314 [2021-10-13 01:09:14,311 INFO L226 Difference]: Without dead ends: 314 [2021-10-13 01:09:14,312 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-13 01:09:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2021-10-13 01:09:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.8541666666666667) internal successors, (267), 257 states have internal predecessors, (267), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2021-10-13 01:09:14,322 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2021-10-13 01:09:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:14,322 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2021-10-13 01:09:14,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 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) [2021-10-13 01:09:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2021-10-13 01:09:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 01:09:14,323 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:14,323 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:14,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:09:14,324 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1684555216, now seen corresponding path program 1 times [2021-10-13 01:09:14,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:14,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694789122] [2021-10-13 01:09:14,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:14,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:14,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:14,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694789122] [2021-10-13 01:09:14,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694789122] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:14,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:14,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:09:14,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128975907] [2021-10-13 01:09:14,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:09:14,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:09:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:14,401 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 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) [2021-10-13 01:09:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:14,892 INFO L93 Difference]: Finished difference Result 324 states and 356 transitions. [2021-10-13 01:09:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:09:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 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 15 [2021-10-13 01:09:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:14,895 INFO L225 Difference]: With dead ends: 324 [2021-10-13 01:09:14,895 INFO L226 Difference]: Without dead ends: 324 [2021-10-13 01:09:14,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:09:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-13 01:09:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 268. [2021-10-13 01:09:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 255 states have internal predecessors, (265), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2021-10-13 01:09:14,905 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2021-10-13 01:09:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:14,906 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2021-10-13 01:09:14,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 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) [2021-10-13 01:09:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2021-10-13 01:09:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 01:09:14,907 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:14,907 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:14,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 01:09:14,908 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr20ENSURES_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash 663488011, now seen corresponding path program 1 times [2021-10-13 01:09:14,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:14,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618342786] [2021-10-13 01:09:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:14,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:14,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:14,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618342786] [2021-10-13 01:09:14,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618342786] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:14,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:14,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:09:14,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354010317] [2021-10-13 01:09:14,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:09:14,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:14,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:09:14,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:09:14,978 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 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) [2021-10-13 01:09:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:15,511 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2021-10-13 01:09:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:09:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 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 21 [2021-10-13 01:09:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:15,514 INFO L225 Difference]: With dead ends: 327 [2021-10-13 01:09:15,514 INFO L226 Difference]: Without dead ends: 327 [2021-10-13 01:09:15,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:09:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-10-13 01:09:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2021-10-13 01:09:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8333333333333333) internal successors, (264), 255 states have internal predecessors, (264), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2021-10-13 01:09:15,525 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2021-10-13 01:09:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:15,525 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2021-10-13 01:09:15,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 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) [2021-10-13 01:09:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2021-10-13 01:09:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 01:09:15,526 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:15,527 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:15,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:09:15,527 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash -584553579, now seen corresponding path program 1 times [2021-10-13 01:09:15,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:15,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594167769] [2021-10-13 01:09:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:15,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:15,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:15,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594167769] [2021-10-13 01:09:15,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594167769] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:15,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:15,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:09:15,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060598438] [2021-10-13 01:09:15,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:09:15,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:09:15,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:09:15,621 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:16,401 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2021-10-13 01:09:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:09:16,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-13 01:09:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:16,404 INFO L225 Difference]: With dead ends: 382 [2021-10-13 01:09:16,404 INFO L226 Difference]: Without dead ends: 382 [2021-10-13 01:09:16,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.7ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:09:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-10-13 01:09:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2021-10-13 01:09:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 148 states have (on average 1.8243243243243243) internal successors, (270), 258 states have internal predecessors, (270), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2021-10-13 01:09:16,421 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2021-10-13 01:09:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:16,422 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2021-10-13 01:09:16,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2021-10-13 01:09:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 01:09:16,423 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:16,423 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:16,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:09:16,423 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting inspect_beforeErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash -584567887, now seen corresponding path program 1 times [2021-10-13 01:09:16,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:16,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284796803] [2021-10-13 01:09:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:16,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:16,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:16,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284796803] [2021-10-13 01:09:16,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284796803] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:16,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:16,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:09:16,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293899659] [2021-10-13 01:09:16,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:09:16,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:16,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:09:16,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:09:16,557 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) [2021-10-13 01:09:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:17,362 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2021-10-13 01:09:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:09:17,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 25 [2021-10-13 01:09:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:17,365 INFO L225 Difference]: With dead ends: 310 [2021-10-13 01:09:17,366 INFO L226 Difference]: Without dead ends: 310 [2021-10-13 01:09:17,366 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.6ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:09:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-13 01:09:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2021-10-13 01:09:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 149 states have (on average 1.7583892617449663) internal successors, (262), 249 states have internal predecessors, (262), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-13 01:09:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2021-10-13 01:09:17,383 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2021-10-13 01:09:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:17,388 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2021-10-13 01:09:17,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) [2021-10-13 01:09:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2021-10-13 01:09:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 01:09:17,394 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:17,394 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:09:17,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:09:17,394 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting inspect_beforeErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash -584567886, now seen corresponding path program 1 times [2021-10-13 01:09:17,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:17,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059846787] [2021-10-13 01:09:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:17,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:17,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:17,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:17,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059846787] [2021-10-13 01:09:17,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059846787] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:17,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:17,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:09:17,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839540363] [2021-10-13 01:09:17,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:09:17,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:09:17,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:09:17,490 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) [2021-10-13 01:09:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:18,378 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-10-13 01:09:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:09:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 25 [2021-10-13 01:09:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:18,381 INFO L225 Difference]: With dead ends: 381 [2021-10-13 01:09:18,382 INFO L226 Difference]: Without dead ends: 381 [2021-10-13 01:09:18,382 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.2ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:09:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-13 01:09:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 288. [2021-10-13 01:09:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 173 states have (on average 1.6878612716763006) internal successors, (292), 273 states have internal predecessors, (292), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2021-10-13 01:09:18,393 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2021-10-13 01:09:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:18,393 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2021-10-13 01:09:18,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) [2021-10-13 01:09:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2021-10-13 01:09:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 01:09:18,395 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:18,395 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:18,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:09:18,395 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1204412220, now seen corresponding path program 1 times [2021-10-13 01:09:18,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:18,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73303100] [2021-10-13 01:09:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:18,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 01:09:18,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:18,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73303100] [2021-10-13 01:09:18,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73303100] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:18,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:18,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:09:18,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300387667] [2021-10-13 01:09:18,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:09:18,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:18,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:09:18,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:09:18,513 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:19,084 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2021-10-13 01:09:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:09:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-10-13 01:09:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:19,087 INFO L225 Difference]: With dead ends: 307 [2021-10-13 01:09:19,087 INFO L226 Difference]: Without dead ends: 307 [2021-10-13 01:09:19,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 103.0ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:09:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-10-13 01:09:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2021-10-13 01:09:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 173 states have (on average 1.676300578034682) internal successors, (290), 272 states have internal predecessors, (290), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2021-10-13 01:09:19,097 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2021-10-13 01:09:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:19,098 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2021-10-13 01:09:19,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2021-10-13 01:09:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 01:09:19,099 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:19,099 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:19,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:09:19,100 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash 523995142, now seen corresponding path program 1 times [2021-10-13 01:09:19,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:19,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406154185] [2021-10-13 01:09:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:19,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 01:09:19,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:19,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406154185] [2021-10-13 01:09:19,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406154185] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:19,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:19,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:09:19,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790903633] [2021-10-13 01:09:19,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:09:19,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:19,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:09:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:09:19,192 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:19,793 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2021-10-13 01:09:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:09:19,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-10-13 01:09:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:19,796 INFO L225 Difference]: With dead ends: 306 [2021-10-13 01:09:19,796 INFO L226 Difference]: Without dead ends: 306 [2021-10-13 01:09:19,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.5ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:09:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-13 01:09:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2021-10-13 01:09:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.6647398843930636) internal successors, (288), 271 states have internal predecessors, (288), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2021-10-13 01:09:19,806 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2021-10-13 01:09:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:19,806 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2021-10-13 01:09:19,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2021-10-13 01:09:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 01:09:19,808 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:19,808 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:19,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:09:19,809 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash 173443807, now seen corresponding path program 1 times [2021-10-13 01:09:19,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:19,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813137146] [2021-10-13 01:09:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:19,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:19,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:19,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:19,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813137146] [2021-10-13 01:09:19,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813137146] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:19,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:19,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 01:09:19,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523408377] [2021-10-13 01:09:19,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:09:19,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:19,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:09:19,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:09:19,915 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:20,787 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2021-10-13 01:09:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:09:20,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-10-13 01:09:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:20,790 INFO L225 Difference]: With dead ends: 341 [2021-10-13 01:09:20,790 INFO L226 Difference]: Without dead ends: 341 [2021-10-13 01:09:20,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 115.3ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:09:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-13 01:09:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2021-10-13 01:09:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.6589595375722543) internal successors, (287), 271 states have internal predecessors, (287), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2021-10-13 01:09:20,801 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2021-10-13 01:09:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:20,801 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2021-10-13 01:09:20,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2021-10-13 01:09:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 01:09:20,803 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:20,803 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:20,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:09:20,803 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2042093490, now seen corresponding path program 1 times [2021-10-13 01:09:20,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:20,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941804082] [2021-10-13 01:09:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:20,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:20,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:20,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:20,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941804082] [2021-10-13 01:09:20,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941804082] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:20,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:20,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 01:09:20,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510384651] [2021-10-13 01:09:20,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:09:20,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:09:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:09:20,917 INFO L87 Difference]: Start difference. First operand 286 states and 314 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:21,818 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2021-10-13 01:09:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:09:21,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-10-13 01:09:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:21,822 INFO L225 Difference]: With dead ends: 340 [2021-10-13 01:09:21,822 INFO L226 Difference]: Without dead ends: 340 [2021-10-13 01:09:21,822 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 135.6ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:09:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-13 01:09:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-10-13 01:09:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.653179190751445) internal successors, (286), 271 states have internal predecessors, (286), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2021-10-13 01:09:21,835 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2021-10-13 01:09:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:21,835 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2021-10-13 01:09:21,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:09:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2021-10-13 01:09:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 01:09:21,840 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:21,840 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:21,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 01:09:21,841 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting inspect_beforeErr18REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:21,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1081480683, now seen corresponding path program 1 times [2021-10-13 01:09:21,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:21,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938337523] [2021-10-13 01:09:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:21,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:22,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:22,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938337523] [2021-10-13 01:09:22,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938337523] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:22,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:22,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 01:09:22,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977549594] [2021-10-13 01:09:22,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:09:22,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:22,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:09:22,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:09:22,026 INFO L87 Difference]: Start difference. First operand 286 states and 313 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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) [2021-10-13 01:09:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:23,117 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2021-10-13 01:09:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:09:23,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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 36 [2021-10-13 01:09:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:23,120 INFO L225 Difference]: With dead ends: 354 [2021-10-13 01:09:23,120 INFO L226 Difference]: Without dead ends: 354 [2021-10-13 01:09:23,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 235.7ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-13 01:09:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-13 01:09:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2021-10-13 01:09:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6551724137931034) internal successors, (288), 272 states have internal predecessors, (288), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2021-10-13 01:09:23,134 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2021-10-13 01:09:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:23,135 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2021-10-13 01:09:23,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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) [2021-10-13 01:09:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2021-10-13 01:09:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 01:09:23,136 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:23,136 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:23,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 01:09:23,136 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting inspect_beforeErr19REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1081480684, now seen corresponding path program 1 times [2021-10-13 01:09:23,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:23,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963818157] [2021-10-13 01:09:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:23,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:23,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:23,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:23,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963818157] [2021-10-13 01:09:23,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963818157] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:23,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:23,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:09:23,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669120066] [2021-10-13 01:09:23,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:09:23,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:23,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:09:23,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:09:23,365 INFO L87 Difference]: Start difference. First operand 287 states and 315 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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) [2021-10-13 01:09:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:24,343 INFO L93 Difference]: Finished difference Result 367 states and 402 transitions. [2021-10-13 01:09:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:09:24,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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 36 [2021-10-13 01:09:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:24,346 INFO L225 Difference]: With dead ends: 367 [2021-10-13 01:09:24,347 INFO L226 Difference]: Without dead ends: 367 [2021-10-13 01:09:24,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 160.6ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:09:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-10-13 01:09:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 287. [2021-10-13 01:09:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6494252873563218) internal successors, (287), 272 states have internal predecessors, (287), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2021-10-13 01:09:24,359 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2021-10-13 01:09:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:24,359 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2021-10-13 01:09:24,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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) [2021-10-13 01:09:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2021-10-13 01:09:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 01:09:24,361 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:24,361 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:24,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 01:09:24,361 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting inspect_beforeErr8REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1119996019, now seen corresponding path program 1 times [2021-10-13 01:09:24,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:24,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236172033] [2021-10-13 01:09:24,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:24,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:24,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:24,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:24,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236172033] [2021-10-13 01:09:24,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236172033] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:24,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:24,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 01:09:24,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852005316] [2021-10-13 01:09:24,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:09:24,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:09:24,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:09:24,575 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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) [2021-10-13 01:09:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:25,708 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2021-10-13 01:09:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:09:25,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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 36 [2021-10-13 01:09:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:25,711 INFO L225 Difference]: With dead ends: 352 [2021-10-13 01:09:25,711 INFO L226 Difference]: Without dead ends: 352 [2021-10-13 01:09:25,712 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 217.6ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-13 01:09:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-10-13 01:09:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2021-10-13 01:09:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 272 states have internal predecessors, (286), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2021-10-13 01:09:25,725 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2021-10-13 01:09:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:25,726 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2021-10-13 01:09:25,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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) [2021-10-13 01:09:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2021-10-13 01:09:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 01:09:25,726 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:25,727 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:25,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 01:09:25,727 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting inspect_beforeErr9REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1119996018, now seen corresponding path program 1 times [2021-10-13 01:09:25,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:25,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099642599] [2021-10-13 01:09:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:25,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:25,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:09:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:09:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:09:25,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:09:25,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099642599] [2021-10-13 01:09:25,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099642599] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:09:25,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:09:25,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:09:25,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658181125] [2021-10-13 01:09:25,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:09:25,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:09:25,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:09:25,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:09:25,918 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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) [2021-10-13 01:09:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:09:26,835 INFO L93 Difference]: Finished difference Result 365 states and 400 transitions. [2021-10-13 01:09:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:09:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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 36 [2021-10-13 01:09:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:09:26,838 INFO L225 Difference]: With dead ends: 365 [2021-10-13 01:09:26,838 INFO L226 Difference]: Without dead ends: 365 [2021-10-13 01:09:26,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 159.9ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:09:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-10-13 01:09:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2021-10-13 01:09:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6379310344827587) internal successors, (285), 272 states have internal predecessors, (285), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-13 01:09:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2021-10-13 01:09:26,849 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2021-10-13 01:09:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:09:26,850 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2021-10-13 01:09:26,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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) [2021-10-13 01:09:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2021-10-13 01:09:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 01:09:26,851 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:09:26,851 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 01:09:26,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 01:09:26,851 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-13 01:09:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:09:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1841504364, now seen corresponding path program 1 times [2021-10-13 01:09:26,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:09:26,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108699375] [2021-10-13 01:09:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:09:26,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:09:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:09:26,879 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:09:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:09:26,954 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:09:26,954 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 01:09:26,955 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 01:09:26,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr0REQUIRES_VIOLATION [2021-10-13 01:09:26,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr1REQUIRES_VIOLATION [2021-10-13 01:09:26,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr2REQUIRES_VIOLATION [2021-10-13 01:09:26,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr3REQUIRES_VIOLATION [2021-10-13 01:09:26,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr4REQUIRES_VIOLATION [2021-10-13 01:09:26,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr5REQUIRES_VIOLATION [2021-10-13 01:09:26,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr6REQUIRES_VIOLATION [2021-10-13 01:09:26,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr7REQUIRES_VIOLATION [2021-10-13 01:09:26,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr8REQUIRES_VIOLATION [2021-10-13 01:09:26,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr9REQUIRES_VIOLATION [2021-10-13 01:09:26,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr10REQUIRES_VIOLATION [2021-10-13 01:09:26,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr11REQUIRES_VIOLATION [2021-10-13 01:09:26,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr12REQUIRES_VIOLATION [2021-10-13 01:09:26,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr13REQUIRES_VIOLATION [2021-10-13 01:09:26,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr14REQUIRES_VIOLATION [2021-10-13 01:09:26,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr15REQUIRES_VIOLATION [2021-10-13 01:09:26,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr16REQUIRES_VIOLATION [2021-10-13 01:09:26,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr17REQUIRES_VIOLATION [2021-10-13 01:09:26,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr18REQUIRES_VIOLATION [2021-10-13 01:09:26,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr19REQUIRES_VIOLATION [2021-10-13 01:09:26,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr0REQUIRES_VIOLATION [2021-10-13 01:09:26,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr1REQUIRES_VIOLATION [2021-10-13 01:09:26,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr2REQUIRES_VIOLATION [2021-10-13 01:09:26,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr3REQUIRES_VIOLATION [2021-10-13 01:09:26,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr4REQUIRES_VIOLATION [2021-10-13 01:09:26,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr5REQUIRES_VIOLATION [2021-10-13 01:09:26,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr6REQUIRES_VIOLATION [2021-10-13 01:09:26,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr7REQUIRES_VIOLATION [2021-10-13 01:09:26,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr8REQUIRES_VIOLATION [2021-10-13 01:09:26,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr9REQUIRES_VIOLATION [2021-10-13 01:09:26,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr10REQUIRES_VIOLATION [2021-10-13 01:09:26,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr11REQUIRES_VIOLATION [2021-10-13 01:09:26,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION [2021-10-13 01:09:26,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION [2021-10-13 01:09:26,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION [2021-10-13 01:09:26,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION [2021-10-13 01:09:26,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION [2021-10-13 01:09:26,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION [2021-10-13 01:09:26,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION [2021-10-13 01:09:26,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION [2021-10-13 01:09:26,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION [2021-10-13 01:09:26,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION [2021-10-13 01:09:26,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION [2021-10-13 01:09:26,966 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION [2021-10-13 01:09:26,966 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION [2021-10-13 01:09:26,966 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION [2021-10-13 01:09:26,966 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr0REQUIRES_VIOLATION [2021-10-13 01:09:26,966 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr1REQUIRES_VIOLATION [2021-10-13 01:09:26,967 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr2REQUIRES_VIOLATION [2021-10-13 01:09:26,967 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr3REQUIRES_VIOLATION [2021-10-13 01:09:26,967 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr4REQUIRES_VIOLATION [2021-10-13 01:09:26,967 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr5REQUIRES_VIOLATION [2021-10-13 01:09:26,967 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr6REQUIRES_VIOLATION [2021-10-13 01:09:26,967 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr7REQUIRES_VIOLATION [2021-10-13 01:09:26,968 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr8REQUIRES_VIOLATION [2021-10-13 01:09:26,968 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr9REQUIRES_VIOLATION [2021-10-13 01:09:26,968 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr10REQUIRES_VIOLATION [2021-10-13 01:09:26,968 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr11REQUIRES_VIOLATION [2021-10-13 01:09:26,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr12REQUIRES_VIOLATION [2021-10-13 01:09:26,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr13REQUIRES_VIOLATION [2021-10-13 01:09:26,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr14REQUIRES_VIOLATION [2021-10-13 01:09:26,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr15REQUIRES_VIOLATION [2021-10-13 01:09:26,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr16REQUIRES_VIOLATION [2021-10-13 01:09:26,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr17REQUIRES_VIOLATION [2021-10-13 01:09:26,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr18REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr19REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr20REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr21REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-13 01:09:26,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-13 01:09:26,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ENSURES_VIOLATIONMEMORY_LEAK [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr0REQUIRES_VIOLATION [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr1REQUIRES_VIOLATION [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr2REQUIRES_VIOLATION [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr3REQUIRES_VIOLATION [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr4REQUIRES_VIOLATION [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr5REQUIRES_VIOLATION [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr6REQUIRES_VIOLATION [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr7REQUIRES_VIOLATION [2021-10-13 01:09:26,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr8REQUIRES_VIOLATION [2021-10-13 01:09:26,973 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr9REQUIRES_VIOLATION [2021-10-13 01:09:26,973 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr10REQUIRES_VIOLATION [2021-10-13 01:09:26,973 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr11REQUIRES_VIOLATION [2021-10-13 01:09:26,973 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,973 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,973 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 01:09:26,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 01:09:26,980 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:09:27,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:09:27 BoogieIcfgContainer [2021-10-13 01:09:27,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:09:27,014 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:09:27,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:09:27,014 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:09:27,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:09:10" (3/4) ... [2021-10-13 01:09:27,017 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 01:09:27,085 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:09:27,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:09:27,089 INFO L168 Benchmark]: Toolchain (without parser) took 18237.59 ms. Allocated memory was 102.8 MB in the beginning and 188.7 MB in the end (delta: 86.0 MB). Free memory was 65.3 MB in the beginning and 55.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 95.8 MB. Max. memory is 16.1 GB. [2021-10-13 01:09:27,090 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 102.8 MB. Free memory is still 83.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:09:27,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.54 ms. Allocated memory is still 102.8 MB. Free memory was 65.1 MB in the beginning and 71.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:09:27,091 INFO L168 Benchmark]: Boogie Preprocessor took 107.90 ms. Allocated memory is still 102.8 MB. Free memory was 71.6 MB in the beginning and 67.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:09:27,091 INFO L168 Benchmark]: RCFGBuilder took 1045.73 ms. Allocated memory is still 102.8 MB. Free memory was 67.8 MB in the beginning and 68.7 MB in the end (delta: -879.5 kB). Peak memory consumption was 34.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:09:27,092 INFO L168 Benchmark]: TraceAbstraction took 16468.33 ms. Allocated memory was 102.8 MB in the beginning and 188.7 MB in the end (delta: 86.0 MB). Free memory was 68.1 MB in the beginning and 58.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 97.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:09:27,093 INFO L168 Benchmark]: Witness Printer took 71.54 ms. Allocated memory is still 188.7 MB. Free memory was 58.2 MB in the beginning and 55.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:09:27,094 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.31 ms. Allocated memory is still 102.8 MB. Free memory is still 83.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 538.54 ms. Allocated memory is still 102.8 MB. Free memory was 65.1 MB in the beginning and 71.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 107.90 ms. Allocated memory is still 102.8 MB. Free memory was 71.6 MB in the beginning and 67.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1045.73 ms. Allocated memory is still 102.8 MB. Free memory was 67.8 MB in the beginning and 68.7 MB in the end (delta: -879.5 kB). Peak memory consumption was 34.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16468.33 ms. Allocated memory was 102.8 MB in the beginning and 188.7 MB in the end (delta: 86.0 MB). Free memory was 68.1 MB in the beginning and 58.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 97.5 MB. Max. memory is 16.1 GB. * Witness Printer took 71.54 ms. Allocated memory is still 188.7 MB. Free memory was 58.2 MB in the beginning and 55.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node VAL [data={0:0}, node={-1:0}] [L644] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, data={0:0}, node={-1:0}] [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node VAL [data={0:0}, item={-3:0}, node={-1:0}] [L649] item->next = data VAL [data={0:0}, item={-3:0}, node={-1:0}] [L650] data = item VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L654] CALL inspect_before(data) VAL [shape={-3:0}] [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L616] shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L623] EXPR shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L625] EXPR shape->slist->next VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 288 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 16359.3ms, OverallIterations: 19, TraceHistogramMax: 2, EmptinessCheckTime: 35.9ms, AutomataDifference: 13525.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3487 SDtfs, 5208 SDslu, 5333 SDs, 0 SdLazy, 16207 SolverSat, 644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9522.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1592.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 282.9ms AutomataMinimizationTime, 18 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 50.7ms SsaConstructionTime, 226.3ms SatisfiabilityAnalysisTime, 1767.6ms InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 2992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-13 01:09:27,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1635b7ee-4ea4-40cc-9086-edf8d6d9da82/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...