./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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU --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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:55:25,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:55:25,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:55:25,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:55:25,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:55:25,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:55:25,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:55:25,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:55:25,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:55:25,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:55:25,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:55:25,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:55:25,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:55:25,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:55:25,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:55:25,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:55:25,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:55:25,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:55:25,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:55:25,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:55:25,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:55:25,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:55:25,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:55:25,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:55:25,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:55:25,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:55:25,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:55:25,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:55:25,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:55:25,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:55:25,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:55:25,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:55:25,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:55:25,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:55:25,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:55:25,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:55:25,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:55:25,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:55:25,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:55:25,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:55:25,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:55:25,636 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-11-02 22:55:25,669 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:55:25,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:55:25,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:55:25,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:55:25,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:55:25,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:55:25,673 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:55:25,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:55:25,675 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:55:25,675 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-02 22:55:25,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:55:25,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:55:25,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:55:25,677 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-02 22:55:25,678 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-02 22:55:25,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:55:25,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-02 22:55:25,679 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:55:25,680 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:55:25,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:55:25,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:55:25,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:55:25,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:55:25,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:55:25,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:55:25,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:55:25,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:55:25,685 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:55:25,685 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_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/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_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2021-11-02 22:55:25,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:55:25,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:55:25,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:55:25,972 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:55:25,993 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:55:25,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-02 22:55:26,064 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/data/cef892d47/fb4df839136b46efa62367d607e82354/FLAG5489dbcb1 [2021-11-02 22:55:26,596 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:55:26,597 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-02 22:55:26,613 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/data/cef892d47/fb4df839136b46efa62367d607e82354/FLAG5489dbcb1 [2021-11-02 22:55:26,896 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/data/cef892d47/fb4df839136b46efa62367d607e82354 [2021-11-02 22:55:26,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:55:26,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-02 22:55:26,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:55:26,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:55:26,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:55:26,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:55:26" (1/1) ... [2021-11-02 22:55:26,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712fddbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:26, skipping insertion in model container [2021-11-02 22:55:26,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:55:26" (1/1) ... [2021-11-02 22:55:26,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:55:26,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:55:27,324 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_2e458b82-1369-4a0e-b016-cb439ace35f9/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-02 22:55:27,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:55:27,400 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:55:27,461 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_2e458b82-1369-4a0e-b016-cb439ace35f9/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-02 22:55:27,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:55:27,515 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:55:27,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27 WrapperNode [2021-11-02 22:55:27,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:55:27,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:55:27,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:55:27,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:55:27,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (1/1) ... [2021-11-02 22:55:27,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (1/1) ... [2021-11-02 22:55:27,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (1/1) ... [2021-11-02 22:55:27,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (1/1) ... [2021-11-02 22:55:27,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (1/1) ... [2021-11-02 22:55:27,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (1/1) ... [2021-11-02 22:55:27,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (1/1) ... [2021-11-02 22:55:27,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:55:27,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:55:27,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:55:27,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:55:27,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (1/1) ... [2021-11-02 22:55:27,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:55:27,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:55:27,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:55:27,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:55:27,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-02 22:55:27,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:55:27,690 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-02 22:55:27,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-11-02 22:55:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-11-02 22:55:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-11-02 22:55:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-11-02 22:55:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2021-11-02 22:55:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2021-11-02 22:55:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2021-11-02 22:55:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2021-11-02 22:55:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-02 22:55:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-02 22:55:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-02 22:55:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-02 22:55:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-02 22:55:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-02 22:55:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:55:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-11-02 22:55:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-11-02 22:55:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-02 22:55:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-02 22:55:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-02 22:55:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-02 22:55:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-02 22:55:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-02 22:55:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-02 22:55:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-02 22:55:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-02 22:55:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-02 22:55:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-02 22:55:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-02 22:55:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-02 22:55:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-02 22:55:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-02 22:55:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-02 22:55:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-02 22:55:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-02 22:55:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-02 22:55:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-02 22:55:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-02 22:55:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-02 22:55:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-02 22:55:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-02 22:55:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-02 22:55:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-02 22:55:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-02 22:55:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-02 22:55:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-02 22:55:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-02 22:55:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-02 22:55:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-02 22:55:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-02 22:55:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-02 22:55:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-02 22:55:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-02 22:55:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-02 22:55:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-02 22:55:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-02 22:55:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-02 22:55:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-02 22:55:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-02 22:55:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-02 22:55:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-02 22:55:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-02 22:55:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-02 22:55:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-02 22:55:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-02 22:55:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-02 22:55:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-02 22:55:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-02 22:55:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-02 22:55:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-02 22:55:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-02 22:55:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-02 22:55:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-02 22:55:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-02 22:55:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-02 22:55:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-02 22:55:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-02 22:55:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-02 22:55:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-02 22:55:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-02 22:55:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-02 22:55:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-02 22:55:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-02 22:55:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-02 22:55:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-02 22:55:27,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-02 22:55:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-02 22:55:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-02 22:55:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-02 22:55:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-02 22:55:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-02 22:55:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-02 22:55:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-02 22:55:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-02 22:55:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-02 22:55:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-02 22:55:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-02 22:55:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-02 22:55:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-02 22:55:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-02 22:55:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-02 22:55:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-02 22:55:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-02 22:55:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-02 22:55:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-02 22:55:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-02 22:55:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-02 22:55:27,712 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-02 22:55:27,712 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-02 22:55:27,712 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-02 22:55:27,712 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-02 22:55:27,712 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-02 22:55:27,713 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-02 22:55:27,713 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-02 22:55:27,713 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-02 22:55:27,713 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-02 22:55:27,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-02 22:55:27,713 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-11-02 22:55:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-11-02 22:55:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 22:55:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 22:55:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2021-11-02 22:55:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 22:55:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:55:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2021-11-02 22:55:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2021-11-02 22:55:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2021-11-02 22:55:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-02 22:55:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 22:55:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 22:55:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-02 22:55:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:55:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:55:28,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:55:28,771 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-11-02 22:55:28,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:55:28 BoogieIcfgContainer [2021-11-02 22:55:28,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:55:28,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:55:28,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:55:28,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:55:28,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:55:26" (1/3) ... [2021-11-02 22:55:28,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb50e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:55:28, skipping insertion in model container [2021-11-02 22:55:28,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:55:27" (2/3) ... [2021-11-02 22:55:28,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb50e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:55:28, skipping insertion in model container [2021-11-02 22:55:28,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:55:28" (3/3) ... [2021-11-02 22:55:28,790 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-11-02 22:55:28,798 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:55:28,798 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2021-11-02 22:55:28,888 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:55:28,900 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 22:55:28,900 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2021-11-02 22:55:28,951 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-11-02 22:55:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-02 22:55:28,958 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:28,959 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:55:28,960 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-11-02 22:55:28,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash -774541734, now seen corresponding path program 1 times [2021-11-02 22:55:28,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:28,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462635897] [2021-11-02 22:55:28,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:28,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:29,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:29,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462635897] [2021-11-02 22:55:29,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462635897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:29,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:29,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:55:29,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067862123] [2021-11-02 22:55:29,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:55:29,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:55:29,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:55:29,209 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-11-02 22:55:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:29,746 INFO L93 Difference]: Finished difference Result 320 states and 355 transitions. [2021-11-02 22:55:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:55:29,748 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-11-02 22:55:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:29,761 INFO L225 Difference]: With dead ends: 320 [2021-11-02 22:55:29,761 INFO L226 Difference]: Without dead ends: 315 [2021-11-02 22:55:29,763 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:55:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-02 22:55:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2021-11-02 22:55:29,817 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-11-02 22:55:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2021-11-02 22:55:29,822 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2021-11-02 22:55:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:29,823 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2021-11-02 22:55:29,823 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-11-02 22:55:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2021-11-02 22:55:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 22:55:29,824 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:29,824 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:55:29,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 22:55:29,825 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-02 22:55:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1757963271, now seen corresponding path program 1 times [2021-11-02 22:55:29,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:29,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478558445] [2021-11-02 22:55:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:29,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:29,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:29,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478558445] [2021-11-02 22:55:29,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478558445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:29,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:29,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:55:29,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253351495] [2021-11-02 22:55:29,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:55:29,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:55:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:29,980 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-11-02 22:55:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:30,647 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2021-11-02 22:55:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:55:30,647 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-11-02 22:55:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:30,650 INFO L225 Difference]: With dead ends: 332 [2021-11-02 22:55:30,650 INFO L226 Difference]: Without dead ends: 332 [2021-11-02 22:55:30,651 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-02 22:55:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2021-11-02 22:55:30,667 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-11-02 22:55:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2021-11-02 22:55:30,670 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2021-11-02 22:55:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:30,670 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2021-11-02 22:55:30,670 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-11-02 22:55:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2021-11-02 22:55:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 22:55:30,671 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:30,671 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:55:30,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 22:55:30,672 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-02 22:55:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1757963272, now seen corresponding path program 1 times [2021-11-02 22:55:30,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:30,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708917346] [2021-11-02 22:55:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:30,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:30,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:30,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708917346] [2021-11-02 22:55:30,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708917346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:30,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:30,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:55:30,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011408125] [2021-11-02 22:55:30,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:55:30,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:55:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:30,780 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-11-02 22:55:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:31,374 INFO L93 Difference]: Finished difference Result 342 states and 380 transitions. [2021-11-02 22:55:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:55:31,376 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-11-02 22:55:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:31,379 INFO L225 Difference]: With dead ends: 342 [2021-11-02 22:55:31,379 INFO L226 Difference]: Without dead ends: 342 [2021-11-02 22:55:31,380 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-11-02 22:55:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 273. [2021-11-02 22:55:31,402 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-11-02 22:55:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2021-11-02 22:55:31,408 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2021-11-02 22:55:31,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:31,409 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2021-11-02 22:55:31,409 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-11-02 22:55:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2021-11-02 22:55:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 22:55:31,410 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:31,410 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:55:31,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 22:55:31,411 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-11-02 22:55:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 389021379, now seen corresponding path program 1 times [2021-11-02 22:55:31,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:31,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543515624] [2021-11-02 22:55:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:31,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:31,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:31,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:31,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543515624] [2021-11-02 22:55:31,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543515624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:31,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:31,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:55:31,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440345508] [2021-11-02 22:55:31,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:55:31,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:31,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:55:31,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:31,525 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-11-02 22:55:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:32,012 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2021-11-02 22:55:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:55:32,013 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-11-02 22:55:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:32,015 INFO L225 Difference]: With dead ends: 308 [2021-11-02 22:55:32,016 INFO L226 Difference]: Without dead ends: 307 [2021-11-02 22:55:32,016 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:55:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-02 22:55:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2021-11-02 22:55:32,024 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-11-02 22:55:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2021-11-02 22:55:32,025 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2021-11-02 22:55:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:32,026 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2021-11-02 22:55:32,026 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-11-02 22:55:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2021-11-02 22:55:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 22:55:32,027 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:32,027 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:55:32,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 22:55:32,027 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-02 22:55:32,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1684555217, now seen corresponding path program 1 times [2021-11-02 22:55:32,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:32,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972166822] [2021-11-02 22:55:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:32,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:32,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:32,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972166822] [2021-11-02 22:55:32,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972166822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:32,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:32,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:55:32,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639903254] [2021-11-02 22:55:32,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:55:32,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:32,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:55:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:32,107 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-11-02 22:55:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:32,617 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2021-11-02 22:55:32,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:55:32,618 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-11-02 22:55:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:32,621 INFO L225 Difference]: With dead ends: 314 [2021-11-02 22:55:32,621 INFO L226 Difference]: Without dead ends: 314 [2021-11-02 22:55:32,621 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-11-02 22:55:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2021-11-02 22:55:32,637 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-11-02 22:55:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2021-11-02 22:55:32,639 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2021-11-02 22:55:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:32,639 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2021-11-02 22:55:32,640 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-11-02 22:55:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2021-11-02 22:55:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 22:55:32,640 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:32,640 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:55:32,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 22:55:32,641 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-02 22:55:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1684555216, now seen corresponding path program 1 times [2021-11-02 22:55:32,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:32,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974520692] [2021-11-02 22:55:32,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:32,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:32,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:32,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974520692] [2021-11-02 22:55:32,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974520692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:32,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:32,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:55:32,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288919115] [2021-11-02 22:55:32,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:55:32,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:32,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:55:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:32,759 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-11-02 22:55:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:33,296 INFO L93 Difference]: Finished difference Result 324 states and 356 transitions. [2021-11-02 22:55:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:55:33,296 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-11-02 22:55:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:33,299 INFO L225 Difference]: With dead ends: 324 [2021-11-02 22:55:33,299 INFO L226 Difference]: Without dead ends: 324 [2021-11-02 22:55:33,299 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:55:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-02 22:55:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 268. [2021-11-02 22:55:33,306 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-11-02 22:55:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2021-11-02 22:55:33,308 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2021-11-02 22:55:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:33,309 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2021-11-02 22:55:33,309 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-11-02 22:55:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2021-11-02 22:55:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-02 22:55:33,310 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:33,310 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:55:33,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 22:55:33,310 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-11-02 22:55:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash 663488011, now seen corresponding path program 1 times [2021-11-02 22:55:33,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:33,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149591558] [2021-11-02 22:55:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:33,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:33,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:33,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149591558] [2021-11-02 22:55:33,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149591558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:33,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:33,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:55:33,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102787035] [2021-11-02 22:55:33,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:55:33,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:33,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:55:33,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:55:33,386 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-11-02 22:55:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:33,992 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2021-11-02 22:55:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:55:33,993 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-11-02 22:55:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:33,996 INFO L225 Difference]: With dead ends: 327 [2021-11-02 22:55:33,996 INFO L226 Difference]: Without dead ends: 327 [2021-11-02 22:55:33,996 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:55:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-02 22:55:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2021-11-02 22:55:34,004 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-11-02 22:55:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2021-11-02 22:55:34,006 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2021-11-02 22:55:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:34,007 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2021-11-02 22:55:34,007 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-11-02 22:55:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2021-11-02 22:55:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-02 22:55:34,008 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:34,008 INFO L513 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-11-02 22:55:34,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 22:55:34,009 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-11-02 22:55:34,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:34,010 INFO L85 PathProgramCache]: Analyzing trace with hash -584553579, now seen corresponding path program 1 times [2021-11-02 22:55:34,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:34,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798705322] [2021-11-02 22:55:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:34,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:34,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:34,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798705322] [2021-11-02 22:55:34,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798705322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:34,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:34,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 22:55:34,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580776111] [2021-11-02 22:55:34,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:55:34,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:55:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:55:34,132 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-11-02 22:55:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:34,908 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2021-11-02 22:55:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:55:34,909 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-11-02 22:55:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:34,912 INFO L225 Difference]: With dead ends: 382 [2021-11-02 22:55:34,912 INFO L226 Difference]: Without dead ends: 382 [2021-11-02 22:55:34,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:55:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-11-02 22:55:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2021-11-02 22:55:34,920 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-11-02 22:55:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2021-11-02 22:55:34,923 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2021-11-02 22:55:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:34,923 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2021-11-02 22:55:34,924 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-11-02 22:55:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2021-11-02 22:55:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-02 22:55:34,924 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:34,925 INFO L513 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-11-02 22:55:34,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 22:55:34,925 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-11-02 22:55:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash -584567887, now seen corresponding path program 1 times [2021-11-02 22:55:34,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:34,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198487313] [2021-11-02 22:55:34,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:34,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:35,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:35,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198487313] [2021-11-02 22:55:35,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198487313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:35,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:35,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:55:35,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909216748] [2021-11-02 22:55:35,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:55:35,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:55:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:55:35,051 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-11-02 22:55:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:35,868 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2021-11-02 22:55:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:55:35,869 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-11-02 22:55:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:35,871 INFO L225 Difference]: With dead ends: 310 [2021-11-02 22:55:35,872 INFO L226 Difference]: Without dead ends: 310 [2021-11-02 22:55:35,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:55:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-02 22:55:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2021-11-02 22:55:35,885 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-11-02 22:55:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2021-11-02 22:55:35,886 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2021-11-02 22:55:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:35,887 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2021-11-02 22:55:35,887 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-11-02 22:55:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2021-11-02 22:55:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-02 22:55:35,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:35,888 INFO L513 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-11-02 22:55:35,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 22:55:35,888 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-11-02 22:55:35,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:35,891 INFO L85 PathProgramCache]: Analyzing trace with hash -584567886, now seen corresponding path program 1 times [2021-11-02 22:55:35,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:35,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375543000] [2021-11-02 22:55:35,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:35,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:36,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:36,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:36,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375543000] [2021-11-02 22:55:36,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375543000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:36,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:36,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:55:36,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201126462] [2021-11-02 22:55:36,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:55:36,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:36,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:55:36,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:55:36,015 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-11-02 22:55:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:36,929 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-11-02 22:55:36,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:55:36,930 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-11-02 22:55:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:36,932 INFO L225 Difference]: With dead ends: 381 [2021-11-02 22:55:36,933 INFO L226 Difference]: Without dead ends: 381 [2021-11-02 22:55:36,933 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:55:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-02 22:55:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 288. [2021-11-02 22:55:36,941 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-11-02 22:55:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2021-11-02 22:55:36,943 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2021-11-02 22:55:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:36,944 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2021-11-02 22:55:36,944 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-11-02 22:55:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2021-11-02 22:55:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 22:55:36,945 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:36,946 INFO L513 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-11-02 22:55:36,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 22:55:36,946 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-11-02 22:55:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1204412220, now seen corresponding path program 1 times [2021-11-02 22:55:36,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:36,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194049868] [2021-11-02 22:55:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:36,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:37,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 22:55:37,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:37,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194049868] [2021-11-02 22:55:37,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194049868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:37,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:37,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:55:37,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80563900] [2021-11-02 22:55:37,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:55:37,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:37,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:55:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:55:37,041 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-11-02 22:55:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:37,679 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2021-11-02 22:55:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:55:37,680 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-11-02 22:55:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:37,682 INFO L225 Difference]: With dead ends: 307 [2021-11-02 22:55:37,682 INFO L226 Difference]: Without dead ends: 307 [2021-11-02 22:55:37,683 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:55:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-02 22:55:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2021-11-02 22:55:37,690 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-11-02 22:55:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2021-11-02 22:55:37,692 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2021-11-02 22:55:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:37,693 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2021-11-02 22:55:37,693 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-11-02 22:55:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2021-11-02 22:55:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 22:55:37,694 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:37,694 INFO L513 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-11-02 22:55:37,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 22:55:37,695 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-11-02 22:55:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash 523995142, now seen corresponding path program 1 times [2021-11-02 22:55:37,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:37,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882182360] [2021-11-02 22:55:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:37,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-02 22:55:37,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:37,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882182360] [2021-11-02 22:55:37,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882182360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:37,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:37,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:55:37,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928435651] [2021-11-02 22:55:37,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:55:37,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:55:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:55:37,782 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-11-02 22:55:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:38,405 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2021-11-02 22:55:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:55:38,405 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-11-02 22:55:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:38,408 INFO L225 Difference]: With dead ends: 306 [2021-11-02 22:55:38,408 INFO L226 Difference]: Without dead ends: 306 [2021-11-02 22:55:38,409 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:55:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-02 22:55:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2021-11-02 22:55:38,416 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-11-02 22:55:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2021-11-02 22:55:38,418 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2021-11-02 22:55:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:38,419 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2021-11-02 22:55:38,419 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-11-02 22:55:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2021-11-02 22:55:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-02 22:55:38,420 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:38,421 INFO L513 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-11-02 22:55:38,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 22:55:38,421 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-11-02 22:55:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash 173443807, now seen corresponding path program 1 times [2021-11-02 22:55:38,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:38,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362251186] [2021-11-02 22:55:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:38,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:38,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:38,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362251186] [2021-11-02 22:55:38,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362251186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:38,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:38,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 22:55:38,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490218490] [2021-11-02 22:55:38,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:55:38,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:38,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:55:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:55:38,544 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-11-02 22:55:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:39,476 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2021-11-02 22:55:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:55:39,477 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-11-02 22:55:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:39,479 INFO L225 Difference]: With dead ends: 341 [2021-11-02 22:55:39,479 INFO L226 Difference]: Without dead ends: 341 [2021-11-02 22:55:39,479 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:55:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-02 22:55:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2021-11-02 22:55:39,489 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-11-02 22:55:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2021-11-02 22:55:39,492 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2021-11-02 22:55:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:39,492 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2021-11-02 22:55:39,493 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-11-02 22:55:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2021-11-02 22:55:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-02 22:55:39,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:39,496 INFO L513 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-11-02 22:55:39,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 22:55:39,496 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-11-02 22:55:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2042093490, now seen corresponding path program 1 times [2021-11-02 22:55:39,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:39,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229518559] [2021-11-02 22:55:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:39,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:39,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:39,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229518559] [2021-11-02 22:55:39,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229518559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:39,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:39,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 22:55:39,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361422454] [2021-11-02 22:55:39,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:55:39,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:55:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:55:39,614 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-11-02 22:55:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:40,553 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2021-11-02 22:55:40,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:55:40,554 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-11-02 22:55:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:40,556 INFO L225 Difference]: With dead ends: 340 [2021-11-02 22:55:40,556 INFO L226 Difference]: Without dead ends: 340 [2021-11-02 22:55:40,556 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:55:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-02 22:55:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-11-02 22:55:40,563 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-11-02 22:55:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2021-11-02 22:55:40,565 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2021-11-02 22:55:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:40,565 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2021-11-02 22:55:40,566 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-11-02 22:55:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2021-11-02 22:55:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 22:55:40,566 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:40,567 INFO L513 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-11-02 22:55:40,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 22:55:40,567 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-11-02 22:55:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1081480683, now seen corresponding path program 1 times [2021-11-02 22:55:40,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:40,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351189995] [2021-11-02 22:55:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:40,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:40,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:40,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:40,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351189995] [2021-11-02 22:55:40,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351189995] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:40,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:40,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:55:40,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186817306] [2021-11-02 22:55:40,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 22:55:40,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:55:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:55:40,724 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-11-02 22:55:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:41,856 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2021-11-02 22:55:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:55:41,857 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-11-02 22:55:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:41,860 INFO L225 Difference]: With dead ends: 354 [2021-11-02 22:55:41,860 INFO L226 Difference]: Without dead ends: 354 [2021-11-02 22:55:41,860 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-11-02 22:55:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-02 22:55:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2021-11-02 22:55:41,874 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-11-02 22:55:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2021-11-02 22:55:41,876 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2021-11-02 22:55:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:41,877 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2021-11-02 22:55:41,878 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-11-02 22:55:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2021-11-02 22:55:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 22:55:41,879 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:41,879 INFO L513 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-11-02 22:55:41,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 22:55:41,880 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-11-02 22:55:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1081480684, now seen corresponding path program 1 times [2021-11-02 22:55:41,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:41,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937991990] [2021-11-02 22:55:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:41,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:42,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:42,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937991990] [2021-11-02 22:55:42,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937991990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:42,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:42,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:55:42,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641197893] [2021-11-02 22:55:42,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:55:42,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:42,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:55:42,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:55:42,066 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-11-02 22:55:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:43,108 INFO L93 Difference]: Finished difference Result 367 states and 402 transitions. [2021-11-02 22:55:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:55:43,109 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-11-02 22:55:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:43,111 INFO L225 Difference]: With dead ends: 367 [2021-11-02 22:55:43,111 INFO L226 Difference]: Without dead ends: 367 [2021-11-02 22:55:43,112 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:55:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-02 22:55:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 287. [2021-11-02 22:55:43,119 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-11-02 22:55:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2021-11-02 22:55:43,121 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2021-11-02 22:55:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:43,122 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2021-11-02 22:55:43,122 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-11-02 22:55:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2021-11-02 22:55:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 22:55:43,123 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:43,123 INFO L513 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-11-02 22:55:43,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 22:55:43,123 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-11-02 22:55:43,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1119996019, now seen corresponding path program 1 times [2021-11-02 22:55:43,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:43,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140569666] [2021-11-02 22:55:43,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:43,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:43,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:43,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140569666] [2021-11-02 22:55:43,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140569666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:43,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:43,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:55:43,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121698079] [2021-11-02 22:55:43,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 22:55:43,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:55:43,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:55:43,267 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-11-02 22:55:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:44,451 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2021-11-02 22:55:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:55:44,452 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-11-02 22:55:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:44,454 INFO L225 Difference]: With dead ends: 352 [2021-11-02 22:55:44,455 INFO L226 Difference]: Without dead ends: 352 [2021-11-02 22:55:44,455 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-11-02 22:55:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-11-02 22:55:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2021-11-02 22:55:44,463 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-11-02 22:55:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2021-11-02 22:55:44,465 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2021-11-02 22:55:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:44,466 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2021-11-02 22:55:44,466 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-11-02 22:55:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2021-11-02 22:55:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 22:55:44,466 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:44,467 INFO L513 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-11-02 22:55:44,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 22:55:44,467 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-11-02 22:55:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1119996018, now seen corresponding path program 1 times [2021-11-02 22:55:44,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:44,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569729686] [2021-11-02 22:55:44,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:44,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:55:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:55:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:55:44,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:55:44,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569729686] [2021-11-02 22:55:44,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569729686] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:55:44,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:55:44,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:55:44,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009368880] [2021-11-02 22:55:44,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:55:44,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:55:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:55:44,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:55:44,615 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-11-02 22:55:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:55:45,659 INFO L93 Difference]: Finished difference Result 365 states and 400 transitions. [2021-11-02 22:55:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:55:45,659 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-11-02 22:55:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:55:45,661 INFO L225 Difference]: With dead ends: 365 [2021-11-02 22:55:45,661 INFO L226 Difference]: Without dead ends: 365 [2021-11-02 22:55:45,662 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:55:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-02 22:55:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2021-11-02 22:55:45,670 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-11-02 22:55:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2021-11-02 22:55:45,671 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2021-11-02 22:55:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:55:45,672 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2021-11-02 22:55:45,672 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-11-02 22:55:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2021-11-02 22:55:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 22:55:45,673 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:55:45,673 INFO L513 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-11-02 22:55:45,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 22:55:45,674 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-11-02 22:55:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:55:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1841504364, now seen corresponding path program 1 times [2021-11-02 22:55:45,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:55:45,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301380366] [2021-11-02 22:55:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:55:45,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:55:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:55:45,691 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:55:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:55:45,735 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:55:45,735 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:55:45,736 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:55:45,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr0REQUIRES_VIOLATION [2021-11-02 22:55:45,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr1REQUIRES_VIOLATION [2021-11-02 22:55:45,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr2REQUIRES_VIOLATION [2021-11-02 22:55:45,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr3REQUIRES_VIOLATION [2021-11-02 22:55:45,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr4REQUIRES_VIOLATION [2021-11-02 22:55:45,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr5REQUIRES_VIOLATION [2021-11-02 22:55:45,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr6REQUIRES_VIOLATION [2021-11-02 22:55:45,739 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr7REQUIRES_VIOLATION [2021-11-02 22:55:45,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr8REQUIRES_VIOLATION [2021-11-02 22:55:45,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr9REQUIRES_VIOLATION [2021-11-02 22:55:45,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr10REQUIRES_VIOLATION [2021-11-02 22:55:45,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr11REQUIRES_VIOLATION [2021-11-02 22:55:45,740 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr12REQUIRES_VIOLATION [2021-11-02 22:55:45,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr13REQUIRES_VIOLATION [2021-11-02 22:55:45,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr14REQUIRES_VIOLATION [2021-11-02 22:55:45,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr15REQUIRES_VIOLATION [2021-11-02 22:55:45,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr16REQUIRES_VIOLATION [2021-11-02 22:55:45,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr17REQUIRES_VIOLATION [2021-11-02 22:55:45,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr18REQUIRES_VIOLATION [2021-11-02 22:55:45,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr19REQUIRES_VIOLATION [2021-11-02 22:55:45,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr0REQUIRES_VIOLATION [2021-11-02 22:55:45,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr1REQUIRES_VIOLATION [2021-11-02 22:55:45,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr2REQUIRES_VIOLATION [2021-11-02 22:55:45,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr3REQUIRES_VIOLATION [2021-11-02 22:55:45,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr4REQUIRES_VIOLATION [2021-11-02 22:55:45,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr5REQUIRES_VIOLATION [2021-11-02 22:55:45,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr6REQUIRES_VIOLATION [2021-11-02 22:55:45,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr7REQUIRES_VIOLATION [2021-11-02 22:55:45,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr8REQUIRES_VIOLATION [2021-11-02 22:55:45,743 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr9REQUIRES_VIOLATION [2021-11-02 22:55:45,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr10REQUIRES_VIOLATION [2021-11-02 22:55:45,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr11REQUIRES_VIOLATION [2021-11-02 22:55:45,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION [2021-11-02 22:55:45,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION [2021-11-02 22:55:45,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION [2021-11-02 22:55:45,744 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION [2021-11-02 22:55:45,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION [2021-11-02 22:55:45,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION [2021-11-02 22:55:45,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION [2021-11-02 22:55:45,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION [2021-11-02 22:55:45,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION [2021-11-02 22:55:45,745 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION [2021-11-02 22:55:45,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION [2021-11-02 22:55:45,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION [2021-11-02 22:55:45,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION [2021-11-02 22:55:45,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION [2021-11-02 22:55:45,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr0REQUIRES_VIOLATION [2021-11-02 22:55:45,746 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr1REQUIRES_VIOLATION [2021-11-02 22:55:45,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr2REQUIRES_VIOLATION [2021-11-02 22:55:45,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr3REQUIRES_VIOLATION [2021-11-02 22:55:45,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr4REQUIRES_VIOLATION [2021-11-02 22:55:45,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr5REQUIRES_VIOLATION [2021-11-02 22:55:45,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr6REQUIRES_VIOLATION [2021-11-02 22:55:45,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr7REQUIRES_VIOLATION [2021-11-02 22:55:45,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr8REQUIRES_VIOLATION [2021-11-02 22:55:45,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr9REQUIRES_VIOLATION [2021-11-02 22:55:45,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr10REQUIRES_VIOLATION [2021-11-02 22:55:45,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr11REQUIRES_VIOLATION [2021-11-02 22:55:45,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr12REQUIRES_VIOLATION [2021-11-02 22:55:45,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr13REQUIRES_VIOLATION [2021-11-02 22:55:45,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr14REQUIRES_VIOLATION [2021-11-02 22:55:45,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr15REQUIRES_VIOLATION [2021-11-02 22:55:45,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr16REQUIRES_VIOLATION [2021-11-02 22:55:45,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr17REQUIRES_VIOLATION [2021-11-02 22:55:45,749 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr18REQUIRES_VIOLATION [2021-11-02 22:55:45,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr19REQUIRES_VIOLATION [2021-11-02 22:55:45,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr20REQUIRES_VIOLATION [2021-11-02 22:55:45,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr21REQUIRES_VIOLATION [2021-11-02 22:55:45,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-11-02 22:55:45,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-11-02 22:55:45,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-11-02 22:55:45,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-11-02 22:55:45,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-11-02 22:55:45,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-11-02 22:55:45,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-11-02 22:55:45,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-11-02 22:55:45,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-11-02 22:55:45,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-11-02 22:55:45,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-11-02 22:55:45,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-11-02 22:55:45,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,752 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-11-02 22:55:45,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-11-02 22:55:45,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,753 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ENSURES_VIOLATIONMEMORY_LEAK [2021-11-02 22:55:45,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr0REQUIRES_VIOLATION [2021-11-02 22:55:45,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr1REQUIRES_VIOLATION [2021-11-02 22:55:45,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr2REQUIRES_VIOLATION [2021-11-02 22:55:45,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr3REQUIRES_VIOLATION [2021-11-02 22:55:45,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr4REQUIRES_VIOLATION [2021-11-02 22:55:45,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr5REQUIRES_VIOLATION [2021-11-02 22:55:45,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr6REQUIRES_VIOLATION [2021-11-02 22:55:45,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr7REQUIRES_VIOLATION [2021-11-02 22:55:45,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr8REQUIRES_VIOLATION [2021-11-02 22:55:45,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr9REQUIRES_VIOLATION [2021-11-02 22:55:45,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr10REQUIRES_VIOLATION [2021-11-02 22:55:45,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr11REQUIRES_VIOLATION [2021-11-02 22:55:45,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:55:45,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 22:55:45,760 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:55:45,764 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:55:45,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:55:45 BoogieIcfgContainer [2021-11-02 22:55:45,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:55:45,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:55:45,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:55:45,795 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:55:45,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:55:28" (3/4) ... [2021-11-02 22:55:45,797 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-02 22:55:45,839 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 22:55:45,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:55:45,841 INFO L168 Benchmark]: Toolchain (without parser) took 18940.02 ms. Allocated memory was 98.6 MB in the beginning and 159.4 MB in the end (delta: 60.8 MB). Free memory was 63.1 MB in the beginning and 56.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 67.9 MB. Max. memory is 16.1 GB. [2021-11-02 22:55:45,841 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 98.6 MB. Free memory was 72.3 MB in the beginning and 72.3 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:55:45,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.53 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 62.8 MB in the beginning and 91.3 MB in the end (delta: -28.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:55:45,842 INFO L168 Benchmark]: Boogie Preprocessor took 91.75 ms. Allocated memory is still 123.7 MB. Free memory was 91.3 MB in the beginning and 87.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-02 22:55:45,843 INFO L168 Benchmark]: RCFGBuilder took 1167.01 ms. Allocated memory is still 123.7 MB. Free memory was 87.1 MB in the beginning and 48.8 MB in the end (delta: 38.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2021-11-02 22:55:45,843 INFO L168 Benchmark]: TraceAbstraction took 17016.29 ms. Allocated memory was 123.7 MB in the beginning and 159.4 MB in the end (delta: 35.7 MB). Free memory was 48.8 MB in the beginning and 58.1 MB in the end (delta: -9.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB. [2021-11-02 22:55:45,844 INFO L168 Benchmark]: Witness Printer took 44.61 ms. Allocated memory is still 159.4 MB. Free memory was 58.1 MB in the beginning and 56.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:55:45,846 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.35 ms. Allocated memory is still 98.6 MB. Free memory was 72.3 MB in the beginning and 72.3 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 614.53 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 62.8 MB in the beginning and 91.3 MB in the end (delta: -28.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.75 ms. Allocated memory is still 123.7 MB. Free memory was 91.3 MB in the beginning and 87.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1167.01 ms. Allocated memory is still 123.7 MB. Free memory was 87.1 MB in the beginning and 48.8 MB in the end (delta: 38.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17016.29 ms. Allocated memory was 123.7 MB in the beginning and 159.4 MB in the end (delta: 35.7 MB). Free memory was 48.8 MB in the beginning and 58.1 MB in the end (delta: -9.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB. * Witness Printer took 44.61 ms. Allocated memory is still 159.4 MB. Free memory was 58.1 MB in the beginning and 56.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 16.8s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3487 SDtfs, 5208 SDslu, 5333 SDs, 0 SdLazy, 16207 SolverSat, 644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.6s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s 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-11-02 22:55:45,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e458b82-1369-4a0e-b016-cb439ace35f9/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)